Competitive decision algorithm for the split vehicle routing problem with simultaneous pickup and delivery and time windows
FITME), 2010 International Conference(2010)
摘要
In this paper, we had a research about split vehicle routing problem with simultaneous pickup and delivery and time windows (SVRPSPDTW) and developed a interger progamming formulation of the problem. We presented a detail description for the competitive decision algorithm (CDA) to solve this problem. Then we constructed the benchmark of SVRPSPDTW problem based on Solomn's benchmark. In the end, we did the computational experiments on delphi 7.0 IDE and got Table 1. From Table 1, we find CDA has good results in solving SVRPSPDTW problem compared with greedy algorithm and two stage algorithm.
更多查看译文
关键词
road vehicles,vehicle routing,simultaneous pickup and delivery,competitive decision algorithm,integer programming,time window,integer progamming,greedy algorithm,delphi 7.0 ide,greedy algorithms,split,goods distribution,split vehicle routing,computer experiment,artificial neural networks,benchmark testing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要