New upper bounds for the multi-depot capacitated arc routing problem

DOI10.1504/IJMHEUR.2010.033124zbMath1213.90063OpenAlexW2020067774MaRDI QIDQ537994

Adnan Yassine, Ali Kansou

Publication date: 23 May 2011

Published in: International Journal of Metaheuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmheur.2010.033124

zbMATH Keywords

memetic algorithmant colony optimisationinsertion heuristicMD-CARPmulti-depot capacitated arc routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Implicit depot assignments and rotations in vehicle routing heuristics ⋮ On games arising from multi-depot Chinese postman problems

This page was built for publication: New upper bounds for the multi-depot capacitated arc routing problem