摘要
在约束规划基础上,结合启发式方法,提出了一个求解集送货问题的新思路,并给出了具体的带有时间窗的集送货一体化问题的算例,求出了较高质量的满意解。
A new approach integrated with heuristic method to solve the pickup and delivery vehicle scheduling problem is designed on the basis of constraint programming. The method can get a satisfied solution through analyzing an example of PDP with time windows.
出处
《物流技术》
2005年第9期110-112,共3页
Logistics Technology
基金
上海市科委基金资助(重点)项目(03JC14068)
关键词
IVSP
集送货一体化
约束规划
启发式算法
VSP （Vehicle Scheduling Problem）
pickup and delivery
constraint programming
heuristic algorithm
