Hybrid tabu search for the multi-depot vehicle routing problem

Shan-Liang Hu

doi:10.1117/12.869032

21 July 2010 Hybrid tabu search for the multi-depot vehicle routing problem

Shan-Liang Hu

Proceedings Volume 7749, 2010 International Conference on Display and Photonics; 774920 (2010) https://doi.org/10.1117/12.869032
Event: 2010 International Conference on Display and Photonics, 2010, Nanjing, China

Abstract

A hybrid tabu search for the multi-depot vehicle routing problem is considered in this paper. The purpose of the proposed approach is to decrease the number of used vehicles and the total travel cost. An extensive numerical experiment was performed on benchmark problem instances available in literature, the computational results are presented to show the high effectiveness and performance of the proposed approaches.

Citation Download Citation

Shan-Liang Hu "Hybrid tabu search for the multi-depot vehicle routing problem", Proc. SPIE 7749, 2010 International Conference on Display and Photonics, 774920 (21 July 2010); https://doi.org/10.1117/12.869032

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available