Chain partitioning as a key element for building vehicle routing problem heuristics

DOI10.1080/02522667.2008.10699829zbMath1178.90042OpenAlexW2320845273MaRDI QIDQ3620287

Gerrit K. Janssens

Publication date: 14 April 2009

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

spanning treevehicle routing problemchain partitioning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cites Work

• Optimal chain partitions of trees
• Probabilistic diversification and intensification in local search for vehicle routing
• A user's guide to tabu search
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Chain partitioning as a key element for building vehicle routing problem heuristics