| 求解1-PDTSP问题的改进蚁群系统 |
| |
| 引用本文： | 付慧琳,牟廉明,戴锡笠,杨勤,王倩.求解1-PDTSP问题的改进蚁群系统[J].内江师范学院学报,2013(12):8-11. |
| |
| 作者姓名： | 付慧琳 牟廉明 戴锡笠 杨勤 王倩 |
| |
| 作者单位： | 内江师范学院数学与信息科学学院,内江641199 |
| |
| 基金项目： | 四川教育厅自然科学重点项目基金（13ZA0008）;内江师范学院自然科学重点项目基金（12NJZ03）;大学生创新性实验计划项目（X201205）;内江师范学院大学生科研项目（12NSD-37） |
| |
| 摘 要： | 提出了一种解决同类商品集送一体化旅行商问题（1-PDTSP）的改进蚁群系统.首先,根据1-PDTSP问题的特点,对蚁群系统中的信息素初始化和更新规则进行了改进,并采用“最优替换原则”解决停止现象;然后,设计了有载重约束的变量邻域搜索算法,以提高解的质量和加快收敛速度;最后,通过实例验证该算法在求解1-PDTSP问题时的求解质量和稳定性.结果表明：该算法求解质量高,稳定性好.
|
| 关 键 词： | 同类商品集送一体化 旅行商问题 蚁群系统 变量邻域搜索算法 |
An Improved Ant Colony System for Solving1-PDTSP |
| |
| FU Hui-Lin MOU lian-Ming DAI Xi-Li YANG Qin,WANG Qian.An Improved Ant Colony System for Solving1-PDTSP[J].Journal of Neijiang Teachers College,2013(12):8-11. |
| |
| Authors: | FU Hui-Lin MOU lian-Ming DAI Xi-Li YANG Qin WANG Qian |
| |
| Institution: | (College of Mathematics and Information Science, Neijiang Normal University, Neijiang 641199, China) |
| |
| Abstract: | An improved ant colony system optimization algorithm is proposed to solve One-Commodity Pickup-and- Delivery Traveling Salesman Problem. Firstly, the initializing method and updating rules of pheromone in ACS are improved according to the characteristic of 1-PDTSP; next, the stop phenomenon is solved by adopting the principle of ＂current optimal replacement＂; straight after, to improve the solution quality and accelerate the convergence speed of algorithm, a variable neighborhood search algorithm with the capacity constraint is designed. And eventually, the experimental results indicate the improved ant colony system boasts its high precision and nice stability in solving 1-PDTSP. |
| |
| Keywords: | 1-PDTSP TSP Ant Colony System variable neighborhood search algorithm |
| 本文献已被 维普 等数据库收录！ |
|
