An improved multi-agent approach for solving large traveling salesman problem

Authors:
Yu-An Tan;Xin-Hua Zhang;Li-Ning Xing;Xue-Lan Zhang;Shu-Wu Wang
Affiliations:
Department of Computer Science and Engineering, Beijing Institute, of Technology, Beijing, China;Information management college, Shandong Economic University, Jinan, P.R. China;The Department of Management, School of Information System and Management, National University of Defense Technology, Changsha, P.R. China;Department of Computer Science and Engineering, Beijing Institute, of Technology, Beijing, China;Department of Computer Science and Engineering, Beijing Institute, of Technology, Beijing, China
Venue:
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Year:
2006

Citing 17
Cited 0

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem

Neural Networks
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches

Computers and Operations Research
A greedy genetic algorithm for the quadratic assignment problem

Computers and Operations Research
An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem

Neural Processing Letters
Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research

INFORMS Journal on Computing
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Journal of Heuristics
A new hybrid heuristic approach for solving large traveling salesman problem

Information Sciences—Informatics and Computer Science: An International Journal
A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing

Neural Computation
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
A hybrid heuristic for the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An evolutionary algorithm for large traveling salesman problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Solving the traveling salesman problem with annealing-based heuristics: a computational study

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
The traveling salesman problem with few inner points

Operations Research Letters
A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traveling salesman problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-hard, and is an often-used benchmark for new optimization techniques. This paper pro- poses an improved multi-agent approach for solving large TSP. This proposed approach mainly includes three kinds of agents with different function. The first kind of agent is conformation agent and its function is generating the new solution continuously. The second kind of agent is optimization agent and its function is optimizing the current solutions group. The third kind of agent is refining agent and its function is refining the best solution from the beginning of the trial. At same time, there are many sub-agents in each kind of agent. These sub-agents accomplish the task of its superior agent cooperatively. At the end of this paper, the experimental results have shown that the proposed hybrid approach has good performance with respect to the quality of solution and the speed of computation.