A genetic algorithm for the orienteering problem

被引：0
|
作者：
Tasgetiren, MF [1 ]
Smith, AE [1 ]
机构：
[1] Auburn Univ, Dept Ind & Syst Engn, Auburn, AL 36849 USA
来源：
PROCEEDINGS OF THE 2000 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2000年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper presents a genetic algorithm to solve the orienteering problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are specified, so as to maximize the total score collected subject to a prescribed time constraint. Employing three sets of test problems from the literature, the performance of the genetic algorithm is evaluated against problem specific heuristics and an artificial neural network.
引用
收藏
页码：910 / 915
页数：6
相关论文
共 50 条
  • [1] A Genetic Algorithm for the Thief Orienteering Problem
    Faeda, Leonardo M.
    Santos, Andre G.
    [J]. 2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [2] Genetic Algorithm Solving Orienteering Problem in Large Networks
    Karbowska-Chilinska, Joanna
    Koszelew, Jolanta
    Ostrowski, Krzysztof
    Zabielski, Pawel
    [J]. ADVANCES IN KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, 2012, 243 : 28 - 38
  • [3] Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows
    Karbowska-Chilinska, Joanna
    Zabielski, Pawel
    [J]. FUNDAMENTA INFORMATICAE, 2014, 135 (04) : 419 - 431
  • [4] A Genetic Algorithm with Grouping Selection and Searching Operators for the Orienteering Problem
    Zabielski, Pawel
    Karbowska-Chilinska, Joanna
    Koszelew, Jolanta
    Ostrowski, Krzysztof
    [J]. Intelligent Information and Database Systems, Pt II, 2015, 9012 : 31 - 40
  • [5] An Efficient and Fast Approach to the Orienteering Problem using Hybrid Genetic Algorithm
    Dutta, Joydeep
    Barma, Partha Sarathi
    Chakraborty, Sheuli
    [J]. 2015 1ST INTERNATIONAL CONFERENCE ON NEXT GENERATION COMPUTING TECHNOLOGIES (NGCT), 2015, : 792 - 796
  • [6] A biased random-key genetic algorithm for the set orienteering problem
    Carrabs, Francesco
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 292 (03) : 830 - 854
  • [7] A Genetic Algorithm with Multiple Mutation which Solves Orienteering Problem in Large Networks
    Koszelew, Jolanta
    Ostrowski, Krzysztof
    [J]. COMPUTATIONAL COLLECTIVE INTELLIGENCE: TECHNOLOGIES AND APPLICATIONS, 2013, 8083 : 356 - 366
  • [8] An efficient evolutionary algorithm for the orienteering problem
    Kobeaga, Gorka
    Merino, Maria
    Lozano, Jose A.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 90 : 42 - 59
  • [9] A memetic algorithm for the team orienteering problem
    Hermann Bouly
    Duc-Cuong Dang
    Aziz Moukrim
    [J]. 4OR, 2010, 8 : 49 - 70
  • [10] A memetic algorithm for the Team Orienteering Problem
    Bouly, Hermann
    Dang, Duc-Cuong
    Moukrim, Aziz
    [J]. APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2008, 4974 : 649 - 658
12345