fieldopt-core 0.7.0

Field-survey design under real field cost: travel matrices, GRASP routing of field work (TSP/VRP), spatially balanced sampling (local pivotal method), Horvitz-Thompson estimation with local-mean variance, and cost-aware allocation. Pure Rust, no dependencies.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
//! The routing solver behind [`crate::routing::solve_routes`]: a hybrid
//! genetic search in the spirit of Vidal (2022) with an optimal split of
//! giant tours (Prins 2004), a local search with granular neighbourhoods
//! (Toth and Vigo 2003) made of intra-route 2-opt and Or-opt and inter-route
//! relocate, swap, SWAP* (Vidal 2022: exchange two units, each inserted at
//! its best position in the other route) and 2-opt* moves, an exact dynamic
//! programme for small instances, and the Held-Karp 1-tree bound for single
//! tours. The genetic search keeps feasible and infeasible subpopulations
//! with adaptive penalties on the excess load, duration and stops, prices
//! moves from route totals and prefix sums in constant time, restarts its
//! population after a long run without improvement and can stop on a time
//! limit.

use crate::distance::Matrix;
use crate::rng::Rng;
use crate::routing::{construct, or_opt, route_length, two_opt, RouteLimits};

/// Largest number of units solved exactly by dynamic programming.
pub const EXACT_MAX_UNITS: usize = 13;
/// Size of the granular neighbourhoods of the local search.
const GRANULARITY: usize = 20;

/// Everything the solver needs about one instance.
pub(crate) struct Instance<'a> {
    pub m: &'a Matrix,
    pub depot: usize,
    pub service: Vec<f64>,
    pub demand: Vec<f64>,
    pub limits: RouteLimits,
    pub symmetric: bool,
    /// Nearest units of every node (units only), by travel cost.
    neighbours: Vec<Vec<usize>>,
}

impl<'a> Instance<'a> {
    pub fn new(
        m: &'a Matrix,
        depot: usize,
        units: &[usize],
        service: Vec<f64>,
        demand: Vec<f64>,
        limits: RouteLimits,
        symmetric: bool,
    ) -> Self {
        let n = m.len();
        let mut neighbours = vec![Vec::new(); n];
        for &u in units.iter().chain(std::iter::once(&depot)) {
            let mut others: Vec<(f64, usize)> = units
                .iter()
                .filter(|&&v| v != u)
                .map(|&v| (m.get(u, v).min(m.get(v, u)), v))
                .collect();
            others.sort_by(|a, b| a.0.partial_cmp(&b.0).unwrap_or(std::cmp::Ordering::Equal));
            others.truncate(GRANULARITY);
            neighbours[u] = others.into_iter().map(|(_, v)| v).collect();
        }
        Instance {
            m,
            depot,
            service,
            demand,
            limits,
            symmetric,
            neighbours,
        }
    }

    #[inline]
    fn c(&self, i: usize, j: usize) -> f64 {
        self.m.get(i, j)
    }

    /// Travel, duration and load of a route.
    pub fn evaluate(&self, route: &[usize]) -> (f64, f64, f64) {
        let travel = route_length(self.m, self.depot, route);
        let served: f64 = route.iter().map(|&u| self.service[u]).sum();
        let load: f64 = route.iter().map(|&u| self.demand[u]).sum();
        (travel, travel + served, load)
    }

    pub fn feasible(&self, route: &[usize]) -> bool {
        if route.len() > self.limits.max_stops {
            return false;
        }
        let (_, duration, load) = self.evaluate(route);
        duration <= self.limits.max_length + 1e-9 && load <= self.limits.capacity + 1e-9
    }

    /// Whether a single route through every unit is allowed by the limits.
    pub fn single_route_allowed(&self, units: &[usize]) -> bool {
        self.limits.max_length.is_infinite()
            && self.limits.max_stops >= units.len()
            && units.iter().map(|&u| self.demand[u]).sum::<f64>() <= self.limits.capacity + 1e-9
    }
}

/// Penalty weights on the excess load, duration and stops of a route; the
/// search walks through infeasible solutions at this price (Vidal 2022).
#[derive(Clone, Copy, Debug)]
pub(crate) struct Penalties {
    pub load: f64,
    pub duration: f64,
    pub stops: f64,
}

impl Penalties {
    fn scaled(self, k: f64) -> Penalties {
        Penalties {
            load: self.load * k,
            duration: self.duration * k,
            stops: self.stops * k,
        }
    }
}

/// Totals and prefix sums of one route, so that moves are priced in O(1).
#[derive(Clone, Debug, Default)]
struct RouteInfo {
    travel: f64,
    load: f64,
    service: f64,
    /// `pre_t[k]`: travel from the depot to `route[k]`; `suf_t[k]`: travel from
    /// `route[k]` to the depot through the rest of the route.
    pre_t: Vec<f64>,
    suf_t: Vec<f64>,
    pre_l: Vec<f64>,
    pre_s: Vec<f64>,
}

impl RouteInfo {
    fn new(inst: &Instance, route: &[usize]) -> Self {
        let d = inst.depot;
        let n = route.len();
        let mut info = RouteInfo::default();
        if n == 0 {
            return info;
        }
        info.pre_t = vec![0.0; n];
        info.suf_t = vec![0.0; n];
        info.pre_l = vec![0.0; n];
        info.pre_s = vec![0.0; n];
        info.pre_t[0] = inst.c(d, route[0]);
        info.pre_l[0] = inst.demand[route[0]];
        info.pre_s[0] = inst.service[route[0]];
        for k in 1..n {
            info.pre_t[k] = info.pre_t[k - 1] + inst.c(route[k - 1], route[k]);
            info.pre_l[k] = info.pre_l[k - 1] + inst.demand[route[k]];
            info.pre_s[k] = info.pre_s[k - 1] + inst.service[route[k]];
        }
        info.suf_t[n - 1] = inst.c(route[n - 1], d);
        for k in (0..n - 1).rev() {
            info.suf_t[k] = inst.c(route[k], route[k + 1]) + info.suf_t[k + 1];
        }
        info.travel = info.pre_t[n - 1] + inst.c(route[n - 1], d);
        info.load = info.pre_l[n - 1];
        info.service = info.pre_s[n - 1];
        info
    }
}

