Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search

DOI10.1287/TRSC.29.1.30MaRDI QIDQ4836838zbMATH OpenOpenAlexFDO

Authors N. R. Natraj, John N. Hooker

Publication date 23 November 1995

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.29.1.30

zbMATH Keywords

classical chain decomposition modeltime windowsvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• A unified tabu search heuristic for vehicle routing problems with time windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Tabu search heuristics for the vehicle routing problem with time windows.

Cited in

(5)

• A robust strategy approach to a strategic mobility problem
• Routing problems: A bibliography
• Metaheuristics: A bibliography
• Mixed logical-linear programming
• The multiple TSP with time windows: vehicle bounds based on precedence graphs

This page was built for publication: Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836838)