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 条
  • [1] A Hybrid Heuristic Approach for Solving the Generalized Traveling Salesman Problem
    Pop, Petrica C.
    Iordache, Serban
    [J]. GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 481 - 488
  • [2] A new approach for solving large traveling salesman problem
    Tsai, CF
    Tsai, CW
    Tseng, CC
    [J]. CEC'02: PROCEEDINGS OF THE 2002 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2002, : 1636 - 1641
  • [3] AN EFFICIENT ANT COLONY SYSTEM FOR SOLVING THE NEW GENERALIZED TRAVELING SALESMAN PROBLEM
    Mou, Lianming
    [J]. 2011 IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTELLIGENCE SYSTEMS, 2011, : 407 - 412
  • [4] A new approach for solving the Traveling Salesman Problem using Neural Networks
    Siqueira, Paulo Henrique
    Scheer, Sergio
    Arns Steiner, Maria Teresinha
    [J]. CISCI 2007: 6TA CONFERENCIA IBEROAMERICANA EN SISTEMAS, CIBERNETICA E INFORMATICA, MEMORIAS, VOL III, 2007, : 36 - +
  • [5] A new hybrid heuristic approach for solving large traveling salesman problem
    Tsai, CF
    Tsai, CW
    Tseng, CC
    [J]. INFORMATION SCIENCES, 2004, 166 (1-4) : 67 - 81
  • [6] A novel memetic algorithm for solving the generalized traveling salesman problem
    Cosma, Ovidiu
    Pop, Petrica C.
    Cosma, Laura
    [J]. LOGIC JOURNAL OF THE IGPL, 2024,
  • [7] A New Approach to the Traveling Salesman Problem
    Li, Weiqi
    [J]. ACMSE 2022: PROCEEDINGS OF THE 2022 ACM SOUTHEAST CONFERENCE, 2022, : 52 - 59
  • [8] A New Genetic Algorithm for solving Traveling Salesman Problem
    Bai Xiaojuan
    Zhou Liang
    [J]. PROCEEDINGS OF THE 8TH WSEAS INTERNATIONAL CONFERENCE ON APPLIED COMPUTER AND APPLIED COMPUTATIONAL SCIENCE: APPLIED COMPUTER AND APPLIED COMPUTATIONAL SCIENCE, 2009, : 451 - +
  • [9] Solving the clustered traveling salesman problem via traveling salesman problem methods
    Lu, Yongliang
    Hao, Jin-Kao
    Wu, Qinghua
    [J]. PEERJ COMPUTER SCIENCE, 2022, 7
  • [10] An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
    Dimitrijevic, V
    Saric, Z
    [J]. INFORMATION SCIENCES, 1997, 102 (1-4) : 105 - 110
12345