#[inline]
fn excess(x: f64, limit: f64) -> f64 {
    if x > limit {
        x - limit
    } else {
        0.0
    }
}

impl<'a> Instance<'a> {
    /// Penalised cost of a route given its totals.
    #[inline]
    fn route_cost(
        &self,
        travel: f64,
        load: f64,
        service: f64,
        stops: usize,
        pen: &Penalties,
    ) -> f64 {
        let l = &self.limits;
        travel
            + pen.load * excess(load, l.capacity)
            + pen.duration * excess(travel + service, l.max_length)
            + pen.stops
                * excess(
                    stops as f64,
                    if l.max_stops == usize::MAX {
                        f64::INFINITY
                    } else {
                        l.max_stops as f64
                    },
                )
    }

    #[inline]
    fn info_cost(&self, info: &RouteInfo, stops: usize, pen: &Penalties) -> f64 {
        self.route_cost(info.travel, info.load, info.service, stops, pen)
    }
}

/// A set of routes with their totals.
#[derive(Clone, Debug)]
pub(crate) struct Sol {
    routes: Vec<Vec<usize>>,
    infos: Vec<RouteInfo>,
}

impl Sol {
    fn new(inst: &Instance, routes: Vec<Vec<usize>>) -> Self {
        let infos = routes.iter().map(|r| RouteInfo::new(inst, r)).collect();
        Sol { routes, infos }
    }

    fn travel(&self) -> f64 {
        self.infos.iter().map(|i| i.travel).sum()
    }

    fn cost(&self, inst: &Instance, pen: &Penalties) -> f64 {
        self.routes
            .iter()
            .zip(&self.infos)
            .map(|(r, i)| inst.info_cost(i, r.len(), pen))
            .sum()
    }

    fn feasible(&self, inst: &Instance) -> bool {
        self.routes.iter().all(|r| inst.feasible(r))
    }

    fn refresh(&mut self, inst: &Instance, k: usize) {
        self.infos[k] = RouteInfo::new(inst, &self.routes[k]);
    }

    fn drop_empty(&mut self) {
        let keep: Vec<bool> = self.routes.iter().map(|r| !r.is_empty()).collect();
        let mut k = 0;
        self.routes.retain(|_| {
            k += 1;
            keep[k - 1]
        });
        k = 0;
        self.infos.retain(|_| {
            k += 1;
            keep[k - 1]
        });
    }
}

/// Optimal split of a giant tour into routes (Prins 2004) under the
/// penalised cost: routes may exceed the limits by up to half, at the
/// penalty's price. `None` when no unit can start a route (never, in
/// practice, once every unit alone is feasible).
fn split_penalised(inst: &Instance, tour: &[usize], pen: &Penalties) -> Option<Vec<Vec<usize>>> {
    let n = tour.len();
    let d = inst.depot;
    let l = &inst.limits;
    let max_load = if l.capacity.is_finite() {
        1.5 * l.capacity
    } else {
        f64::INFINITY
    };
    let max_dur = if l.max_length.is_finite() {
        1.5 * l.max_length
    } else {
        f64::INFINITY
    };
    let max_stops = if l.max_stops == usize::MAX {
        usize::MAX
    } else {
        (3 * l.max_stops + 1) / 2
    };
    let mut cost = vec![f64::INFINITY; n + 1];
    let mut pred = vec![usize::MAX; n + 1];
    cost[0] = 0.0;
    for i in 0..n {
        if !cost[i].is_finite() {
            continue;
        }
        let (mut len, mut served, mut load) = (0.0, 0.0, 0.0);
        for j in i..n {
            let stops = j - i + 1;
            if stops > max_stops {
                break;
            }
            len += if j == i {
                inst.c(d, tour[i])
            } else {
                inst.c(tour[j - 1], tour[j])
            };
            served += inst.service[tour[j]];
            load += inst.demand[tour[j]];
            if load > max_load + 1e-9 {
                break;
            }
            let travel = len + inst.c(tour[j], d);
            if travel + served > max_dur + 1e-9 {
                break;
            }
            let route_cost = inst.route_cost(travel, load, served, stops, pen);
            if cost[i] + route_cost < cost[j + 1] {
                cost[j + 1] = cost[i] + route_cost;
                pred[j + 1] = i;
            }
        }
    }
    if !cost[n].is_finite() {
        return None;
    }
    let mut routes = Vec::new();
    let mut j = n;
    while j > 0 {
        let i = pred[j];
        routes.push(tour[i..j].to_vec());
        j = i;
    }
    routes.reverse();
    Some(routes)
}

/// Feasible split of a giant tour (hard limits), used in tests.
#[cfg(test)]
pub(crate) fn split(inst: &Instance, tour: &[usize]) -> Option<Vec<Vec<usize>>> {
    let hard = Penalties {
        load: 1e12,
        duration: 1e12,
        stops: 1e12,
    };
    let routes = split_penalised(inst, tour, &hard)?;
    if routes.iter().all(|r| inst.feasible(r)) {
        Some(routes)
    } else {
        None
    }
}

#[cfg(test)]
fn total_travel(inst: &Instance, routes: &[Vec<usize>]) -> f64 {
    routes
        .iter()
        .map(|r| route_length(inst.m, inst.depot, r))
        .sum()
}

