| 危险品关联运输调度问题的优化设计 |
| |
| 引用本文： | 向周,蔡延光,汤雅连.危险品关联运输调度问题的优化设计[J].东莞理工学院学报,2014(1):51-56. |
| |
| 作者姓名： | 向周 蔡延光 汤雅连 |
| |
| 作者单位： | 广东工业大学自动化学院,广州510006 |
| |
| 摘 要： | 针对带硬时间窗的关联运输调度问题(Incident Vehicle Routing Problem with Hard Time Windows,IVRPHTW),联系实际应用中危险品的车辆路径问题,介绍了混沌遗传算法的基本原理,并对其进行改进,自适应地调整交叉概率和变异概率,引进了模拟退火机制,并用改进的算法来对IVRPHTW求解,然后与遗传算法求解此模型的结果相比较。实例证明该算法求解危险品的关联运输调度问题是可行的,且优于传统的遗传算法。
|
| 关 键 词： | 硬时间窗 关联运输调度问题 危险品 混沌遗传算法 模拟退火机制 |
Optimal Design of Incident Vehicle Routing Problem for Dangerous Goods |
| |
| XIANG Zhou,CAI Yan-guang,TANG Ya-lian.Optimal Design of Incident Vehicle Routing Problem for Dangerous Goods[J].Journal of Dongguan Institute of Technology,2014(1):51-56. |
| |
| Authors: | XIANG Zhou CAI Yan-guang TANG Ya-lian |
| |
| Institution: | ( School of Automation, Guangdong University of Technology, Guangzhou 510006, China) |
| |
| Abstract: | Aiming at IVRPHTW （Incident Vehicle Routing Problem with Hard Time Windows ） and VRP（Vehicle Routing Problem） of dangerous goods in practical application , this paper introduces and modifies the fundamental principle of CGA （ Chaos Genetic Algorithm ） adjusting adaptively crossover probability and mutation probability , bringing simulated annealing mechanism in the algorithm, and applying cluster analysis and the modified algorithm to solve IVRPHTW , as well as compared with Genetic Algo-rithm （ GA） .The results show that CGA is feasible to solve IVRP of dangerous goods , and better than GA during the optimization process. |
| |
| Keywords: | hard time windows IVRP hazardous material Chaos Genetic Algorithm simulated annealing mechanism |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
