A Unifying Survey of Agent-Based Approaches for Equality-Generalized Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
A Unifying Survey of Agent-Based Approaches for Equality-Generalized Traveling Salesman Problem
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. Themain 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...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملAgent-Based Evolutionary System for Traveling Salesman Problem
Evolutionary algorithms are heuristic techniques based on Darwinian model of evolutionary processes, which can be used to find approximate solutions of optimization and adaptation problems. Agent-based evolutionary algorithms are a result of merging two paradigms: evolutionary algorithms and multi-agent systems. In this paper agent-based evolutionary algorithm for solving well known Traveling S...
متن کاملThe Traveling Salesman Problem: A Survey
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملHeuristic Approaches to Solve Traveling Salesman Problem
This paper provides the survey of the heuristics solution approaches for the traveling salesman problem (TSP). TSP is easy to understand, however, it is very difficult to solve. Due to complexity involved with exact solution approaches it is hard to solve TSP within feasible time. That’s why different heuristics are generally applied to solve TSP. Heuristics to solve TSP are presented here with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica
سال: 2015
ISSN: 0868-4952,1822-8844
DOI: 10.15388/informatica.2015.61