A Unifying Survey of Agent-Based Approaches for Equality-Generalized Traveling Salesman Problem

Article type: Research Article

Authors: Pintea, Camelia-M.

Affiliations: Technical University Cluj Napoca, Faculty of Sciences, 76 Victoriei, 430122 Baia-Mare, Romania, e-mail: dr.camelia.pintea@ieee.org

Abstract: The Generalized Traveling Salesman Problem is one of a well known complex combinatorial optimization problems. Equality-Generalized Traveling Salesman Problem is a particular case of it. The main objective of the problem it is to find a minimum cost tour passing through exactly one node from each cluster of a large-scale undirected graph. Multi-agent approaches are successfully used nowadays for solving real life complex problems. The aim of the current paper is to illustrate some agent-based algorithms, including particular ant-based models and virtual robots-agents with specific properties for solving Equality-Generalized Traveling Salesman Problem.

Keywords: combinatorial optimization, multi-agent system, pattern recognition, ant colony optimization, complex systems

Journal: Informatica, vol. 26, no. 3, pp. 509-522, 2015