Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints

DOI10.1080/01966324.1986.10737197zbMath0629.90048OpenAlexW1979295983WikidataQ58117301 ScholiaQ58117301MaRDI QIDQ3767114

Edward Baker, Joanne R. Schaffer

Publication date: 1986

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1986.10737197

zbMATH Keywords

heuristicsvehicle routingtime window constraintsbranch exchange procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items

The split delivery vehicle scheduling problem with time windows and grid network distances, Routing problems: A bibliography, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Improvement heuristics for the vehicle routing problem based on simulated annealing, Towards a decision support system for the ready concrete distribution system: a case of a Greek company., A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, Heuristic approaches to vehicle routing with backhauls and time windows, A parametric analysis of heuristics for the vehicle routing problem with side-constraints

Cites Work

• Unnamed Item
• Integer Programming Formulation of Traveling Salesman Problems
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• Routing with time windows by column generation
• State-space relaxation procedures for the computation of bounds to routing problems
• Implementing vehicle routing algorithms
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem