Comparison between Golden Ball Meta-heuristic, Evolutionary Simulated Annealing and Tabu Search for the Traveling Salesman Problem

被引：4
|
作者：
Osaba, Eneko [1 ]
Carballedo, Roberto [1 ]
Lopez-Garcia, Pedro [1 ]
Diaz, Fernando [1 ]
机构：
[1] Univ Deusto, Av Univ 24, Bilbao, Spain
来源：
PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'16 COMPANION) | 2016年
关键词：
Golden Ball; Simulated Annealing; Tabu Search; Traveling Salesman Problem; TSP; COMBINATORIAL OPTIMIZATION;
D O I：
10.1145/2908961.2931634
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The Golden Ball is a multi-population meta-heuristic based on soccer concepts. It was first designed to solve combinatorial optimization problems. Until now, it has been tested with different kind of problems, but its efficiency has only been compared with some classical algorithms, such as different kind of Genetic Algorithms and Distributed Genetic Algorithms. In this work, the performance of the Golden Ball is compared with the ones obtained by two famous and widely used techniques: an Evolutionary Simulated Annealing and a Tabu Search. These both meta heuristics are two of the most used ones along the history for solving optimization problems. In this first study, the comparison is performed for the well-known Traveling Salesman Problem.
引用
收藏
页码：1469 / 1470
页数：2
相关论文
共 33 条
  • [1] A Comparison between Heuristic and Meta-Heuristic Methods for Solving the Multiple Traveling Salesman Problem
    Sze, San Nah
    Tiong, Wei King
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 19, 2007, 19 : 300 - 303
  • [2] Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm, Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem
    Alejandro, Fuentes-Penna
    Marisa, Estrada-Carrillo
    Ivette, Flores-Jimenez
    Ruth, Flores-Jimenez
    Moreno-Gutierrez Silvia, S.
    INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2014, 5 (03): : 2 - 15
  • [3] A simulated annealing heuristic for the online symmetric traveling salesman problem
    Shirdel, G. H.
    Abdolhosseinzadeh, M.
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2018, 39 (06): : 1283 - 1296
  • [4] Tabu search heuristic using genetic diversification for the clustered traveling salesman problem
    Laporte Gilbert
    Potvin Jean-Yves
    Quilleret Florence
    Journal of Heuristics, 1997, 2 (3) : 187 - 200
  • [5] Tabu search heuristic using genetic diversification for the clustered traveling salesman problem
    Laporte, Gilbert
    Potvin, Jean-Yves
    Quilleret, Florence
    Journal of Heuristics, 2 (03): : 187 - 200
  • [6] Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
    Yu, Vincent F.
    Lin, Shih-Wei
    Jodiawan, Panca
    Lai, Yu-Chi
    MATHEMATICS, 2023, 11 (20)
  • [7] An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem
    Yousefikhoshbakht, Majid
    Dolatnejad, Azam
    BRAIN-BROAD RESEARCH IN ARTIFICIAL INTELLIGENCE AND NEUROSCIENCE, 2016, 7 (03): : 125 - 138
  • [8] Meta-learning to select the best meta-heuristic for the Traveling Salesman Problem: A comparison of meta-features
    Kanda, Jorge
    de Carvalho, Andre
    Hruschka, Eduardo
    Soares, Carlos
    Brazdil, Pavel
    NEUROCOMPUTING, 2016, 205 : 393 - 406
  • [9] Comparison of a memetic algorithm and a tabu search algorithm for the Traveling Salesman Problem
    Osaba, Eneko
    Diaz, Fernando
    2012 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2012, : 131 - 136
  • [10] A tabu search meta-heuristic approach to the dual response systems problem
    Aladag, Cagdas Hakan
    Koeksoy, Onur
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (12) : 15370 - 15376
1234