摘要
基于现代物流业的现实状况和实际需求,研究了一个带有里程和软时间窗约束的开放式多车场集送货一体化车辆路径问题。给出一个遗传算法对该问题进行求解。在该算法中,为了提高其性能,并全面考虑所有约束,论文采取如下措施:(1)在初始种群形成之前,将各个任务的送货点按时间窗进行排序;(2)在所有任务的一个序列中用里程约束来控制车场的插入,并对软时间窗约束采取加入惩罚的方式解决。最后论文举例对该遗传算法进行说明,并对进一步的研究工作进行了展望。
Based on the reality and the actual needs of modern logistics, this paper studies an open multi-depot pickup and delivery problem with delivery distance and soft time windows limits. A genetic algorithm is given to solve the problem. In this genetic algorithm, in order to improve its performance and take all the constraints of the problem into account, this paper adopts the strategies as following. （1） The delivery points of each task are sequenced according to their time windows before the initial population is formed. （2） The distribution of depot is controlled by delivery distance limits in a sequence of all the tasks, and the constraint of soft time windows is solved by adding penalties to violation of it. Finally, the paper gives an example to illustrate the genetic algorithm, and look forward to the prospects of the future research.
出处
《物流科技》
2012年第12期28-31,共4页
Logistics Sci-Tech
基金
辽宁省教育厅项目
项目编号:L2010515
关键词
集送货一体化车辆路径问题
遗传算法
软时间窗
oickuo and delivery vehicle routing problem
genetic algorithm
soft time window
