联盟运输调度问题模型结构与算法研究

Research on Model Structure and Algorithm of Allied Vehicle Routing and Scheduling Problems

联盟运输调度问题是在基本运输调度问题基础上衍生出的最具现实意义的一类组合优化难题,是近年来物流控制优化领域的研究热点。依据运输调度问题分类方法,描述了联盟运输调度问题的结构;通过分析遗传算法、模拟退火算法、禁忌搜索算法、蚁群算法、粒子群算法的特点及其求解运输调度问题的现状,讨论了它们求解联盟运输调度问题的可能性;展望了联盟运输调度问题发展的前景,指出改进原算法、提出新算法、并行算法是解决联盟运输调度问题的重要手段。

Allied vehicle muting and scheduling problems（AVRP） are derived from vehicle muting and scheduling problems（VRP）, and they are the most realistic combinatorial optimization problems, moreover, they have been a locus of research in the logistic management recently. According to the classified method of VRP, the model structure of AVRP is described. The character and the application actualities of Genetic Algorithm, Simulated Annealing, Tabu Search, Ant Colony Algorithro, Particle Swarm Optimization are analyzed, and the possibilities to solve AVRP are discussed. Finally, the development foreground of AVRP is presented, and the viewpoint that improving original algorithms, putting forward new algorithm.s, parallel algorithms are important measures to solve AVRP is pointed out.