/// Cheapest insertion of `u` into `route` (travel increase and position).
fn best_insertion(inst: &Instance, route: &[usize], u: usize) -> (f64, usize) {
    let d = inst.depot;
    let mut best = (f64::INFINITY, 0usize);
    for p in 0..=route.len() {
        let x = if p == 0 { d } else { route[p - 1] };
        let y = if p == route.len() { d } else { route[p] };
        let c = inst.c(x, u) + inst.c(u, y) - inst.c(x, y);
        if c < best.0 {
            best = (c, p);
        }
    }
    best
}

/// Local search over a solution under penalised costs: intra-route 2-opt,
/// Or-opt and swap; inter-route relocate (also into a new route), swap,
/// SWAP* and 2-opt*, restricted to granular neighbourhoods. Moves are priced
/// from the route totals in constant time (SWAP* in linear time) and
/// accepted when they lower the penalised cost.
fn local_search_pen(inst: &Instance, sol: &mut Sol, pen: &Penalties, rng: &mut Rng) {
    let d = inst.depot;
    let n = inst.m.len();
    let l = &inst.limits;
    let mut guard = 0usize;
    loop {
        guard += 1;
        let mut improved = false;
        // intra-route moves on travel: they never raise a penalty
        for k in 0..sol.routes.len() {
            let mut changed = false;
            if two_opt(inst.m, d, &mut sol.routes[k], inst.symmetric) {
                changed = true;
            }
            if or_opt(inst.m, d, &mut sol.routes[k], inst.symmetric) {
                changed = true;
            }
            if changed {
                sol.refresh(inst, k);
                improved = true;
            }
        }
        sol.drop_empty();
        let mut pos = vec![(usize::MAX, usize::MAX); n];
        for (a, r) in sol.routes.iter().enumerate() {
            for (i, &u) in r.iter().enumerate() {
                pos[u] = (a, i);
            }
        }
        let mut order: Vec<usize> = sol.routes.iter().flatten().copied().collect();
        rng.shuffle(&mut order);
        let prev = |r: &[usize], i: usize| if i == 0 { d } else { r[i - 1] };
        let next = |r: &[usize], i: usize| if i + 1 >= r.len() { d } else { r[i + 1] };
        let cost_of = |travel: f64, load: f64, service: f64, stops: usize| {
            inst.route_cost(travel, load, service, stops, pen)
        };
        'scan: for &u in &order {
            let (a, i) = pos[u];
            let ra = &sol.routes[a];
            let ia = &sol.infos[a];
            let (pa, na) = (prev(ra, i), next(ra, i));
            let (du, su) = (inst.demand[u], inst.service[u]);
            let remove_gain = inst.c(pa, u) + inst.c(u, na) - inst.c(pa, na);
            let cost_a = inst.info_cost(ia, ra.len(), pen);
            let cost_a_without = cost_of(
                ia.travel - remove_gain,
                ia.load - du,
                ia.service - su,
                ra.len() - 1,
            );
            // relocate u into a route of its own (worth it when a is overloaded)
            if ra.len() > 1 {
                let alone = cost_of(inst.c(d, u) + inst.c(u, d), du, su, 1);
                if cost_a_without + alone < cost_a - 1e-9 {
                    sol.routes[a].remove(i);
                    sol.routes.push(vec![u]);
                    sol.infos.push(RouteInfo::default());
                    let last = sol.routes.len() - 1;
                    sol.refresh(inst, a);
                    sol.refresh(inst, last);
                    improved = true;
                    break 'scan;
                }
            }
            // intra-route swap with a neighbour
            for &v in &inst.neighbours[u] {
                let (b, j) = pos[v];
                if b != a || j == i {
                    continue;
                }
                let (lo, hi) = if i < j { (i, j) } else { (j, i) };
                let (x, y) = (ra[lo], ra[hi]);
                let (px, ny) = (prev(ra, lo), next(ra, hi));
                let delta = if hi == lo + 1 {
                    inst.c(px, y) + inst.c(y, x) + inst.c(x, ny)
                        - inst.c(px, x)
                        - inst.c(x, y)
                        - inst.c(y, ny)
                } else {
                    let (nx, py) = (ra[lo + 1], ra[hi - 1]);
                    inst.c(px, y) + inst.c(y, nx) + inst.c(py, x) + inst.c(x, ny)
                        - inst.c(px, x)
                        - inst.c(x, nx)
                        - inst.c(py, y)
                        - inst.c(y, ny)
                };
                if delta < -1e-9 {
                    sol.routes[a].swap(lo, hi);
                    sol.refresh(inst, a);
                    improved = true;
                    break 'scan;
                }
            }
            // relocate u at the start of every other route
            for b in 0..sol.routes.len() {
                if b == a {
                    continue;
                }
                let rb = &sol.routes[b];
                let ib = &sol.infos[b];
                let first = rb[0];
                let ins = inst.c(d, u) + inst.c(u, first) - inst.c(d, first);
                let cost_b = inst.info_cost(ib, rb.len(), pen);
                let new_b = cost_of(ib.travel + ins, ib.load + du, ib.service + su, rb.len() + 1);
                if cost_a_without + new_b < cost_a + cost_b - 1e-9 {
                    sol.routes[a].remove(i);
                    sol.routes[b].insert(0, u);
                    sol.refresh(inst, a);
                    sol.refresh(inst, b);
                    improved = true;
                    break 'scan;
                }
            }
            for &v in &inst.neighbours[u] {
                let (b, j) = pos[v];
                if b == usize::MAX || b == a {
                    continue;
                }
                let rb = &sol.routes[b];
                let ib = &sol.infos[b];
                let (pb, nb) = (prev(rb, j), next(rb, j));
                let (dv, sv) = (inst.demand[v], inst.service[v]);
                let cost_b = inst.info_cost(ib, rb.len(), pen);
                let base = cost_a + cost_b;
                // relocate u after v
                let ins = inst.c(v, u) + inst.c(u, nb) - inst.c(v, nb);
                let new_b = cost_of(ib.travel + ins, ib.load + du, ib.service + su, rb.len() + 1);
                if cost_a_without + new_b < base - 1e-9 {
                    sol.routes[a].remove(i);
                    sol.routes[b].insert(j + 1, u);
                    sol.refresh(inst, a);
                    sol.refresh(inst, b);
                    improved = true;
                    break 'scan;
                }
                // relocate u before v
                let ins = inst.c(pb, u) + inst.c(u, v) - inst.c(pb, v);
                let new_b = cost_of(ib.travel + ins, ib.load + du, ib.service + su, rb.len() + 1);
                if cost_a_without + new_b < base - 1e-9 {
                    sol.routes[a].remove(i);
                    sol.routes[b].insert(j, u);
                    sol.refresh(inst, a);
                    sol.refresh(inst, b);
                    improved = true;
                    break 'scan;
                }
                // swap u and v in place
                let ta = ia.travel - inst.c(pa, u) - inst.c(u, na) + inst.c(pa, v) + inst.c(v, na);
                let tb = ib.travel - inst.c(pb, v) - inst.c(v, nb) + inst.c(pb, u) + inst.c(u, nb);
                let new_a = cost_of(ta, ia.load - du + dv, ia.service - su + sv, ra.len());
                let new_b = cost_of(tb, ib.load - dv + du, ib.service - sv + su, rb.len());
                if new_a + new_b < base - 1e-9 {
                    sol.routes[a][i] = v;
                    sol.routes[b][j] = u;
                    sol.refresh(inst, a);
                    sol.refresh(inst, b);
                    improved = true;
                    break 'scan;
                }
                // 2-opt*: a[..=i] + b[j+1..] and b[..=j] + a[i+1..]
                let tail_a = if i + 1 < ra.len() {
                    inst.c(u, ra[i + 1]) + ia.suf_t[i + 1]
                } else {
                    inst.c(u, d)
                };
                let tail_b = if j + 1 < rb.len() {
                    inst.c(v, rb[j + 1]) + ib.suf_t[j + 1]
                } else {
                    inst.c(v, d)
                };
                let cross_a = if j + 1 < rb.len() {
                    inst.c(u, rb[j + 1]) + ib.suf_t[j + 1]
                } else {
                    inst.c(u, d)
                };
                let cross_b = if i + 1 < ra.len() {
                    inst.c(v, ra[i + 1]) + ia.suf_t[i + 1]
                } else {
                    inst.c(v, d)
                };
                let _ = (tail_a, tail_b);
                let ta = ia.pre_t[i] + cross_a;
                let tb = ib.pre_t[j] + cross_b;
                let la = ia.pre_l[i] + (ib.load - ib.pre_l[j]);
                let lb = ib.pre_l[j] + (ia.load - ia.pre_l[i]);
                let sa = ia.pre_s[i] + (ib.service - ib.pre_s[j]);
                let sb = ib.pre_s[j] + (ia.service - ia.pre_s[i]);
                let na_stops = i + 1 + (rb.len() - j - 1);
                let nb_stops = j + 1 + (ra.len() - i - 1);
                let new_a = cost_of(ta, la, sa, na_stops);
                let new_b = cost_of(tb, lb, sb, nb_stops);
                if new_a + new_b < base - 1e-9 {
                    let mut new_ra: Vec<usize> = ra[..=i].to_vec();
                    new_ra.extend_from_slice(&rb[j + 1..]);
                    let mut new_rb: Vec<usize> = rb[..=j].to_vec();
                    new_rb.extend_from_slice(&ra[i + 1..]);
                    sol.routes[a] = new_ra;
                    sol.routes[b] = new_rb;
                    sol.refresh(inst, a);
                    sol.refresh(inst, b);
                    improved = true;
                    break 'scan;
                }
                // SWAP*: u to its best position in b without v, v to its best position in a without u
                let remove_gain_v = inst.c(pb, v) + inst.c(v, nb) - inst.c(pb, nb);
                let mut ra2 = ra.clone();
                ra2.remove(i);
                let mut rb2 = rb.clone();
                rb2.remove(j);
                let (ins_u, pos_u) = best_insertion(inst, &rb2, u);
                let (ins_v, pos_v) = best_insertion(inst, &ra2, v);
                let new_a = cost_of(
                    ia.travel - remove_gain + ins_v,
                    ia.load - du + dv,
                    ia.service - su + sv,
                    ra.len(),
                );
                let new_b = cost_of(
                    ib.travel - remove_gain_v + ins_u,
                    ib.load - dv + du,
                    ib.service - sv + su,
                    rb.len(),
                );
                if new_a + new_b < base - 1e-9 {
                    rb2.insert(pos_u, u);
                    ra2.insert(pos_v, v);
                    sol.routes[a] = ra2;
                    sol.routes[b] = rb2;
                    sol.refresh(inst, a);
                    sol.refresh(inst, b);
                    improved = true;
                    break 'scan;
                }
            }
        }
        sol.drop_empty();
        if !improved || guard > 20_000 {
            break;
        }
    }
    let _ = l;
}

