摘要
车辆调度问题(VSP)是一个典型的NP-hard问题,也是运筹学研究的热点问题。目前大多车辆调度问题的模型及其相应的算法与仿真都是针对单车型设计的,很少考虑多车型的情况,然而在实际的车辆调度中多车型的车辆调度问题经常会遇到,尤其在多货栈多物品的联合运输中。该文针对多车型的车辆调度问题,在文献[6]、[8]和[9]等研究成果的基础上建立了多车型的VSP模型,并根据该模型设计了相应的遗传算法,然后用Matlab实现了该算法。从仿真的结果看,得到的解是比较满意的。
The vehicle scheduling problem（VSP） is a typical NP - hard problem,and is an emphatic problem in operational research. Nowadays, many models of VSP are designed for single - type vehicle in stead of multi - type vehicle, however, VSP of multi - type vehicle is often found everywhere, especially, unit - transportation in many warehouse and many goods. This paper establishes a model of VSP of multi - type vehicle based on the productions of the literature [6], [8] and [9] etc, and designs relevant genetic algorithm by the model, and realizes the algorithm by Matlab. The solution obtained from simulation results is satisfactory.
出处
《计算机仿真》
CSCD
2006年第4期261-264,共4页
Computer Simulation
关键词
多车型
车辆调度问题
遗传算法
Multi - type vehicle
Vehicle scheduling problem（VSP）
Genetic algorithm
