DocumentCode :
3366931
Title :
Research on Related Vehicle Routing Problem for Single Distribution Centre Based on Dynamic Constraint
Author :
Chen Yuqiang ; Hu Xuanzi ; Ye Guangzai
Author_Institution :
Dept. of Comput. Eng., DongGuan Polytech., Dongguan, China
fYear :
2013
fDate :
14-15 Dec. 2013
Firstpage :
76
Lastpage :
79
Abstract :
Related Vehicle Routing Problem is another form of Vehicle Routing Problem. RVRP also belongs to NP-Hard, The research based on single distribution center RVRP with road capacity dynamic constraint. Road capacity factor shows as a road condition coefficient, then added it into the objective function. To build a model of single distribution center and single vehicle type RVRP with soft time windows and dynamic constraint. The simulated result shows that the self-adapting chaos genetic algorithm is flexible and feasible to solve this kind of model.
Keywords :
computational complexity; transportation; NP-hard problem; RVRP; related vehicle routing problem; road capacity dynamic constraint; road condition coefficient; self-adapting chaos genetic algorithm; single distribution centre; Chaos; Genetic algorithms; Linear programming; Logistics; Roads; Routing; Vehicles; formatting; insert; style; styling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security (CIS), 2013 9th International Conference on
Conference_Location :
Leshan
Print_ISBN :
978-1-4799-2548-3
Type :
conf
DOI :
10.1109/CIS.2013.23
Filename :
6746359
Link To Document :
بازگشت