Hibridinis genetinis algoritmas komivojažieriaus uždaviniui

Hibridinis genetinis algoritmas komivojažieriaus uždaviniui

In this work, the Traveling Salesman Problem (TSP) is discussed. The Hybrid Genetic Algorithm for solving the TSP is presented. The traveling salesman problem is formulated as follows: given matrix D=(dij)nxn of distances between n objects and the set P of permutations of the integers from 1 to n, f...

Full description

Bibliographic Details
Main Author: Katkus, Kęstutis
Other Authors: Plėštys, Rimantas
Format: Dissertation
Language:Lithuanian
Published: Lithuanian Academic Libraries Network (LABT) 2006
Subjects:
Informatics
Genetinis algoritmas
Alternating-positions crossover
Edge-NN
Partialy mapped crossover
Edge recombination crossover
TSP
Komivojažieriaus uždavinys
Cycle crossover
Position based crossover
Online Access:http://vddb.library.lt/fedora/get/LT-eLABa-0001:E.02~2006~D_20060606_203011-23232/DS.005.0.02.ETD

Internet

http://vddb.library.lt/fedora/get/LT-eLABa-0001:E.02~2006~D_20060606_203011-23232/DS.005.0.02.ETD

Similar Items