Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem | Zendy

Pablo Cabrera-Guerrero | Zendy; Andrés Moltedo-Perfetti | Zendy; Enrique Cabrera | Zendy; Fernando Paredes | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem

Author(s) -

Pablo Cabrera-Guerrero,

Andrés Moltedo-Perfetti,

Enrique Cabrera,

Fernando Paredes

Publication year - 2016

Publication title -

studies in informatics and control

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.321

H-Index - 22

eISSN - 1841-429X

pISSN - 1220-1766

DOI - 10.24846/v25i4y201602

Subject(s) - computer science , heuristic , incremental heuristic search , local search (optimization) , routing (electronic design automation) , algorithm , null move heuristic , search algorithm , mathematical optimization , artificial intelligence , beam search , mathematics , computer network

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research