Study on Optimization of Vehicle Routing Problem Based on Sierpinski Space Filling Curves

摘要：

Vehicle Routing Problem (VRP) is one of the key issues on optimization of Modern logistics system. In this paper, a compositive mathematical model is established for VRP. Meanwhile a composite algorithm based on Sierpinski Space filling Curves (SFC) method and Or-opt algorithm is introduced. In this algorithm, Sierpinski SFC method can quickly get an initial and feasible solution, Or-opt algorithm is used to improve the initiatial solution. An experimental program was developed and a large number of experimental computations from Solomons benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the algorithm.

关键词： logistics distribution Sierpinski Space filling Curves VRP or-opt algorithm

作者: Liu Chao Yue Yixiang Yue Qunxing

作者单位: School of Traffic and Transportation Beijing Jiaotong University Beijing, China Institute of Space System Engineering (ISSE) China Academy of Space Technology (CAST) Beijing, China

会议类型: 国际会议

会议名称: 2010 International Conference on Digital Enterprise and Digital Manufacturing(2010年数字化企业与数字化制造国际会议 DEDM 2010)

会议地点: 成都

会议语种:英文

页码: 137-141

在线出版日期: 2010-12-03（万方平台首次上网日期，不代表论文的发表时间）