Pages that link to "Item:Q4156166"
From MaRDI portal
The following pages link to Technical Note—An Effective Heuristic for the <i>M</i>-Tour Traveling Salesman Problem with Some Side Conditions (Q4156166):
Displayed 22 items.
- A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
- An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
- The school bus routing problem: a review (Q1039772) (← links)
- Stochastic vehicle routing: A comprehensive approach (Q1054633) (← links)
- The savings algorithm for the vehicle routing problem (Q1097832) (← links)
- A modular algorithm for an extended vehicle scheduling problem (Q1162919) (← links)
- Combination of local search and CLP in the vehicle-fleet scheduling problem (Q1278727) (← links)
- A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
- A period vehicle routing case study (Q1604063) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
- Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem (Q2214785) (← links)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016) (← links)
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
- A Heuristic Algorithm for Multi-Period Delivery Planning Problems (Q3494695) (← links)
- The Period Vehicle Routing Problem and its Extensions (Q3564350) (← links)
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints (Q3767114) (← links)
- Graphical-structure-based models for routing problems (Q3799805) (← links)
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions (Q4305488) (← links)
- A generalized exchange heuristic for the capacitated vehicle routing problem (Q4697853) (← links)
- Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility (Q6066586) (← links)