Monday , June 18 2018

Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem

Pablo CABRERA-GUERRERO1*, Andrés MOLTEDO-PERFETTI2, Enrique CABRERA3, Fernando PAREDES4

1 Pontificia Universidad Católica de Valparaíso,
Av. Brasil 2241, Valparaíso, 2362807, Chile
pablo.cabrera@pucv.cl (* Corresponding author)
2 Escuela de Psicología, Universidad Santo Tomás,
Los Limonares 190, Viña del Mar, 2561694, Chile
andresmoltedo@santotomas.cl

3 CINFAV, Universidad de Valparaíso,
Blanco 951, Valparaíso, 2362905, Chile
enrique.cabrera@uv.cl
4 Escuela de Ingeniería Industrial, Universidad Diego Portales,
Manuel Rodríguez Sur 415, Santiago, 8370109, Chile
fernando.paredes@udp.clanjing

Abstract: Vehicle routing problems (VRP) have been widely studied in literature. Heuristics as well as exact algorithms have been applied to solve this kind of problems. In this study we approximately solve the VRP with simultaneous pickup and delivery and time windows by means of two well-known heuristics namely Tabu Search and Simulated Annealing. We compare the obtained results and then propose a restoration technique that allows both Tabu Search and Simulated Annealing to better explore the solution space. Results show that the proposed restoration technique allows both heuristic algorithms to obtain better results.

Keywords: Tabu Search, Simulated Annealing, Reverse Logistic, Restoration Techniques.

>>Full text
CITE THIS PAPER AS:
Pablo CABRERA-GUERRERO, Andrés MOLTEDO-PERFETTI, Enrique CABRERA, Fernando PAREDES, Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem, Studies in Informatics and Control, ISSN 1220-1766, vol. 25(4), pp. 411-420, 2016.

https://doi.org/10.24846/v25i4y201602