| 一种改进的车辆调度问题的遗传算法 |
| |
| 引用本文： | 侯亚林,张秀全,张振坤.一种改进的车辆调度问题的遗传算法[J].河南大学学报(自然科学版),2009,39(2). |
| |
| 作者姓名： | 侯亚林 张秀全 张振坤 |
| |
| 作者单位： | 黄淮学院,数学系,河南,驻马店,463000 |
| |
| 基金项目： | 河南省科学发展计划基础与前沿技术研究项目 |
| |
| 摘 要： | 车辆调度问题是一个NP-难问题,不存在多项式时间算法.针对这个问题本文使用集合分划的方法把较为复杂的车辆调度问题分解为相对简单的多旅行商问题,提出求解该模型的两阶段法并且运用新的编码和解码方式;另一方面,结合遗传算法对一些测试数据进行仿真试验,并得出了理想的结果.
|
| 关 键 词： | 车辆调度 集合分划 旅行商问题 遗传算法 |
An Improved Genetic Algorithm for the Vehicle Scheduling Problem |
| |
| HOU Ya-lin,ZHANG Xiu-quan,ZHANG Zhen-kun.An Improved Genetic Algorithm for the Vehicle Scheduling Problem[J].Journal of Henan University(Natural Science),2009,39(2). |
| |
| Authors: | HOU Ya-lin ZHANG Xiu-quan ZHANG Zhen-kun |
| |
| Institution: | The Departpent of Mathematics of Huanghuai University;Henan Zhumadian 463000;China |
| |
| Abstract: | The vehicle scheduling problem is a NP-hard problem without polynomial time algorithm. This paper decomposes the problem into the relatively simple traveling salesman problems by using set partition and applies a two-stage method and new coding and decoding to solve the mathematics model. On the other hand,the simulant test for some test data is carried out by using genetic algorithm,and some ideal results are obtained. |
| |
| Keywords: | vehicle scheduling set partition traveling salesman problem genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
