Tabu Search for Vehicle Routing Problems (VRPs)

DOI10.1080/00207160211291MaRDI QIDQ4551462zbMATH OpenOpenAlexFDO

Authors

Publication date 28 September 2003

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Hill climbingtabu searchtechnological constraintstemporal constraintsvehicle routing problems

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Search theory (90B40)

Recommendations

• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Tabu search heuristics for the vehicle routing problem with time windows.
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A New Algorithm To Solve Vehicle Routing Problems (VRPs)
• A reactive tabu search for the vehicle routing problem

Cites work

• Branch-and-Bound Methods: A Survey
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 194622 (Why is no real title available?)
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Tabu Search—Part I

Cited in

(6)

• Using tabu search for solving a dynamic multi-terminal truck dispatching problem
• An open source spreadsheet solver for vehicle routing problems
• The granular tabu search and its application to the vehicle-routing problem
• A tabu search algorithm for the single vehicle routing allocation problem
• A guided tabu search for the heterogeneous vehicle routeing problem
• A New Algorithm To Solve Vehicle Routing Problems (VRPs)

This page was built for publication: Tabu Search for Vehicle Routing Problems (VRPs)

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