摘要
考虑了带可选时间窗约束的车辆调度问题(简称VRPATW),对现有的单时间窗约束的车辆调度模型进行了拓展,建立了VRPATW的数学模型,并进一步构造改进的禁忌搜索算法用于问题求解,算法首先用改进的PFIH算法提供较好的初始解,然后利用禁忌搜索对初始解进行改进,最后通过实验结果,说明该算法能够有效的解决100个用户的VRPATW问题。
The Vehicle Routing Problem with Alternative Time Windows （VRPATW） was studied. Based on the model of VRP with single time window constraint, a model of VRPATW was built, and an improved Tabu Search algorithm was introduced. The algorithm first generates a good feasible initial solution, using improved PFIH algorithm, then improves the initial solution using Tabu Search. Finally the experiment results show that the algorithm can solve 100 customers VRPATW efficiently.
出处
《系统仿真学报》
EI
CAS
CSCD
北大核心
2008年第16期4454-4457,共4页
Journal of System Simulation
基金
国家自然科学基金(70471046)
国家自然科学基金重大研究计划项目(90718037).
