POPMUSIC for a real-world large-scale vehicle routing problem with time windows

DOI10.1057/palgrave.jors.2602633zbMath1168.90661OpenAlexW1979112437WikidataQ59389703 ScholiaQ59389703MaRDI QIDQ3394079

A. Ostertag, Philippe Waelti, Karl F. Doerner, Éric D. Taillard, Richard F. Hartl

Publication date: 28 August 2009

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602633

zbMATH Keywords

heuristicsvehicle routingproblem decomposition

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations ⋮ POPMUSIC for the travelling salesman problem