| 引用本文： |
-
殷佳林,蒋泰.具有同时送货和取货需求的车辆路径问题的蚁群禁忌混合优化算法[J].广西科学院学报,2008,24(4):279-283. [点击复制]
- YIN Jia-lin,JIANG Tai.Hybrid Optimal Algorithm of Ant Colony and Tabu Search for Vehicle Routing Problem with Simultaneous Delivery and Pick-up[J].Journal of Guangxi Academy of Sciences,2008,24(4):279-283. [点击复制]
|
|
| 摘要: |
| 在分析具有同时送货和取货需求的车辆路径问题(VRPSDP)的基础上,建立VRPSDP数学模型,提出一种新的求解VRPSDP问题的蚁群禁忌混合优化算法(ACO-TS),并通过实验验证该算法的有效性和可行性。新算法首先采用蚁群算法产生阶段最优解,然后利用禁忌搜索算法对阶段最优解进一步优化。实验表明,新算法能够高效解决VRPSDP问题,并且具有较好的优化效果。 |
| 关键词: 车辆路径 VRPSDP 蚁群算法 禁忌搜索 |
| DOI： |
| 投稿时间：2008-10-20 |
| 基金项目:国家电子信息产业发展基金项目(信部运[2006]634号)资助。 |
|
| Hybrid Optimal Algorithm of Ant Colony and Tabu Search for Vehicle Routing Problem with Simultaneous Delivery and Pick-up |
|
YIN Jia-lin, JIANG Tai
|
| (School of Computer Science and Control, Guilin University of Electronic Technology, Guilin, Guangxi, 541004, China) |
| Abstract: |
| Based on the analysis of VRPSDP,a mathematical model is built.A combinated optimization algorithm of ant colony and tabu search for solving VRPSDP is designed.First,ant colony algorithm is adopts to produce a stage solution;Second,the tabu search is used to optimize the stage optimal solution.The results show that the algorithm can solve VRPSDP efficiently and obtain preferable solution. |
| Key words: vehicle routing problem VRPSDP ant colony algorithm tabu search |
