1. Home
  2. LEA 2017
  3. Proceedings
  4. Modification of the initialization and crossing methods of ant and genetic algorithms for solving the transport problem in the tourism

Modification of the initialization and crossing methods of ant and genetic algorithms for solving the transport problem in the tourism

Zoriana Rybchak1 zoriana.l.rybchak [at] lpnu.ua
  1. Information Systems and Networks Department, Lviv Polytechnic National University, UKRAINE, Lviv, 5 Mytropolyt Andrei str
Abstract 

The article proposes to analyze the behavior of ant colonies, namely the search for the shortest route by means of the allocation of pheromones and the function of crossing the two solutions of the genetic algorithm, to develop a method and algorithm for the following operations: search of the optimal route, calculation of resource costs, search of the distance, route time, routes

Keywords 
ant algorithm
genetic algorithm
an initialization method
crossing method
transport problem
transport task
ant colony
hiking trails
References 

[1] Z. Rybchak. Optimization of travel routes based on modified genetic and ant algorithms/ Econtechmod. an international quarterly journal – 2017. vol. 6. no.2.,p.85–90.

[2] S. Yemelyanova. Solving transportation problems with a cluster clients using genetic algorithms // Fuzzy Systems and Computing – 2017, p. 195-199.

[3] A. Kazharov. Ant algorithms to solve transport problems// Russian Academy of Sciences. Theory and management systems– 2010, p. 32-45

[4] V. Lytvyn. Modeling of the road repair plan within the territorial community based on the modification of the Prima algorithm// V.Lytvyn, D.Ugryn, Z.Rybchak// Information Technologies and Computer Modeling – 2017, p 53-57

[5] L. Gladkov. Genetic algorithms: Tutorial // L. Gladkov, V. Kureichik, V. Kureichik //M.: Fizmat, – 2006, 320 p.