A comparative study to evolutionary algorithms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F14%3AA1501BBE" target="_blank" >RIV/61988987:17310/14:A1501BBE - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
A comparative study to evolutionary algorithms
Original language description
Evolutionary algorithms are general iterative algorithms for combinatorial optimization. The term evolutionary algorithm is used to refer to any probabilistic algorithm whose design is inspired by evolutionary mechanisms found in biological species. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. In this paper we perform a comparative study among Genetic Algorithms (GA), Simulated Annealing (SA), Differential Evolution (DE), and Self Organising Migrating Algorithms (SOMA). These algorithms have many similarities, but they also possess distinctive features, mainly in their strategies for searching the solution state space. The four heuristics are applied on the sameoptimization problem - Travelling Salesman Problem (TSP) and compared with respect to (1) quality of the best solution identi?ed by each heuristic, (2) progress of the search from an initial solution until stopping criteria are met.
Czech name
—
Czech description
—

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
PROCEEDINGS 28th European Conference on Modelling and Simulation ECMS 2014
ISBN
978-0-9564944-8-1
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
340-345
Publisher name
European Council for Modelling and Simulation
Place of publication
Sbr.-Dudweiler, Germany
Event location
Brescia, Italy
Event date
May 27, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)