Evolutionary algorithm and decisional DNA for multiple travelling salesman problem

In the real world, it is common to face optimization problems that have two or more objectives that must be optimized at the same time, that are typically explained in different units, and are in conflict with one another. This paper presents a hybrid structure that combines set of experience knowle...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Neurocomputing (Amsterdam) 2015-02, Vol.150, p.50-57
Hauptverfasser: Wang, Peng, Sanin, Cesar, Szczerbicki, Edward
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the real world, it is common to face optimization problems that have two or more objectives that must be optimized at the same time, that are typically explained in different units, and are in conflict with one another. This paper presents a hybrid structure that combines set of experience knowledge structures (SOEKS) and evolutionary algorithms, NSGA-II (Non-dominated Sorting Genetic Algorithm II), to solve multiple optimization problems. The proposed structure uses experience that is derived from a former decision event to improve the evolutionary algorithm’s ability to find optimal solutions rapidly and efficiently. It is embedded in a smart experience-based data analysis system (SEDAS) introduced in the paper. Experimental illustrative results of SEDAS application to solve a travelling salesman problem show that our new proposed hybrid model can find optimal or close to true Pareto-optimal solutions in a fast and efficient way.
ISSN:0925-2312
1872-8286
DOI:10.1016/j.neucom.2014.01.075