首页 | 本学科首页   官方微博 | 高级检索  
     

基于遗传算法的集送一体化的车辆路径问题
引用本文:王兆赓,李建更,程世东.基于遗传算法的集送一体化的车辆路径问题[J].计算机工程与应用,2006,42(1):208-211.
作者姓名:王兆赓  李建更  程世东
作者单位:1. 北京工业大学电子信息与控制工程学院,北京,100022
2. 北京工业大学交通研究中心,北京,100022
摘    要:有时间窗的集送货一体化的车辆路径问题(VRPPDTW)是对经典的车辆路径问题(VRP)的扩展,是一类重要的组合优化问题,但是目前对该问题的研究非常有限。论文采用了新的染色体编码方法,设计了遗传算法对该问题进行求解。在求解过程中,对集送一体化、多种配送车辆类型的问题进行了有效处理,同时考虑了车辆载重量和时间窗等约束。最后的实验结果表明,该算法可以求得这类车辆路径问题的最优解或次优解。

关 键 词:车辆路径问题  集送一体化  遗传算法
文章编号:1002-8331-(2006)01-0208-04

Research on Vehicle Routing Problem with Pickup and Delivery Based on Genetic Algorithm
Wang Zhaogeng,Li Jiangeng,Cheng Shidong.Research on Vehicle Routing Problem with Pickup and Delivery Based on Genetic Algorithm[J].Computer Engineering and Applications,2006,42(1):208-211.
Authors:Wang Zhaogeng  Li Jiangeng  Cheng Shidong
Affiliation:1. School of Electronic Information and Control Engineering,Beijing University of Technology,Beijing 100022; 2. Transoortation Research Center,Beijing University of Technology,Beijing 100022
Abstract:Vehicle routing problem with pickup and delivery with time windows(VRPPDTW)as an extension for vehicle routing problem is an important problem in combinational optimization.While the research on VRPPDTW is rather scare.In this paper,while constrains of pickup and delivery,heterogeneous fleet are dealt with effectively,an improved genetic algorithm on novel decimal coding is designed.At the same time,vehicle capacity and time windows restraints are considered.The experiment result shows that this algorithm can obtain the optimal or nearly optimal solution to the VRPPDTW.
Keywords:vehicle routing problem  plckup and dellvery  genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号