A Multiple Vehicles Routing Problem Algorithm with Stochastic Demand

Author

Jianhua Fan ; Xiufeng Wang ; Hongyun Ning

Author_Institution

Sch. of Inf. Technol. & Sci., Nankai Univ., Tianjin

Volume

1

fYear

0

fDate

0-0 0

Firstpage

1688

Lastpage

1692

Abstract

A heuristic algorithm for multiple vehicles routing problem with stochastic demand is proposed and the goal is to minimize the total traveling cost. Two-phase method is adopted to deal with this problem. In the first phase, an algorithm is proposed to partition customers into clusters, and the main task of the second phase is to design an effective routing through each cluster of customers to minimize the total expected traveling cost. Both the a priori strategy and the reoptimization strategy are used to obtain the optimal routing. The experiment results indicate that this method can produce solutions of good quality and is an effective algorithm for the multiple vehicles routing problem with stochastic demand

Keywords

optimisation; stochastic processes; transportation; vehicles; a priori strategy; heuristic algorithm; multiple vehicles routing; optimal routing; reoptimization strategy; stochastic demand; traveling cost; Clustering algorithms; Computer science; Costs; Councils; Information technology; Partitioning algorithms; Routing; Stochastic processes; Vehicle driving; Vehicle safety; VRPSD; multiple vehicles routing; reoptimization; stochastic vehicle routing problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on

Conference_Location

Dalian

Print_ISBN

1-4244-0332-4

Type

conf

DOI

10.1109/WCICA.2006.1712640

Filename

1712640