An Effective Tabu Search for the Vehicle Routing Problem with Backhauls

Abstract:

Article Preview

The vehicle routing problem with backhauls (VRPB) is considered in this paper, and an effective tabu search is proposed for VRPB to minimize the used vehicle number and total travel distance. The proposed approach is compared with the greedy randomised adaptive memory programming search published recently for the same purpose, the results show the high performance and effectiveness of our approach.

Info:

Periodical:

Advanced Materials Research (Volumes 143-144)

Edited by:

H. Wang, B.J. Zhang, X.Z. Liu, D.Z. Luo, S.B. Zhong

Pages:

1415-1419

DOI:

10.4028/www.scientific.net/AMR.143-144.1415

Citation:

C. S. Liu et al., "An Effective Tabu Search for the Vehicle Routing Problem with Backhauls", Advanced Materials Research, Vols. 143-144, pp. 1415-1419, 2011

Online since:

October 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.