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:
TSP
Online Access:http://vddb.library.lt/fedora/get/LT-eLABa-0001:E.02~2006~D_20060606_203011-23232/DS.005.0.02.ETD
id ndltd-LABT_ETD-oai-elaba.lt-LT-eLABa-0001-E.02~2006~D_20060606_203011-23232
record_format oai_dc
spelling ndltd-LABT_ETD-oai-elaba.lt-LT-eLABa-0001-E.02~2006~D_20060606_203011-232322013-11-16T03:58:33Z2006-06-06litInformaticsKatkus, KęstutisHibridinis genetinis algoritmas komivojažieriaus uždaviniuiHybrid Genetic Algorithm for the Traveling Salesman ProblemLithuanian Academic Libraries Network (LABT)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, find a permutation p=(p(1), p(2), ..., p(n)) P that minimizes. Many heuristic algorithms can be applied for the TSP. Recently, genetic algorithms (GAs) are among the advanced heuristic techniques for the combinatorial problems, like the TSP. genetic algorithms are based on the biological process of natural selection. The original concepts of GAs were developed in 1970s. Many simulations have demonstrated the efficiency of GAs on different optimization problems, among them, bin–packing, generalized assignment problem, graph partitioning, job–shop scheduling problem, set covering problem, vehicle routing. One of the main operators in GAs is the crossover (i.e. solution recombination). This operator plays a very important role by constructing competitive GAs. In this work, we investigate several crossover operators for the TSP, among them, CX (cycle crossover), PMX (partialy mapped crossover), POS (position based crossover), ER (edge recombination crossover), edge-NN (edge recombination crossover, nearest neighbour) and AP (alternating-positions crossover). Comparison of these crossover operators was performed. The results show high efficiency of the edge-NN, ER and PMX crossovers.Genetinis algoritmasAlternating-positions crossoverEdge-NNPartialy mapped crossoverEdge recombination crossoverTSPKomivojažieriaus uždavinysCycle crossoverPosition based crossoverMaster thesisPlėštys, RimantasMisevičius, AlfonsasBarauskas, RimantasMockus, JonasJasinevičius, RaimundasTelksnys, LaimutisPranevičius, HenrikasMaciulevičius, StasysJusas, VaciusKaunas University of TechnologyKaunas University of Technologyhttp://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060606_203011-23232LT-eLABa-0001:E.02~2006~D_20060606_203011-23232KTU-LABT20060606-203011-23232http://vddb.library.lt/fedora/get/LT-eLABa-0001:E.02~2006~D_20060606_203011-23232/DS.005.0.02.ETDUnrestrictedapplication/pdf
collection NDLTD
language Lithuanian
format Dissertation
sources NDLTD
topic Informatics
Genetinis algoritmas
Alternating-positions crossover
Edge-NN
Partialy mapped crossover
Edge recombination crossover
TSP
Komivojažieriaus uždavinys
Cycle crossover
Position based crossover
spellingShingle Informatics
Genetinis algoritmas
Alternating-positions crossover
Edge-NN
Partialy mapped crossover
Edge recombination crossover
TSP
Komivojažieriaus uždavinys
Cycle crossover
Position based crossover
Katkus, Kęstutis
Hibridinis genetinis algoritmas komivojažieriaus uždaviniui
description 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, find a permutation p=(p(1), p(2), ..., p(n)) P that minimizes. Many heuristic algorithms can be applied for the TSP. Recently, genetic algorithms (GAs) are among the advanced heuristic techniques for the combinatorial problems, like the TSP. genetic algorithms are based on the biological process of natural selection. The original concepts of GAs were developed in 1970s. Many simulations have demonstrated the efficiency of GAs on different optimization problems, among them, bin–packing, generalized assignment problem, graph partitioning, job–shop scheduling problem, set covering problem, vehicle routing. One of the main operators in GAs is the crossover (i.e. solution recombination). This operator plays a very important role by constructing competitive GAs. In this work, we investigate several crossover operators for the TSP, among them, CX (cycle crossover), PMX (partialy mapped crossover), POS (position based crossover), ER (edge recombination crossover), edge-NN (edge recombination crossover, nearest neighbour) and AP (alternating-positions crossover). Comparison of these crossover operators was performed. The results show high efficiency of the edge-NN, ER and PMX crossovers.
author2 Plėštys, Rimantas
author_facet Plėštys, Rimantas
Katkus, Kęstutis
author Katkus, Kęstutis
author_sort Katkus, Kęstutis
title Hibridinis genetinis algoritmas komivojažieriaus uždaviniui
title_short Hibridinis genetinis algoritmas komivojažieriaus uždaviniui
title_full Hibridinis genetinis algoritmas komivojažieriaus uždaviniui
title_fullStr Hibridinis genetinis algoritmas komivojažieriaus uždaviniui
title_full_unstemmed Hibridinis genetinis algoritmas komivojažieriaus uždaviniui
title_sort hibridinis genetinis algoritmas komivojažieriaus uždaviniui
publisher Lithuanian Academic Libraries Network (LABT)
publishDate 2006
url http://vddb.library.lt/fedora/get/LT-eLABa-0001:E.02~2006~D_20060606_203011-23232/DS.005.0.02.ETD
work_keys_str_mv AT katkuskestutis hibridinisgenetinisalgoritmaskomivojazieriausuzdaviniui
AT katkuskestutis hybridgeneticalgorithmforthetravelingsalesmanproblem
_version_ 1716614574621327360