×

A unifying survey of agent-based approaches for Equality-Generalized Traveling Salesman Problem. (English) Zbl 1387.90223

Summary: 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.

MSC:

90C27 Combinatorial optimization
68T10 Pattern recognition, speech recognition
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: Link