/// Local search with hard limits (feasible in, feasible out), used in tests.
#[cfg(test)]
pub(crate) fn local_search(inst: &Instance, routes: &mut Vec<Vec<usize>>, rng: &mut Rng) {
    let hard = Penalties {
        load: 1e12,
        duration: 1e12,
        stops: 1e12,
    };
    let mut sol = Sol::new(inst, std::mem::take(routes));
    local_search_pen(inst, &mut sol, &hard, rng);
    *routes = sol.routes;
}

struct Indiv {
    tour: Vec<usize>,
    routes: Vec<Vec<usize>>,
    /// Penalised cost at the time of insertion.
    cost: f64,
}

/// Broken-pairs distance between two giant tours (fraction of successor
/// pairs of `a`, depot included, not present in `b`).
fn broken_pairs(a: &[usize], b: &[usize], n: usize, depot: usize) -> f64 {
    let mut succ = vec![usize::MAX; n];
    let mut prevb = depot;
    for &u in b {
        succ[prevb] = u;
        prevb = u;
    }
    succ[prevb] = depot;
    let mut prev = depot;
    let mut broken = 0usize;
    for &u in a {
        if succ[prev] != u {
            broken += 1;
        }
        prev = u;
    }
    if succ[prev] != depot {
        broken += 1;
    }
    broken as f64 / (a.len() + 1) as f64
}

