|
|||||
|
|
| 考虑工作量平衡的多旅行商问题及其求解 | |
| 引用本文： | 刘伟民,李苏剑,郑爱云,赵方庚.考虑工作量平衡的多旅行商问题及其求解[J].计算机工程与应用,2010,46(15):47-50. |
| 作者姓名： | 刘伟民 李苏剑 郑爱云 赵方庚 |
| 作者单位： | 1. 北京科技大学机械工程学院,物流工程系,北京,100083;河北理工大学,机械工程学院,河北,唐山,063009 2. 北京科技大学机械工程学院,物流工程系,北京,100083 3. 河北理工大学,机械工程学院,河北,唐山,063009 4. 汽车管理学院,车管系,安徽,蚌埠,233011 |
| 摘 要： | 根据多旅行商问题（MTSP）特点，针对最小化各旅行商最长路线这一优化目标，提出改进蚁群算法（IACO）。最小化各旅行商最长路线考虑各旅行商的工作量平衡，更具实际应用意义。算法中信息素更新与限制遵循最大最小蚁群算法（MMAS）框架，为提高算法性能设计混合局域搜索算法。利用文献中标准算例进行检验，结果表明，所设计蚁群算法与三种遗传算法相比表现出较强竞争性。 |
| 关 键 词： | 蚁群算法 局域搜索算法 多旅行商问题 |
| 收稿时间： | 2008-12-2 |
| 修稿时间： | 2009-3-2 |
Multiple traveling salesmen problem with workload balance and its resolution |
|
| LIU Wei-min,LI Su-jian,ZHENG Ai-yun,ZHAO Fang-geng.Multiple traveling salesmen problem with workload balance and its resolution[J].Computer Engineering and Applications,2010,46(15):47-50. | |
| Authors: | LIU Wei-min LI Su-jian ZHENG Ai-yun ZHAO Fang-geng |
| Affiliation: | 1.Department of Logistics Engineering,School of Mechanical Engineering,University of Science and Technology Beijing,Beijing 100083,China 2.School of Mechanical Engineering,Hebei Polytechnic University,Tangshan,Hebei 063009,China 3.Department of Vehicle Management,Vehicle Management Institute,Bengbu,Anhui 233011,China |
| Abstract: | An improved ant colony optimization(IACO) algorithm for the MTSP is proposed.The optimized objective is that minimizing the maximum tour length of each salesman which related with balancing the workload among salesmen.The minmax objective has more application meaning in practice.In the algorithm,the pheromone trail updating and limits follow the MAX-MIN Ant System(MMAS) scheme,and a hybrid local search procedure is designed to improve the performance of the algorithm.The proposed algorithm is tested using s... |
| Keywords: | ant colony optimization local search Multiple Traveling Salesmen Problem（MTSP） |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 | |
| 点击此处可从《计算机工程与应用》下载全文 | |
