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.
Tabu Search, Simulated Annealing, Reverse Logistic, Restoration Techniques.
Pablo CABRERA-GUERRERO, Andrés MOLTEDO-PERNETTI, Enrique CABRERA, Nernando 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
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).