Premium
A set‐partitioning‐based exact algorithm for the vehicle routing problem
Author(s) -
Agarwal Yogesh,
Mathur Kamlesh,
Salkin Harvey M.
Publication year - 1989
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230190702
Subject(s) - vehicle routing problem , set (abstract data type) , computer science , routing (electronic design automation) , mathematical optimization , algorithm , mathematics , computer network , programming language
In this paper, we discuss a computationally viable algorithm based on a set‐partitioning for‐mulation of the Vehicle Routing Problem (VRP). Implementation strategies based on theoretical as well as empirical results are developed. Some computational results are presented. It is shown that a set‐partitioning formulation to the VRP, although well known for a long time, deserves considerable research efforts beyond those we present here.