摘要
讨论了多车库、多货物类型且有最大工作时间约束的复杂有时间窗装卸货问题(PDPTW)，给出了解决此类问题的插入启发式算法、对复杂条件的特殊处理方法以及提高解的质量的处理技巧。算例表明此算法能快速有效地处理复杂PDPTW问题。
A sort of complex PDPTW problem which includes multi depots, multi load type and maximal working time limitation is discussed. Insertion heuristic algorithm is proposed to solve this sort of complex PDPTW problem and some techniques are introduced to improve the quality of solution. Computational results prove the effectiveness of this insertion heuristic algorithm.
出处
《计算机工程》
CAS
CSCD
北大核心
2003年第16期65-66,144,共3页
Computer Engineering
基金
国家"973"重点基础研究发展项目(GI9980304)
关键词
有时间窗装卸货问题
插入启发式算法
车辆路径规划问题
Pickup and delivery problem with time window(PDPTW)
Insertion heuristic algorithm
Vehicle routing problem
