Vehicle Routing Problem with Time Windows and Simultaneous Pickups and Deliveries
This paper focuses on the time windows factor in vehicle routing problem with simultaneous pickups and deliveries. In vehicle routing problem with time windows and simultaneous pickups and deliveries (VRPTVVSPD),vehicles must wait and can not start service immediately if they arrive earlier ahead of the time when pickup goods are ready. Meanwhile,tardiness may cause penalty cost. We propose a mathematical model for VRPTWSPD and develop a genetic algorithm to solve it. The results for the numerical experiments validate the effectiveness of the algorithm proposed in this paper,and demonstrate the significance of introducing time windows. Moreover,we discuss the algorithm performance under varying penalty values of tardiness through sensitivity analysis.
Genetic algorithm Time windows Vehicle routing problem
Liang Chun-Hua Zhou Hong Zhao Jian
School of Economics and Management,Beihang University,Beijing,P.R.China
国际会议
北京
英文
685-689
2009-10-21（万方平台首次上网日期，不代表论文的发表时间）