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

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 282-283)

Pages:

375-378

Citation:

Online since:

July 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] N. Secomandi: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers & Operations Research, Vol. 27 (2000), pp.1201-1225.

DOI: 10.1016/s0305-0548(99)00146-x

Google Scholar

[2] C. Novoa and R. Storer: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research, Vol. 196 (2009), pp.509-515.

DOI: 10.1016/j.ejor.2008.03.023

Google Scholar

[3] D.J. Bertsimas: A vehicle routing problem with stochastic demand. Operations Research, Vol. 40 (1992), pp.574-585.

DOI: 10.1287/opre.40.3.574

Google Scholar

[4] M. Savelsbergh and M. Goetschalckx: A comparison of the efficiency of fixed versus variable vehicle routes. Journal of Business Logistics, Vol. 16(1995), pp.163-188.

Google Scholar

[5] L. Bianchi, M. Birattari, M. Chiarandini, M. Manfrin, M. Mastrolilli, L. Paquete, O. Rossi-Doria and T. Schiavinotto: Metaheuristics for the vehicle routing problem with stochastic demands. Parallel problem solving from nature PPSN VIII. Lecture Notes in Computer Science. Springer, Berlin, Germany. 2004, pp.1-10.

DOI: 10.1007/978-3-540-30217-9_46

Google Scholar

[6] J. Skorin-Kapov: Tabu search applied to the quadratic assignment problem. ORSA Journal of Computing, Vol. 2(1990), pp.33-45.

DOI: 10.1287/ijoc.2.1.33

Google Scholar

[7] J. Jozefowska, G. Waligora and J. Weglarz: Tabu list management methods for a discrete–continuous scheduling problem. European Journal of Operational Research, Vol. 137 (2002), pp.288-302.

DOI: 10.1016/s0377-2217(01)00210-7

Google Scholar

[8] M. Mika, G. Waligora and J. WeRglarz: Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. European Journal of Operational Research, Vol. 164 (2005).

DOI: 10.1016/j.ejor.2003.10.053

Google Scholar

[9] G. Waligora: Discrete–continuous project scheduling with discounted cash flows-A tabu search approach. Computers & Operations Research, Vol. 35(2008), pp.2141-2153.

DOI: 10.1016/j.cor.2006.09.022

Google Scholar

[10] E.B. Cao, M.Y. Lai: A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands. Journal of Computational and Applied Mathematics, Vol. 231 (2009), pp.302-310.

DOI: 10.1016/j.cam.2009.02.015

Google Scholar