An Effective Tabu Search for Vehicle Routing Problem with Pickup and Delivery Service

Abstract:

Article Preview

The vehicle routing problem with delivery and pick-up service was considered in this paper. A tabu search was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand. Performances are compared with other heuristics appeared in the literature recently by the bench-mark data sets. The computational results show that the proposed approaches produce high quality results within a reasonable computing time.

Info:

Periodical:

Advanced Materials Research (Volumes 181-182)

Edited by:

Qi Luo and Yuanzhi Wang

Pages:

760-764

DOI:

10.4028/www.scientific.net/AMR.181-182.760

Citation:

Y. Y. Li and C. S. Liu, "An Effective Tabu Search for Vehicle Routing Problem with Pickup and Delivery Service", Advanced Materials Research, Vols. 181-182, pp. 760-764, 2011

Online since:

January 2011

Export:

Price:

$35.00

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

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