摘要
提出一种解决实际规模和复杂度的PDPTW问题的快速禁忌搜索算法.该算法分为构造初始解和改进解两个阶段:在第1阶段,使用插入算法来构造一个尽可能好的初始解;在第2阶段,使用禁忌搜索算法来改进得到的解.最后构造了两个实际规模和复杂度的例子,测试结果表明该算法对于求解此类PDPTW问题是有效的.
A quick taboo search algorithm is proposed to solve the pickup and delivery problem with time windows (PDPTW) with the reality scale and complexity. The approach is composed of two parts: creating the initial solution and improving the solution. In the first phase, the insert algorithm is used to create the initial solution and in the second phase, the taboo search is applied to improve the solution. Two cases with the reality scale and complexity are created to test the algorithm. The results indicate that the proposed algorithm is effective and quick to solve such PDPTW problems.
出处
《控制与决策》
EI
CSCD
北大核心
2004年第1期57-60,共4页
Control and Decision
基金
国家973重点基础研究发展基金资助项目(G19980304).
