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 条
  • [41] 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
  • [42] Traveling salesman problem parallelization by solving clustered subproblems
    Romanuke, Vadim
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2023, 48 (04) : 453 - 481
  • [43] The Quantum Approximate Algorithm for Solving Traveling Salesman Problem
    Ruan, Yue
    Marsh, Samuel
    Xue, Xilin
    Liu, Zhihao
    Wang, Jingbo
    CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 63 (03): : 1237 - 1247
  • [44] A New Approach for Solving the Generalized Traveling Salesman Problem
    Pop, P. C.
    Matei, O.
    Sabo, C.
    HYBRID METAHEURISTICS, 2010, 6373 : 62 - +
  • [45] An Improved Genetic Algorithm for Solving the Traveling Salesman Problem
    Chen, Peng
    2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 397 - 401
  • [46] SOLVING TRAVELING SALESMAN PROBLEM BY INTEGER LINEAR PROGRAMMING
    MARTIN, GT
    OPERATIONS RESEARCH, 1966, S 14 : B71 - &
  • [47] A new approach for solving large traveling salesman problem
    Tsai, CF
    Tsai, CW
    Tseng, CC
    CEC'02: PROCEEDINGS OF THE 2002 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2002, : 1636 - 1641
  • [48] Firefly Algorithm Solving Multiple Traveling Salesman Problem
    Li, Mingfu
    Ma, Jianhua
    Zhang, Yuyan
    Zhou, Houming
    Liu, Jingang
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1277 - 1281
  • [49] The quantum approximate algorithm for solving traveling Salesman problem
    Ruan Y.
    Marsh S.
    Xue X.
    Liu Z.
    Wang J.
    Ruan, Yue (yue_ruan@ahut.edu.cn); Wang, Jingbo (jingbo.wang@uwa.edu.au), 2020, Tech Science Press (63): : 1237 - 1247
  • [50] Solving the Traveling Salesman Problem Using the IDINFO Algorithm
    Su, Yichun
    Ran, Yunbo
    Yan, Zhao
    Zhang, Yunfei
    Yang, Xue
    ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2025, 14 (03)
12345