A Tabu Search Heuristic for the Vehicle Routing Problem | Zendy

Michel Gendreau | Zendy; Alain Hertz | Zendy; Gilbert Laporte | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Tabu Search Heuristic for the Vehicle Routing Problem

Author(s) -

Michel Gendreau,

Alain Hertz,

Gilbert Laporte

Publication year - 1994

Publication title -

management science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 4.954

H-Index - 255

eISSN - 1526-5501

pISSN - 0025-1909

DOI - 10.1287/mnsc.40.10.1276

Subject(s) - tabu search , heuristics , mathematical optimization , benchmark (surveying) , guided local search , vehicle routing problem , heuristic , vertex (graph theory) , computer science , set (abstract data type) , routing (electronic design automation) , sequence (biology) , algorithm , mathematics , theoretical computer science , graph , computer network , geodesy , biology , genetics , programming language , geography

The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algorithm considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route and reinserting it into another route. This is done by means of a generalized insertion procedure previously developed by the authors. During the course of the algorithm, infeasible solutions are allowed. Numerical tests on a set of benchmark problems indicate that tabu search out performs the best existing heuristics, and TABUROUTE often produces the best known solutions.vehicle routing problem, tabu search, generalized insertion

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