Open capacitated ARC routing problem by hybridized ant colony algorithm

DOI10.1051/RO/2021034MaRDI QIDQ5003514zbMATH OpenOpenAlexFDO

Authors Bilal Kanso, Ali Kansou, Adnan Yassine

Publication date 22 July 2021

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2021034

zbMATH Keywords

simulated annealinglocal searchmetaheuristicant colony algorithmopen capacitated arc routing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Recommendations

• Hybrid genetic algorithm for the open capacitated arc routing problem
• The open capacitated arc routing problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• A deterministic tabu search algorithm for the capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem

Cited in

(4)

• An artificial bee colony approach for the undirected capacitated arc routing problem with profits
• Hybrid genetic algorithm for the open capacitated arc routing problem
• The open capacitated arc routing problem
• Exploring roadside management optimisation opportunities: a systematic review on arc routing problems applications and modelling

This page was built for publication: Open capacitated ARC routing problem by hybridized ant colony algorithm

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