|
|||||
|
|
| 带软时间窗物流配送车辆路径问题的并行遗传算法 | |
| 引用本文： | 刘诚,陈治亚,封全喜.带软时间窗物流配送车辆路径问题的并行遗传算法[J].系统工程,2005,23(10):7-11. |
| 作者姓名： | 刘诚 陈治亚 封全喜 |
| 作者单位： | 1. 中南大学,数学科学与计算技术学院,湖南,长沙,410075;中南大学,交通运输工程学院,湖南,长沙,410075 2. 中南大学,交通运输工程学院,湖南,长沙,410075 3. 中南大学,数学科学与计算技术学院,湖南,长沙,410075 |
| 摘 要： | 针对一般遗传算法在求解有时间窗车辆路径问题时初始种群的单一性,提出一种新的算法.该算法对不同的种群用不同的初始化方法--随机初始化法和构造初始化法,这种算法改变了过去那种种群内部的平衡.并将该算法所得结果与其他算法进行比较,表明该算法的合理性. |
| 关 键 词： | 并行遗传算法 时间窗 车辆路径问题 |
| 文章编号： | 1001-4098（2005）10-0007-05 |
| 收稿时间： | 2005-05-18 |
| 修稿时间： | 2005-05-18 |
Parallel Genetic Algorithm for Vehicle Routing Problems with Soft Time Windows of Logistic Distribution |
|
| LIU Cheng,CHEN Zhi-ya,FENG Quan-xi.Parallel Genetic Algorithm for Vehicle Routing Problems with Soft Time Windows of Logistic Distribution[J].Systems Engineering,2005,23(10):7-11. | |
| Authors: | LIU Cheng CHEN Zhi-ya FENG Quan-xi |
| Institution: | 1. School of Mathematical Science and Computation Technology,Central South University,Changsha 410075,China;2. School of Traffic and Transportation,Central South University, Changsha 410075,China |
| Abstract: | According to the oneness on the initialization of cluster in general genetic algorithms,a kind of new algorithm(parallel genetic algorithm) has been proposed.During initialization,it used two different methods on cluster i.e.randomization and construction method,so it can break the balance of inter-population thoroughly and made optimal solution evolving to high-level.In comparison with other algorithms,the parallel algorithm is an efficient method for vehicle routing problem. |
| Keywords: | Parallel Algorithm Time Windows Vehicle Routing Problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |