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 original||Inglés estadounidense|
|Número de páginas||13|
|Publicación||Lecture Notes in Computer Science|
|Estado||Publicada - jul 12 2016|
Franco Franco, C. A., Mendez Giraldo, G. A., & Lopéz-Santana, E. R. (2016). A Hybrid Scatter Search Algorithm to Solve the Capacitated Arc Routing Problem with Refill Points. Lecture Notes in Computer Science, 9772, 3-15.