| 带取送货的关联运输调度问题的优化 |
| |
| 引用本文： | 黄刚,蔡延光,汤雅连.带取送货的关联运输调度问题的优化[J].东莞理工学院学报,2013(5):37-43. |
| |
| 作者姓名： | 黄刚 蔡延光 汤雅连 |
| |
| 作者单位： | 广东工业大学自动化学院,广州510006 |
| |
| 摘 要： | 针对取送货车辆路径问题，构建了带时间窗的IVRPPD的车辆路径数学模型，设计了混沌免疫克隆选择算法，介绍了基本的免疫克隆选择算法和混沌理论，并对设计步骤进行了详细介绍。最后，通过对该问题进行分析建模和数值求解，说明了该模型和算法的合理性和有效性。与基本遗传算法和非代际遗传算法相比较，混沌免疫克隆选择算法能更有效地解决带取送货的关联运输调度问题。
|
| 关 键 词： | 取送货 关联运输调度问题 混沌免疫克隆选择算法 遗传算法 非代际遗传算法 |
The Optimization of Incident Vehicle Route Problem with Pickup and Delivery |
| |
| Affiliation: | HUANG Gang CAI Yan-guang TANG Ya.lian (Faculty of Automation,Guangdong University of Technology,Guangzhou 510006, China) |
| |
| Abstract: | Aiming at Vehicle Routing Problem with pickup and delivery , this project builds a mathematical model of the Ve-hicle Routing Problem of IVRPPD , designing Chaos Immune Clonal Selection Algorithm （ CICSA ） , introducing the basic Immune Clonal Selection Algorithm , chaos theory , as well as the procedure of this algorithm .On the basis of modeling and simulating exam-ples of this problem , it shows that the programming model and algorithm are reasonable and efficient , and the Chaos Immune Clonal Selection Algorithm is promising and competitive in solving this problem , compared with the basic genetic algorithm and non genera-tion genetic algorithm . |
| |
| Keywords: | pickup and delivery incident vehicle routing problem chaos immune clonal selection algorithm genetic algorithm non generation genetic algorithm |
| 本文献已被 维普 等数据库收录！ |
|
