A multi-metaheuristic combined ACS-TSP system

Authors:
Liang Meng;Lijuan Wang
Affiliations:
Dept. of Computer Science, Taiyuan University of Technology, Taiyuan, China;Dept. of Computer Science, Taiyuan University of Technology, Taiyuan, China
Venue:
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Year:
2011

Citing 8
Cited 0

Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
Ant algorithms for discrete optimization

Artificial Life
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
A new hybrid heuristic approach for solving large traveling salesman problem

Information Sciences—Informatics and Computer Science: An International Journal
Space-planning by ant colony optimisation

International Journal of Computer Applications in Technology
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Data mining with an ant colony optimization algorithm

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

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a Multi-MetaHeuristic combined Ant Colony System (ACS)-Travelling Salesman Problem(TSP) algorithm for solving the TSP. We introduce genetic algorithm in ACS-TSP to search solutions space for dealing with the early stagnation problem of the traveling salesman problem. Moreover, we present a new strategy of Minimum Spanning Tree (MST) coupled with Nearest Neighbor(NN) to construct a initial tour for improving TSP thus obtaining good solutions quickly. According to our simulation results, the new algorithm can provide a significantly improvement for obtaining a global optimum solution or a near global optimum solution in large TSPs.