An Effective Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands

Abstract:

Article Preview

The vehicle routing problem with stochastic demands is considered in this paper, and an effective tabu search algorithm for the proposed problem. The goal consists of minimizing the vehicle number and expected distance traveled in order to serve all customers’ demands. Finally, a numerical example is given to show the effectiveness of the algorithm.

Info:

Periodical:

Advanced Materials Research (Volumes 282-283)

Edited by:

Helen Zhang and David Jin

Pages:

375-378

DOI:

10.4028/www.scientific.net/AMR.282-283.375

Citation:

S. L. Hu and C. S. Liu, "An Effective Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands", Advanced Materials Research, Vols. 282-283, pp. 375-378, 2011

Online since:

July 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.