A Genetic Algorithm Based Solution of Hungarian Team Orienteering Competitions

被引：0
|
作者：
Pozna, Anna I. [1 ]
机构：
[1] Univ Pannonia, Dept Elect Engn & Informat Syst, Veszprem, Hungary
来源：
2022 IEEE 22ND INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND INFORMATICS AND 8TH IEEE INTERNATIONAL CONFERENCE ON RECENT ACHIEVEMENTS IN MECHATRONICS, AUTOMATION, COMPUTER SCIENCE AND ROBOTICS (CINTI-MACRO) | 2022年
关键词：
genetic algorithm; team orienteering; optimization; NP-hard;
D O I：
10.1109/CINTI-MACRo57952.2022.10029648
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, a special team orienteering problem is presented where a set of control points should be distributed among the members of the team while a course with fixed order of controls is need to be completed too. The aim of the team is to minimize the maximum route length of the members. In this paper, a simple genetic algorithm is proposed to solve this special team orienteering problem. The performance of the algorithm is evaluated on real competition examples and the results are compared to the solutions given by the real winners of the race.
引用
收藏
页码：399 / 404
页数：6
相关论文
共 50 条
  • [31] A Discrete Artificial Bee Colony Algorithm for the Team Orienteering Problem with Time Windows
    Karabulut, Korhan
    Tasgetiren, M. Fatih
    PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN PRODUCTION AND LOGISTICS SYSTEMS (CIPLS), 2013, : 99 - 106
  • [32] Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows
    Karbowska-Chilinska, Joanna
    Zabielski, Pawel
    FUNDAMENTA INFORMATICAE, 2014, 135 (04) : 419 - 431
  • [33] A SIMHEURISTIC-LEARNHEURISTIC ALGORITHM FOR THE STOCHASTIC TEAM ORIENTEERING PROBLEM WITH DYNAMIC REWARDS
    Bayliss, Christopher
    Copado-Mendez, Pedro J.
    Panadero, Javier
    Juan, Angel A.
    Martins, Leandro do C.
    2020 WINTER SIMULATION CONFERENCE (WSC), 2020, : 1254 - 1264
  • [34] Memetic Algorithm with an Efficient Split Procedure for the Team Orienteering Problem with Time Windows
    Guibadj, Rym Nesrine
    Moukrim, Aziz
    ARTIFICIAL EVOLUTION, EA 2013, 2014, 8752 : 183 - 194
  • [35] Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
    Labadie, Nacima
    Melechovsky, Jan
    Calvo, Roberto Wolfler
    JOURNAL OF HEURISTICS, 2011, 17 (06) : 729 - 753
  • [36] An artificial bee colony algorithm approach for the team orienteering problem with time windows
    Cura, Tunchan
    COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 74 : 270 - 290
  • [37] A Hybrid Variation Harmony Search Algorithm for the Team Orienteering Problem with Capacity Limitations
    Tsakirakis, Eleftherios
    Marinaki, Magdalene
    Marinakis, Yannis
    LEARNING AND INTELLIGENT OPTIMIZATION, LION, 2020, 11968 : 146 - 156
  • [38] A Genetic Algorithm with Grouping Selection and Searching Operators for the Orienteering Problem
    Zabielski, Pawel
    Karbowska-Chilinska, Joanna
    Koszelew, Jolanta
    Ostrowski, Krzysztof
    Intelligent Information and Database Systems, Pt II, 2015, 9012 : 31 - 40
  • [39] Automatic Synthesis of Dynamic Systems Based on Hungarian Algorithm and Genetic Programming
    Yang Guanci
    Li Shaobo
    Zhong Yong
    Pan Weijie
    MATERIALS, MECHATRONICS AND AUTOMATION, PTS 1-3, 2011, 467-469 : 160 - +
  • [40] Team orienteering with possible multiple visits: Mathematical model and solution algorithms1
    Jung, Hyun-Bum
    Kim, Hyeon-Il
    Lee, Dong-Ho
    COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 190
12345