A Hybrid Method for Solving Traveling Salesman Problem

A Hybrid Method for Solving Traveling Salesman Problem

One of the important problems in graphs theory is TSP. Both learning automata and genetic algorithms are search tools which are used for solving many NP-complete problems. In this paper a hybrid algorithm is proposed to solve TSP. This algorithm uses both GA and LA simultaneously to search in state...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zarei, B., Meybodi, M., Abbaszadeh, M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Airplanes
Costs
Genetic algorithms
Graph theory
Learning automata
Power cables
Probability
State-space methods
Traveling salesman problems
Vehicles
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:One of the important problems in graphs theory is TSP. Both learning automata and genetic algorithms are search tools which are used for solving many NP-complete problems. In this paper a hybrid algorithm is proposed to solve TSP. This algorithm uses both GA and LA simultaneously to search in state space. It has been shown that the speed of reaching to answer increases remarkably using LA and GA simultaneously in search process, and it also prevents algorithm from being trapped in local minimums. Experimental results show the superiority of hybrid algorithm over LA and GA.
DOI:10.1109/ICIS.2007.24