scientific article; zbMATH DE number 1264444

MaRDI QIDQ4233387zbMATH OpenFDO

Authors Anja Hamacher, Christoph Moll

Publication date 16 March 1999

zbMATH Keywords

clusteringgreedy algorithmheuristicnarrow time windowstree partitionvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• A heuristic for the vehicle routing problem with time windows
• An Heuristic Method for Solving Time-Sensitive Routeing Problems
• A bi-criteria heuristic for the vehicle routing problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

Cited in

(6)

• A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
• Minimizing customers' waiting time in a vehicle routing problem with unit demands
• An Heuristic Method for Solving Time-Sensitive Routeing Problems
• Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case
• A greedy look-ahead heuristic for the vehicle routing problem with time windows
• scientific article; zbMATH DE number 6129109 (Why is no real title available?)

This page was built for publication:

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