A Hybrid Scatter Search Algorithm to Solve the Capacitated Arc Routing Problem with Refill Points

Carlos Alberto Franco Franco, Germán Andrés Mendez Giraldo, eduyn ramiro Lopéz-Santana

Resultado de la investigación: Contribución a una revistaArtículo de la conferencia

2 Citas (Scopus)

Resumen

This paper presents a hybrid scatter search algorithm to solve the capacitated arc routing problem with refill points (CARP-RP). The vehicle servicing arcs must be refilled on the spot by using a second vehicle. This problem is addressed in real-world applications in many services systems. The problem consists on simultaneously determining the vehicles routes that minimize the total cost. In the literature is proposed an integer linear programming model to solve the problem. We propose a hybrid algorithm based on Scatter Search, Simulated Annealing and Iterated Local Search. Our method is tested with instances from the literature. We found best results in the objective function for the majority instances.
Idioma originalInglés estadounidense
Páginas (desde-hasta)3-15
Número de páginas13
PublicaciónLecture Notes in Computer Science
Volumen9772
EstadoPublicada - jul 12 2016

Huella Profundice en los temas de investigación de 'A Hybrid Scatter Search Algorithm to Solve the Capacitated Arc Routing Problem with Refill Points'. En conjunto forman una huella única.

  • Citar esto