Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search

DOI10.1007/978-3-642-21527-8_44zbMath1345.90111OpenAlexW2134767542MaRDI QIDQ3091522

Mirko Maischberger, Jean-François Cordeau

Publication date: 9 September 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_44

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem ⋮ METSlib

This page was built for publication: Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search