Evolutionary Method for Solving the Traveling Salesman Problem

被引：0
|
作者：
Oliinyk, Andrii [1 ]
Fedorchenko, Ievgen [1 ]
Stepaneko, Alexander [1 ]
Rud, Mykyta [1 ]
Goncharenko, Dmytro [1 ]
机构：
[1] Zaporizhzhia Natl Tech Univ, Software Tools Dept, Zaporizhzhia, Ukraine
来源：
2018 INTERNATIONAL SCIENTIFIC-PRACTICAL CONFERENCE: PROBLEMS OF INFOCOMMUNICATIONS SCIENCE AND TECHNOLOGY (PIC S&T) | 2018年
关键词：
optimal way; travelling salesman problem; genetic algorithm; evolutionary algorithm; minimal distance; graph; GENETIC ALGORITHM;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
An evolutionary method for solving the traveling salesman problem in the field of pharmacy business by optimizing the work of the drug delivery device is proposed in this paper. Modifications of three methods of initialization of the initial population of the genetic algorithm are developed. The software based on the proposed evolutionary method is created. It allows changing the initial parameters of the genetic algorithm, observe the process of solving the salesman problem graphically, obtain a result in text and graphic forms.
引用
收藏
页码：331 / 338
页数：8
相关论文
共 50 条
  • [31] PROBABILISTIC ANALYSIS OF SOLVING THE ASSIGNMENT PROBLEM FOR THE TRAVELING SALESMAN PROBLEM
    PANAYIOTOPOULOS, JC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 9 (01) : 77 - 82
  • [32] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS
    CROES, GA
    OPERATIONS RESEARCH, 1958, 6 (06) : 791 - 812
  • [33] Niching Evolutionary Computation With a Priori Estimate for Solving Multi-Solution Traveling Salesman Problem
    Huang, Ting
    Gong, Yue-Jiao
    Li, Xiaoyan
    Hu, Xiao-Min
    Zhang, Jun
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [34] Evolutionary computational approaches to solving the Multiple Traveling Salesman Problem using a neighborhood attractor schema
    Sofge, D
    Schultz, A
    De Jong, K
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2002, 2279 : 153 - 162
  • [35] A New Genetic Algorithm for solving Traveling Salesman Problem
    Bai Xiaojuan
    Zhou Liang
    PROCEEDINGS OF THE 8TH WSEAS INTERNATIONAL CONFERENCE ON APPLIED COMPUTER AND APPLIED COMPUTATIONAL SCIENCE: APPLIED COMPUTER AND APPLIED COMPUTATIONAL SCIENCE, 2009, : 451 - +
  • [36] Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm
    Yousefikhoshbakht, Majid
    COMPLEXITY, 2021, 2021
  • [37] Solving the asymmetric traveling salesman problem with periodic constraints
    Paletta, G
    Triki, C
    NETWORKS, 2004, 44 (01) : 31 - 37
  • [38] An Adaptive Genetic Algorithm for Solving Traveling Salesman Problem
    Wang, Jina
    Huang, Jian
    Rao, Shuqin
    Xue, Shaoe
    Yin, Jian
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2008, 5227 : 182 - 189
  • [39] A Study of Solving Traveling Salesman Problem with Genetic Algorithm
    Sun, Chutian
    2020 9TH INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY AND MANAGEMENT (ICITM 2020), 2020, : 307 - 311
  • [40] Solving the k-best traveling salesman problem
    van der Poort, ES
    Libura, M
    Sierksma, G
    van der Veen, JAA
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) : 409 - 425
12345