/// Order crossover of two permutations.
fn order_crossover(p1: &[usize], p2: &[usize], rng: &mut Rng) -> Vec<usize> {
    let n = p1.len();
    let mut i = rng.below(n);
    let mut j = rng.below(n);
    if i > j {
        std::mem::swap(&mut i, &mut j);
    }
    let mut child = vec![usize::MAX; n];
    let mut used = vec![false; p1.iter().max().copied().unwrap_or(0) + 1];
    for k in i..=j {
        child[k] = p1[k];
        used[p1[k]] = true;
    }
    let mut k = (j + 1) % n;
    for t in 0..n {
        let v = p2[(j + 1 + t) % n];
        if !used[v] {
            child[k] = v;
            used[v] = true;
            k = (k + 1) % n;
        }
    }
    child
}

/// Biased fitness ranks (lower is better) from cost and diversity within a
/// subpopulation.
fn biased_fitness(
    pop: &[Indiv],
    n: usize,
    depot: usize,
    nb_elite: usize,
    nb_close: usize,
) -> Vec<f64> {
    let len = pop.len();
    if len <= 1 {
        return vec![0.0; len];
    }
    let mut cost_rank: Vec<usize> = (0..len).collect();
    cost_rank.sort_by(|&a, &b| {
        pop[a]
            .cost
            .partial_cmp(&pop[b].cost)
            .unwrap_or(std::cmp::Ordering::Equal)
    });
    let mut rank_cost = vec![0.0; len];
    for (r, &i) in cost_rank.iter().enumerate() {
        rank_cost[i] = r as f64;
    }
    let diversity: Vec<f64> = (0..len)
        .map(|i| {
            let mut ds: Vec<f64> = (0..len)
                .filter(|&j| j != i)
                .map(|j| broken_pairs(&pop[i].tour, &pop[j].tour, n, depot))
                .collect();
            ds.sort_by(|a, b| a.partial_cmp(b).unwrap_or(std::cmp::Ordering::Equal));
            let k = nb_close.min(ds.len()).max(1);
            ds[..k].iter().sum::<f64>() / k as f64
        })
        .collect();
    let mut div_rank: Vec<usize> = (0..len).collect();
    div_rank.sort_by(|&a, &b| {
        diversity[b]
            .partial_cmp(&diversity[a])
            .unwrap_or(std::cmp::Ordering::Equal)
    });
    let mut rank_div = vec![0.0; len];
    for (r, &i) in div_rank.iter().enumerate() {
        rank_div[i] = r as f64;
    }
    let w = 1.0 - nb_elite as f64 / len as f64;
    (0..len)
        .map(|i| (rank_cost[i] + w * rank_div[i]) / (len - 1) as f64)
        .collect()
}

/// Survivor selection of one subpopulation: clones first, then the worst
/// biased fitness, never the best individual.
fn survivors(
    pop: &mut Vec<Indiv>,
    mu: usize,
    n: usize,
    depot: usize,
    nb_elite: usize,
    nb_close: usize,
) {
    while pop.len() > mu {
        let fit = biased_fitness(pop, n, depot, nb_elite, nb_close);
        let best_idx = (0..pop.len())
            .min_by(|&a, &b| {
                pop[a]
                    .cost
                    .partial_cmp(&pop[b].cost)
                    .unwrap_or(std::cmp::Ordering::Equal)
            })
            .unwrap();
        let clone = (0..pop.len()).find(|&i| {
            i != best_idx && (0..pop.len()).any(|j| j != i && pop[i].tour == pop[j].tour)
        });
        let drop = clone.unwrap_or_else(|| {
            (0..pop.len())
                .filter(|&i| i != best_idx)
                .max_by(|&a, &b| {
                    fit[a]
                        .partial_cmp(&fit[b])
                        .unwrap_or(std::cmp::Ordering::Equal)
                })
                .unwrap()
        });
        pop.swap_remove(drop);
    }
}

/// Initial penalties from the scale of the instance (Vidal 2022).
fn initial_penalties(inst: &Instance, units: &[usize]) -> Penalties {
    let mut max_dist: f64 = 0.0;
    for &u in units {
        max_dist = max_dist
            .max(inst.c(inst.depot, u))
            .max(inst.c(u, inst.depot));
        for &v in &inst.neighbours[u] {
            max_dist = max_dist.max(inst.c(u, v));
        }
    }
    let max_dist = max_dist.max(1e-9);
    let max_demand = units
        .iter()
        .map(|&u| inst.demand[u])
        .fold(0.0, f64::max)
        .max(1e-9);
    Penalties {
        load: (max_dist / max_demand).clamp(0.1, 1e4),
        duration: 1.0,
        stops: max_dist,
    }
}

