A novel memetic algorithm for solving the generalized traveling salesman problem

被引:0
|
作者
Cosma, Ovidiu [1 ]
Pop, Petrica C. [1 ]
Cosma, Laura [1 ]
机构
[1] Tech Univ Cluj Napoca, North Univ Ctr Baia Mare, Dept Math & Informat, Baia Mare 430122, Romania
关键词
Memetic algorithms; genetic algorithms; generalized traveling salesman problem; GENETIC ALGORITHM;
D O I
10.1093/jigpal/jzae019
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper investigates the Generalized Traveling Salesman Problem (GTSP), which is an extension of the well-known Traveling Salesman Problem (TSP), and it searches for an optimal tour in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Memetic Algorithm (MA) for solving efficiently the GTSP. Our proposed MA has at its core a genetic algorithm (GA), completed by a Chromosome Enhancement Procedure (CEP), which is based on a TSP solver and the Shortest Path (SP) algorithm and for improving the convergence characteristics of the GA, a Local Search (LS) operation is applied for the best chromosomes in each generation. We tested our algorithm on a set of well-known instances from the literature and the achieved results prove that our novel memetic algorithm is highly competitive against the existing solution approaches from the specialized literature.
引用
收藏
页码:576 / 588
页数:13
相关论文
共 50 条
  • [31] An effective memetic algorithm for the close-enough traveling salesman problem
    Lei, Zhenyu
    Hao, Jin-Kao
    APPLIED SOFT COMPUTING, 2024, 153
  • [32] A Niching Memetic Algorithm for Multi-Solution Traveling Salesman Problem
    Huang, Ting
    Gong, Yue-Jiao
    Kwong, Sam
    Wang, Hua
    Zhang, Jun
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (03) : 508 - 522
  • [33] 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
  • [34] 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
  • [35] 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)
  • [38] A Hybrid Heuristic Approach for Solving the Generalized Traveling Salesman Problem
    Pop, Petrica C.
    Iordache, Serban
    GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 481 - 488
  • [39] Novel genetic algorithm for traveling salesman problem
    Congwen Zeng
    Tianlong Gu
    Lingzhong Zhao
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13 : 859 - 863
  • [40] Discrete Bacterial Memetic Evolutionary Algorithm for the Time Dependent Traveling Salesman Problem
    Tuu-Szabo, Boldizsar
    Foldesi, Peter
    Koczy, Laszlo T.
    INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS: THEORY AND FOUNDATIONS, IPMU 2018, PT I, 2018, 853 : 523 - 533