| 全局搜索聚类的多车场多车型调度算法研究 |
| |
| 引用本文： | 郑丽英,贾海鹏.全局搜索聚类的多车场多车型调度算法研究[J].兰州铁道学院学报,2009,28(6):19-22,25. |
| |
| 作者姓名： | 郑丽英 贾海鹏 |
| |
| 作者单位： | [1]兰州交通大学电子与信息工程学院,甘肃兰州730070 [2]中国人民解放军防空兵指挥学院,河南郑州450052 |
| |
| 基金项目： | 甘肃省自然科学基金，甘肃省教育厅研究生导师科研计划项目 |
| |
| 摘 要： | 针对物流配送中多车场多车型车辆调度问题的特征构造了一种以最短路径为代价的车辆调度的双多模型.为解决此类NP问题,本文提出了一种两阶段解决方案：第一阶段首先对全局隶属值的搜索训练找出最优隶属度,然后再利用任务相对紧急数组以K-Means算法为基础对用户进行聚类,把一个多车场多车型的车辆调度问题转化成多个单车场多车型的调度问题,大大降低了问题求解的复杂度;第二阶段对多个单车场多车型VSP问题利用遗传算法进行并行处理,为了保证染色体的多样性和尽可能地降低问题求解复杂度,提出了五类遗传交叉算子;最后对4车场32用户实例进行试验.结果表明,此算法对求解多车场多车型车辆调度问题很有效.
|
| 关 键 词： | 车辆调度 多车场多车型 K-Means聚类 遗传算法 |
An Algorithm of Multi-depots and Multi-type Vehicles Routing Based on Global Searching Clustering |
| |
| ZHENG Li-ying,JIA Hai-peng.An Algorithm of Multi-depots and Multi-type Vehicles Routing Based on Global Searching Clustering[J].Journal of Lanzhou Railway University,2009,28(6):19-22,25. |
| |
| Authors: | ZHENG Li-ying JIA Hai-peng |
| |
| Institution: | ZHENG Li-ying, JIA Hai-penge(1. School of Electronic ＆ Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China; 2. Air Defence Forces Command College of PLA, Zhengzhou 450050, China) |
| |
| Abstract: | For the vehicle routing problem of multiple vehicle fields and multiple vehicle types,a mathmatics model is presented and a two-stage solving scheme is put forward.The first stage is using K-means clustering algorithm to change double multiple problem to single one to reduce dimension of multiple vehicle fields and multiple vehicle model routing problem and reduce the complexity of problem solving.The second stage is using genetic algorithm to get the shortest routing.Furthemore,five types of interleaved genetic operators and two-step aberrance method are put forward to get the initiation population variaty. The scheme is proved to be efficient by the experiment. |
| |
| Keywords: | vehicle routing multi-depots and multi-type vehicles K-means clustering genetic algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
