A New Approach for Solving the Generalized Traveling Salesman Problem

被引：0
|
作者：
Pop, P. C. [1 ]
Matei, O. [2 ]
Sabo, C. [1 ]
机构：
[1] North Univ Baia Mare, Dept Math & Comp Sci, Str Victoriei, Baia Mare 430122, Romania
[2] North Univ Baia Mare, Dept Elect Engn, Str Victoriei, Baia Mare 430122, Romania
来源：
HYBRID METAHEURISTICS | 2010年 / 6373卷
关键词：
generalized traveling salesman problem; hybrid algorithms; genetic algorithms; SPANNING TREE PROBLEM; ALGORITHM;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The generalized traveling problem (GTSP) is an extension of the classical traveling salesman problem. The GTSP is known to be an NP-hard problem and has many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem. Based on this approach we describe a novel hybrid metaheuristic algorithm for solving the problem using genetic algorithms. Computational results are reported for Euclidean TSPlib instances and compared with the existing ones. The obtained results point out that our hybrid algorithm is an appropriate method to explore the search space of this complex problem and leads to good solutions in a reasonable amount of time.
引用
收藏
页码：62 / +
页数：3
相关论文
共 50 条
  • [41] Learning to cooperate in solving the traveling salesman problem
    Qi, DH
    Sun, R
    [J]. INTERNATIONAL JOURNAL OF NEURAL SYSTEMS, 2005, 15 (1-2) : 151 - 162
  • [42] A hybrid method for solving traveling salesman problem
    Zarei, Bager
    Meybodi, M. R.
    Abbaszadeh, Mortaza
    [J]. 6TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, PROCEEDINGS, 2007, : 394 - +
  • [43] Solving the time dependent traveling salesman problem
    Li, FY
    Golden, B
    Wasil, E
    [J]. NEXT WAVE IN COMPUTING, OPTIMIZATION, AND DECISION TECHNOLOGIES, 2005, 29 : 163 - 182
  • [44] Solving the traveling salesman problem with interdiction and fortification
    Lozano, Leonardo
    Smith, J. Cole
    Kurz, Mary E.
    [J]. OPERATIONS RESEARCH LETTERS, 2017, 45 (03) : 210 - 216
  • [45] Solving the traveling salesman problem on a quantum annealer
    Richard H. Warren
    [J]. SN Applied Sciences, 2020, 2
  • [46] Evolutionary Method for Solving the Traveling Salesman Problem
    Oliinyk, Andrii
    Fedorchenko, Ievgen
    Stepaneko, Alexander
    Rud, Mykyta
    Goncharenko, Dmytro
    [J]. 2018 INTERNATIONAL SCIENTIFIC-PRACTICAL CONFERENCE: PROBLEMS OF INFOCOMMUNICATIONS SCIENCE AND TECHNOLOGY (PIC S&T), 2018, : 331 - 338
  • [47] Generalized Pyramidal Tours for the Generalized Traveling Salesman Problem
    Khachay, Michael
    Neznakhina, Katherine
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT I, 2017, 10627 : 265 - 277
  • [48] Multi-objective generalized traveling salesman problem: A decomposition approach
    Indadul Khan
    Manas Kumar Maiti
    Krishnendu Basuli
    [J]. Applied Intelligence, 2022, 52 : 11755 - 11783
  • [49] Multi-objective generalized traveling salesman problem: A decomposition approach
    Khan, Indadul
    Maiti, Manas Kumar
    Basuli, Krishnendu
    [J]. APPLIED INTELLIGENCE, 2022, 52 (10) : 11755 - 11783
  • [50] Solving Standard Traveling Salesman Problem and Multiple Traveling Salesman Problem by Using Branch-and-Bound
    Saad, Shakila
    Jaafar, Wan Nurhadani Wan
    Jamil, Siti Jasmida
    [J]. PROCEEDINGS OF THE 20TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM20): RESEARCH IN MATHEMATICAL SCIENCES: A CATALYST FOR CREATIVITY AND INNOVATION, PTS A AND B, 2013, 1522 : 1406 - 1411
12345