For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Cooperative Search Based on Pheromone Communication for Vehicle Routing Problems
Hidenori KAWAMURA Masahito YAMAMOTO Tamotsu MITAMURA Keiji SUZUKI Azuma OHUCHI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/06/25
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from ITC-CSCC'97)
Category: Artificial Intelligence and Knowledge
multi-agent system, vehicle routing problem, traveling salesman problem, combinatorial optimization problem, local search algorithm,
Full Text: PDF>>
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.