A Metaheuristic Approach for the Cumulative Capacitated Arc Routing Problem
Fecha
2018-09-03
Autores
relationships.isAdvisorOf
Título de la revista
ISSN de la revista
18650929
18650937
18650937
Título del volumen
Editor
Springer Verlag
item.page.isbn
Resumen
In this paper we propose a new variant of the capacitated arc routing problem (CARP). In this new problem the objective function becomes a cumulative objective computed as the traveled distance multiplied by the vehicle load. A metaheuristic approach is proposed which is based on the hybridization of three known procedures: GRASP, VND and Set covering model. The metaheuristic is tested with some benchmark instances from CARP. The results allow to evaluate the performance with the different metaheuristic components and to compare the solutions with the classical objective function. © 2018, Springer Nature Switzerland AG.