/// Hybrid genetic search with feasible and infeasible subpopulations and
/// adaptive penalties. Returns the best feasible routes, their travel and the
/// offspring at which they were found.
pub(crate) fn hgs(
    inst: &Instance,
    units: &[usize],
    iterations: usize,
    alpha: f64,
    time_limit: f64,
    rng: &mut Rng,
) -> Option<(Vec<Vec<usize>>, f64, usize)> {
    let n = inst.m.len();
    let (mu, lambda, nb_elite, nb_close) = (10usize, 20usize, 4usize, 3usize);
    let target_feasible = 0.2;
    let start = std::time::Instant::now();
    let mut pen = initial_penalties(inst, units);
    let mut feas: Vec<Indiv> = Vec::new();
    let mut infeas: Vec<Indiv> = Vec::new();
    let mut best: Option<(Vec<Vec<usize>>, f64, usize)> = None;
    let mut last_improvement = 0usize;
    let patience = (iterations / 4).max(500);
    // feasibility history of the last offspring, per limit, for the penalty manager
    let mut hist_load: Vec<bool> = Vec::new();
    let mut hist_dur: Vec<bool> = Vec::new();
    let mut hist_stops: Vec<bool> = Vec::new();

    let educate = |tour: Vec<usize>, pen: &Penalties, rng: &mut Rng| -> Option<Sol> {
        let routes = split_penalised(inst, &tour, pen)?;
        let mut sol = Sol::new(inst, routes);
        local_search_pen(inst, &mut sol, pen, rng);
        Some(sol)
    };
    let add = |sol: Sol,
               it: usize,
               feas: &mut Vec<Indiv>,
               infeas: &mut Vec<Indiv>,
               best: &mut Option<(Vec<Vec<usize>>, f64, usize)>,
               pen: &Penalties| {
        let feasible = sol.feasible(inst);
        let travel = sol.travel();
        let cost = sol.cost(inst, pen);
        let tour: Vec<usize> = sol.routes.iter().flatten().copied().collect();
        if feasible && best.as_ref().map_or(true, |b| travel < b.1 - 1e-9) {
            *best = Some((sol.routes.clone(), travel, it));
        }
        let ind = Indiv {
            tour,
            routes: sol.routes,
            cost,
        };
        if feasible {
            feas.push(ind);
        } else {
            infeas.push(ind);
        }
        feasible
    };
    for k in 0..mu {
        let a = if k == 0 { 0.0 } else { alpha.max(0.2) };
        let tour = construct(inst.m, inst.depot, units, a, rng);
        // seed with hard limits so that a feasible solution exists from the start
        let hard = pen.scaled(1e9);
        let sol = educate(tour, &hard, rng)?;
        add(sol, 0, &mut feas, &mut infeas, &mut best, &pen);
    }
    best.as_ref()?;
    let mut it = 0usize;
    loop {
        it += 1;
        let out_of_iterations = time_limit.is_infinite() && it > iterations;
        let out_of_time = time_limit.is_finite() && start.elapsed().as_secs_f64() >= time_limit;
        if out_of_iterations || out_of_time {
            break;
        }
        if let Some(b) = &best {
            if it - b.2.max(last_improvement) > patience {
                let keep: Vec<usize> = b.0.iter().flatten().copied().collect();
                feas.clear();
                infeas.clear();
                let seed_sol = Sol::new(inst, b.0.clone());
                add(seed_sol, it, &mut feas, &mut infeas, &mut best, &pen);
                for _ in 1..mu {
                    let tour = construct(inst.m, inst.depot, units, alpha.max(0.3), rng);
                    if let Some(sol) = educate(tour, &pen.scaled(1e9), rng) {
                        add(sol, it, &mut feas, &mut infeas, &mut best, &pen);
                    }
                }
                let _ = keep;
                last_improvement = it;
            }
        }
        // parent selection: binary tournament over both subpopulations, fitness within each
        let fit_f = biased_fitness(&feas, n, inst.depot, nb_elite, nb_close);
        let fit_i = biased_fitness(&infeas, n, inst.depot, nb_elite, nb_close);
        let total = feas.len() + infeas.len();
        let pick = |rng: &mut Rng| -> (bool, usize) {
            let draw = |rng: &mut Rng| {
                let k = rng.below(total);
                if k < feas.len() {
                    (true, k)
                } else {
                    (false, k - feas.len())
                }
            };
            let (a, b) = (draw(rng), draw(rng));
            let f = |x: (bool, usize)| if x.0 { fit_f[x.1] } else { fit_i[x.1] };
            if f(a) <= f(b) {
                a
            } else {
                b
            }
        };
        let (p1, p2) = (pick(rng), pick(rng));
        let t1 = if p1.0 {
            &feas[p1.1].tour
        } else {
            &infeas[p1.1].tour
        };
        let t2 = if p2.0 {
            &feas[p2.1].tour
        } else {
            &infeas[p2.1].tour
        };
        let child = order_crossover(t1, t2, rng);
        if let Some(mut sol) = educate(child, &pen, rng) {
            let routes_ok: Vec<bool> = sol.routes.iter().map(|r| inst.feasible(r)).collect();
            let feasible = routes_ok.iter().all(|&f| f);
            // record which limits were violated
            let l = &inst.limits;
            let (mut v_load, mut v_dur, mut v_stops) = (false, false, false);
            for (r, i) in sol.routes.iter().zip(&sol.infos) {
                if i.load > l.capacity + 1e-9 {
                    v_load = true;
                }
                if i.travel + i.service > l.max_length + 1e-9 {
                    v_dur = true;
                }
                if r.len() > l.max_stops {
                    v_stops = true;
                }
            }
            hist_load.push(!v_load);
            hist_dur.push(!v_dur);
            hist_stops.push(!v_stops);
            // repair attempt with a tenfold penalty, half of the time
            if !feasible && rng.next_f64() < 0.5 {
                let mut repaired = sol.clone();
                local_search_pen(inst, &mut repaired, &pen.scaled(10.0), rng);
                if repaired.feasible(inst) {
                    sol = repaired;
                }
            }
            let was_feasible = add(sol, it, &mut feas, &mut infeas, &mut best, &pen);
            if was_feasible {
                if let Some(b) = &best {
                    if b.2 == it {
                        last_improvement = it;
                    }
                }
            }
        }
        if feas.len() >= mu + lambda {
            survivors(&mut feas, mu, n, inst.depot, nb_elite, nb_close);
        }
        if infeas.len() >= mu + lambda {
            survivors(&mut infeas, mu, n, inst.depot, nb_elite, nb_close);
        }
        // penalty manager every 100 offspring
        if it % 100 == 0 {
            let adjust = |hist: &mut Vec<bool>, p: &mut f64| {
                if hist.is_empty() {
                    return;
                }
                let frac = hist.iter().filter(|&&f| f).count() as f64 / hist.len() as f64;
                if frac < target_feasible - 0.05 {
                    *p = (*p * 1.2).min(1e6);
                } else if frac > target_feasible + 0.05 {
                    *p = (*p * 0.85).max(1e-3);
                }
                hist.clear();
            };
            adjust(&mut hist_load, &mut pen.load);
            adjust(&mut hist_dur, &mut pen.duration);
            adjust(&mut hist_stops, &mut pen.stops);
            // re-price the stored individuals under the new penalties
            for ind in feas.iter_mut().chain(infeas.iter_mut()) {
                let s = Sol::new(inst, ind.routes.clone());
                ind.cost = s.cost(inst, &pen);
            }
        }
    }
    let _ = (feas, infeas);
    best
}

