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

DOI10.1057/PALGRAVE.JORS.2602633MaRDI QIDQ3394079zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 28 August 2009

Published in The 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)

Recommendations

• A POPMUSIC matheuristic for the capacitated vehicle routing problem
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
• POPMUSIC for the travelling salesman problem
• A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
• POPMUSIC as a matheuristic for the berth allocation problem
• Matheurísticas para resolver el problema de ruteo de vehículos con ventanas de tiempo
• A GRASP for the Vehicle Routing Problem with Time Windows
• SOMA for solving the vehicle routing problem with time windows
• Real-time vehicle rerouting problems with time windows

Cited in

(6)

• A POPMUSIC matheuristic for the capacitated vehicle routing problem
• POPMUSIC for the travelling salesman problem
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
• POPMUSIC -- partial optimization metaheuristic under special intensification conditions
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
• A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations

This page was built for publication: POPMUSIC for a real-world large-scale vehicle routing problem with time windows

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