Browsing by Subject "travelling salesman problem"

Now showing 1 - 4 of 4

Access status: Open Access ,
Efektywność wielopopulacyjnego algorytmu ewolucyjnego dla zagadnień permutacyjnych
(Wydawnictwa AGH, 2011) Filipowicz, Bogusław; Chmiel, Wojciech; Dudek, Maciej; Kadłuczka, Piotr
The objective of this study is to examine the most important traits of a multi-population genetic algorithm. These elements include: connection topology, migration size, migration interval and migrant seleetion method. A review of the existing papers on multi-population algorithms is presented. A new diversity measure that applies to permutation encoding is introduced. It has proved effective in helping to retain balance between population diversity and convergence. For each trait, several algorithm configurations have been tested. Every configuration was tested against 25 different test instances, which were derived from the TSPLib95 library. Test results showed that, among the tested parameters, the most important was topology. Of the eleven topologies, a circular (ring) topology consisting of 16 islands obtained the best results. Varying of migration interval showed little correlation with the solution quality, but it did affect the convergence time. In comparison to other parameters, migration size exerts a relatively strong influence on performance. Moreover, a medium migration size proved to be reasonable. Among migrant selection methods, random selection outperformed these methods that exert selective pressure.
Access status: Restricted ,
O zastosowaniu metrycznych grafów kwantowych w matematyce i fizyce
(Data obrony: 2013-07-17) Dudek, Dorota
Wydział Matematyki Stosowanej
Access status: Restricted ,
Optymalizacja ruchu pojazdów z wykorzystaniem funkcji analiz sieciowych
(Data obrony: 2013-07-09) Tutko, Krzysztof
Wydział Geodezji Górniczej i Inżynierii Środowiska
Access status: Open Access ,
Zastosowanie algorytmów rojowych w rozwiązywaniu zagadnień permutacyjnych
(Wydawnictwa AGH, 2011) Chmiel, Wojciech; Kadłuczka, Piotr; Packanik, Grzegorz
The objective of this paper is to examine the most important properties of a multi-population genetic algorithm. These elements include: connection topology, migration size, migration interval and a method for migrant selection. A short review of the existing papers on multi-population algorithms is presented. A new diversity measure that applies to permutation encoding is introduced. The proposed measure has proved effective in helping to retain balance between population diversity and convergence. A multi-population genetic algorithm, with different parameters like type of topology, migration interval, migration size and selection method was tested against several different test instances of traveling salesman problem, that belongs to the NP-hard permutational problem class.