/// Exact solution by dynamic programming over subsets: optimal tours of
/// every subset (Held and Karp 1962) and an optimal partition into feasible
/// routes. For at most [`EXACT_MAX_UNITS`] units. Returns `None` when the
/// limits cannot be met.
pub(crate) fn exact(inst: &Instance, units: &[usize]) -> Option<(Vec<Vec<usize>>, f64)> {
    let n = units.len();
    if n == 0 || n > EXACT_MAX_UNITS {
        return None;
    }
    let d = inst.depot;
    let full = (1usize << n) - 1;
    let size = 1usize << n;
    let inf = f64::INFINITY;
    // dp[s * n + j]: cheapest path depot -> units of s -> units[j] (j in s)
    let mut dp = vec![inf; size * n];
    let mut par = vec![usize::MAX; size * n];
    for j in 0..n {
        dp[(1 << j) * n + j] = inst.c(d, units[j]);
    }
    for s in 1..size {
        for j in 0..n {
            let cur = dp[s * n + j];
            if !cur.is_finite() || s & (1 << j) == 0 {
                continue;
            }
            for k in 0..n {
                if s & (1 << k) != 0 {
                    continue;
                }
                let t = s | (1 << k);
                let v = cur + inst.c(units[j], units[k]);
                if v < dp[t * n + k] {
                    dp[t * n + k] = v;
                    par[t * n + k] = j;
                }
            }
        }
    }
    // best tour of each subset and its feasibility
    let mut tour = vec![inf; size];
    let mut last = vec![usize::MAX; size];
    let mut ok = vec![false; size];
    for s in 1..size {
        let mut served = 0.0;
        let mut load = 0.0;
        let mut stops = 0usize;
        for (j, &u) in units.iter().enumerate() {
            if s & (1 << j) != 0 {
                served += inst.service[u];
                load += inst.demand[u];
                stops += 1;
            }
        }
        for j in 0..n {
            if s & (1 << j) != 0 {
                let v = dp[s * n + j] + inst.c(units[j], d);
                if v < tour[s] {
                    tour[s] = v;
                    last[s] = j;
                }
            }
        }
        ok[s] = stops <= inst.limits.max_stops
            && load <= inst.limits.capacity + 1e-9
            && tour[s] + served <= inst.limits.max_length + 1e-9;
    }
    // partition
    let mut g = vec![inf; size];
    let mut gpart = vec![0usize; size];
    g[0] = 0.0;
    for s in 1..size {
        let low = s & s.wrapping_neg();
        let mut r = s;
        while r > 0 {
            if r & low != 0 && ok[r] && g[s ^ r].is_finite() {
                let v = tour[r] + g[s ^ r];
                if v < g[s] {
                    g[s] = v;
                    gpart[s] = r;
                }
            }
            r = (r - 1) & s;
        }
    }
    if !g[full].is_finite() {
        return None;
    }
    let mut routes = Vec::new();
    let mut s = full;
    while s > 0 {
        let r = gpart[s];
        // reconstruct the tour of r
        let mut seq = Vec::new();
        let mut cur = r;
        let mut j = last[r];
        while j != usize::MAX {
            seq.push(units[j]);
            let pj = par[cur * n + j];
            cur ^= 1 << j;
            j = pj;
        }
        seq.reverse();
        routes.push(seq);
        s ^= r;
    }
    Some((routes, g[full]))
}

