文档介绍：摘要
随着我国市场经济的逐步完善,企业之间的竞争日益加剧,竞争手段也不断
转换,由最初的质量到目前的价格、渠道、服务向未来的供应链的竞争发展。现
代物流理论在市场竞争中的应用使得这一竞争形式成为未来企业关注的焦点。然
而在现代化的物流体系中,目前物流配送的薄弱环节正日益暴露出来并亟待解决。
如何有效地进行车辆调度,降低企业的运输成本,从而在满足顾客日益多变的需
求同时,给企业带来利润,引起了广大企业决策者和研究者的兴趣。
遗传算法是一种自适应随机搜索算法,它采用解的种群作为工作单元,模仿
生物进化的适者生存原则指导搜索并改进目标。但是由于遗传算法在搜索过程中
容易陷入局部最优,以及初始种群对算法的效果有较大的影响,所以用单纯的遗
传算法解决车辆调度问题通常不能取得较好的结果。本文基于 Sweep 算法和
Cheapest Insertion 算法的启发式算法用于构造遗传算法的初始种群,并构造一种
较好的变异算子,从而改善种群的初始化和搜索过程,得到较好的调度方案。
本文通过对带有硬时间窗的车辆调度问题进行实例计算,计算结果表明了这
种混合遗传算法解决此类问题的有效性。
综上所述,这种基于 Sweep 算法、Cheapest Insertion 算法种群初始化和 IOPT
变异算子的混合遗传算法是解决带有时间窗车辆调度问题的新方法,该算法能够
在合理的时间内求得满意解,是解决此类大规模组合优化问题的一个新途径。
关键词:车辆调度问题时间窗遗传算法启发式算法组合优化
IOPT 变异算子 Cheapest Insertion 算法 Sweep算法
I
Abstract
With the development of the market economy in our country, competition among
companies is ing more and more fierce. At the same time, the methods used by
different corporations have been changing continually. In the past, they only focused
on the quality of their products, but now petition is everywhere, from the
product price, channel of distribution to customer services. And the present
competitive strategy is developing in the direction of petition between supply
chains. This petition form will be the focus of pany with
modern logistic theory being used in the petition. However, the
ings of physical distribution in modern logistic systems are exposed
increasingly. How to solve the Vehicle Routing Problem (VRP) and how to optimize
the cost in the transportation of products, so as to satisfy the customers’ various
demands and make pany profitable, this question has appealed to many
managers and researchers.
The ic Algorithm (GA) is an adaptive heuristic search method based on
population ics. The evolutionary progress is directed by “Survival of the fittest”
principle. Because GA easily drops into a “local optimum” and the quality of its initial
population have important influence on GA’s efficiency, in general, we