fix(solver): show progressive sixty second routing solves

Run the Bergamo field-service demo for the full 60 second lifecycle and replace the plateau-prone local-search setup with explicit list, swap, sublist, and reverse neighborhoods over TechnicianRoute.visits.

Use hill climbing with first-best-score-improving foraging so the solver reports real score improvements instead of equal-score churn. The verified LARGE run moves from -48hard/0soft through 0hard/696soft, 0hard/1461soft, 0hard/1723soft, and 0hard/1825soft before completing at 60000 ms.

solver.toml

@@ -1,17 +1,48 @@
 [[phases]]
 type = "construction_heuristic"
-construction_heuristic_type = "list_cheapest_insertion"
+construction_heuristic_type = "list_round_robin"
 
 [[phases]]
 type = "local_search"
 
 [phases.acceptor]
-late_acceptance_size = 400
-type = "late_acceptance"
+type = "hill_climbing"
 
 [phases.forager]
-limit = 4
-type = "accepted_count"
+type = "first_best_score_improving"
+
+[phases.move_selector]
+type = "union_move_selector"
+selection_order = "round_robin"
+
+[[phases.move_selector.selectors]]
+type = "list_change_move_selector"
+entity_class = "TechnicianRoute"
+variable_name = "visits"
+
+[[phases.move_selector.selectors]]
+type = "list_swap_move_selector"
+entity_class = "TechnicianRoute"
+variable_name = "visits"
+
+[[phases.move_selector.selectors]]
+type = "sublist_change_move_selector"
+min_sublist_size = 1
+max_sublist_size = 3
+entity_class = "TechnicianRoute"
+variable_name = "visits"
+
+[[phases.move_selector.selectors]]
+type = "sublist_swap_move_selector"
+min_sublist_size = 1
+max_sublist_size = 3
+entity_class = "TechnicianRoute"
+variable_name = "visits"
+
+[[phases.move_selector.selectors]]
+type = "list_reverse_move_selector"
+entity_class = "TechnicianRoute"
+variable_name = "visits"
 
 [termination]
-seconds_spent_limit = 45
+seconds_spent_limit = 60