/// Held-Karp 1-tree lower bound on a single tour through the depot and the
/// units of a symmetric matrix (subgradient ascent, Held and Karp 1971).
/// Returns the bound and whether the final 1-tree is itself a tour (then
/// the bound is the optimum).
pub(crate) fn held_karp_bound(
    m: &Matrix,
    depot: usize,
    units: &[usize],
    upper: f64,
) -> (f64, bool) {
    let nodes: Vec<usize> = std::iter::once(depot)
        .chain(units.iter().copied())
        .collect();
    let k = nodes.len();
    if k < 3 {
        return (
            if k == 2 {
                2.0 * m.get(nodes[0], nodes[1])
            } else {
                0.0
            },
            true,
        );
    }
    let mut pi = vec![0.0; k];
    let mut best = f64::NEG_INFINITY;
    let mut lambda = 2.0;
    let mut since = 0;
    let mut is_tour = false;
    let cost = |i: usize, j: usize, pi: &[f64]| m.get(nodes[i], nodes[j]) + pi[i] + pi[j];
    for _ in 0..300 {
        // MST on nodes 1..k with Prim
        let mut in_tree = vec![false; k];
        let mut key = vec![f64::INFINITY; k];
        let mut parent = vec![usize::MAX; k];
        let mut deg = vec![0usize; k];
        in_tree[1] = true;
        for j in 2..k {
            key[j] = cost(1, j, &pi);
            parent[j] = 1;
        }
        let mut w = 0.0;
        for _ in 2..k {
            let mut bj = usize::MAX;
            for j in 2..k {
                if !in_tree[j] && (bj == usize::MAX || key[j] < key[bj]) {
                    bj = j;
                }
            }
            in_tree[bj] = true;
            w += key[bj];
            deg[bj] += 1;
            deg[parent[bj]] += 1;
            for j in 2..k {
                if !in_tree[j] {
                    let c = cost(bj, j, &pi);
                    if c < key[j] {
                        key[j] = c;
                        parent[j] = bj;
                    }
                }
            }
        }
        // two cheapest edges from the depot (node 0)
        let mut e: Vec<(f64, usize)> = (1..k).map(|j| (cost(0, j, &pi), j)).collect();
        e.sort_by(|a, b| a.0.partial_cmp(&b.0).unwrap_or(std::cmp::Ordering::Equal));
        w += e[0].0 + e[1].0;
        deg[0] = 2;
        deg[e[0].1] += 1;
        deg[e[1].1] += 1;
        w -= 2.0 * pi.iter().sum::<f64>();
        if w > best + 1e-9 {
            best = w;
            since = 0;
        } else {
            since += 1;
            if since >= 20 {
                lambda /= 2.0;
                since = 0;
            }
        }
        let norm: f64 = deg.iter().map(|&d| (d as f64 - 2.0).powi(2)).sum();
        if norm == 0.0 {
            is_tour = true;
            break;
        }
        if lambda < 1e-4 || upper - w <= 1e-9 {
            break;
        }
        let t = lambda * (upper - w) / norm;
        for i in 0..k {
            pi[i] += t * (deg[i] as f64 - 2.0);
        }
    }
    (best.min(upper), is_tour)
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::distance::euclidean_matrix;

    fn random_instance(n: usize, seed: u64) -> Matrix {
        let mut rng = Rng::new(seed);
        let x: Vec<f64> = (0..=n).map(|_| rng.next_f64() * 100.0).collect();
        let y: Vec<f64> = (0..=n).map(|_| rng.next_f64() * 100.0).collect();
        euclidean_matrix(&x, &y).unwrap()
    }

    #[test]
    fn exact_matches_brute_force_and_hgs_finds_it() {
        for seed in 0..5u64 {
            let m = random_instance(8, seed);
            let units: Vec<usize> = (1..9).collect();
            let limits = RouteLimits {
                max_length: f64::INFINITY,
                max_stops: 3,
                capacity: f64::INFINITY,
            };
            let inst = Instance::new(&m, 0, &units, vec![0.0; 9], vec![1.0; 9], limits, true);
            let (routes, cost) = exact(&inst, &units).unwrap();
            assert!(routes.iter().all(|r| r.len() <= 3));
            assert!((total_travel(&inst, &routes) - cost).abs() < 1e-9);
            // brute force over partitions via all permutations + split
            fn perms(items: &[usize]) -> Vec<Vec<usize>> {
                if items.len() <= 1 {
                    return vec![items.to_vec()];
                }
                let mut out = Vec::new();
                for (k, &x) in items.iter().enumerate() {
                    let mut rest = items.to_vec();
                    rest.remove(k);
                    for mut p in perms(&rest) {
                        p.insert(0, x);
                        out.push(p);
                    }
                }
                out
            }
            let brute = perms(&units)
                .iter()
                .filter_map(|p| split(&inst, p).map(|r| total_travel(&inst, &r)))
                .fold(f64::INFINITY, f64::min);
            assert!(
                (brute - cost).abs() < 1e-9,
                "seed {seed}: brute {brute} exact {cost}"
            );
            let mut rng = Rng::new(seed);
            let (_, hcost, _) = hgs(&inst, &units, 100, 0.3, f64::INFINITY, &mut rng).unwrap();
            assert!(
                hcost <= cost + 1e-9,
                "seed {seed}: hgs {hcost} > exact {cost}"
            );
        }
    }

    #[test]
    fn held_karp_is_a_valid_bound_and_certifies_small_tours() {
        for seed in 0..5u64 {
            let m = random_instance(10, seed);
            let units: Vec<usize> = (1..11).collect();
            let inst = Instance::new(
                &m,
                0,
                &units,
                vec![0.0; 11],
                vec![0.0; 11],
                RouteLimits::default(),
                true,
            );
            let (_, opt) = exact(&inst, &units).unwrap();
            let (lb, _) = held_karp_bound(&m, 0, &units, opt);
            assert!(
                lb <= opt + 1e-9,
                "seed {seed}: bound {lb} above optimum {opt}"
            );
            assert!(
                lb >= 0.9 * opt,
                "seed {seed}: bound {lb} far below optimum {opt}"
            );
        }
    }

    #[test]
    fn local_search_respects_capacity_and_improves() {
        let m = random_instance(40, 3);
        let units: Vec<usize> = (1..41).collect();
        let limits = RouteLimits {
            max_length: f64::INFINITY,
            max_stops: usize::MAX,
            capacity: 10.0,
        };
        let demand: Vec<f64> = (0..41)
            .map(|i| if i == 0 { 0.0 } else { 1.0 + (i % 3) as f64 })
            .collect();
        let inst = Instance::new(&m, 0, &units, vec![0.0; 41], demand.clone(), limits, true);
        let mut rng = Rng::new(1);
        let tour = construct(&m, 0, &units, 0.5, &mut rng);
        let mut routes = split(&inst, &tour).unwrap();
        let before = total_travel(&inst, &routes);
        local_search(&inst, &mut routes, &mut rng);
        let after = total_travel(&inst, &routes);
        assert!(after < before);
        for r in &routes {
            assert!(r.iter().map(|&u| demand[u]).sum::<f64>() <= 10.0 + 1e-9);
        }
        let mut all: Vec<usize> = routes.concat();
        all.sort();
        assert_eq!(all, units);
    }
}