Cooperative search based on pheromone communication for Vehicle Routing Problems

作     者：Kawamura, H Yamamoto, M Mitamura, T Suzuki, K Ohuchi, A 

作者机构：Hokkaido Univ Grad Sch Engn Sapporo Hokkaido 0608628 Japan Asahikawa Med Coll Asahikawa Hokkaido 0788510 Japan 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (电子信息通信学会汇刊：电子学、通信及计算机科学基础)

年 卷 期：1998年第E81A卷第6期

页      面：1089-1096页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：multi-agent system Vehicle Routing Problem traveling salesman problem combinatorial optimization problem local search algorithm 

摘      要：In this paper, we propose a new cooperative search algorithm based on pheromone communication for solving the Vehicle Routing Problems. In this algorithm, multi-agents can partition the problem cooperatively and search partial solutions independently using pheromone communication, which mimics the communication method of real ants. Through some computer experiments the cooperative search of multi-agents is confirmed.