Fairer Comparisons for Travelling Salesman Problem Solutions Using Hash Functions

被引:0
|
作者
El Krari, Mehdi [1 ]
Guibadj, Rym Nesrine [2 ]
Woodward, John [3 ]
Robilliard, Denis [2 ]
机构
[1] Univ Nottingham, Sch Comp Sci, Computat Optimisat & Learning Lab, Nottingham, England
[2] Univ Littoral Cote dOpale, EA 4491 LISIC, Calais, France
[3] Queen Mary Univ London, Sch Elect Engn & Comp Sci, Operat Res Grp, Mile End Rd, London E1 4NS, England
来源
EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, EVOCOP 2023 | 2023年 / 13987卷
关键词
Hash functions; Combinatorial Problems; Travelling Salesman Problem; Local Search; Genetic Algorithms; Memetic Algorithms; LOCAL SEARCH;
D O I
10.1007/978-3-031-30035-6_1
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Fitness functions fail to differentiate between different solutions with the same fitness, and this lack of ability to distinguish between solutions can have a detrimental effect on the search process. We investigate, for the Travelling Salesman Problem (TSP), the impact of using a hash function to differentiate solutions during the search process. Whereas this work is not intended to improve the state-of-the-art of the TSP solvers, it nevertheless reveals a positive effect when the hash function is used.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 50 条
  • [11] New Imperialist Competitive Algorithm to solve the travelling salesman problem
    Yousefikhoshbakht, Majid
    Sedighpour, Mohammad
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (07) : 1495 - 1505
  • [12] Travelling Salesman Problem Optimization Using Genetic Algorithm
    Juneja, Sahib Singh
    Saraswat, Pavi
    Singh, Kshitij
    Sharma, Jatin
    Majumdar, Rana
    Chowdhary, Sunil
    PROCEEDINGS 2019 AMITY INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AICAI), 2019, : 264 - 268
  • [13] Solving Travelling Salesman Problem by Using Optimization Algorithms
    Saud, Suhair
    Kodaz, Halife
    Babaoglu, Ismail
    9TH INTERNATIONAL CONFERENCE ON ADVANCES IN INFORMATION TECHNOLOGY (IAIT-2017), 2018, : 17 - 32
  • [14] A tour construction heuristic for the travelling salesman problem
    Hwang, CP
    Alidaee, B
    Johnson, JD
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1999, 50 (08) : 797 - 809
  • [15] Developing a Procedure to Obtain Knowledge of Optimum Solutions in a Travelling Salesman Problem
    Haeri, Abdorrahman
    Tavakoli-Moghaddam, Reza
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, 2010, 93 : 154 - 159
  • [16] Using Data Mining to Find Patterns in Ant Colony Algorithm Solutions to the Travelling Salesman Problem
    阎世梁
    王银玲
    现代电子技术, 2007, (05) : 117 - 119
  • [17] A memetic ant colony optimization algorithm for the dynamic travelling salesman problem
    Michalis Mavrovouniotis
    Shengxiang Yang
    Soft Computing, 2011, 15 : 1405 - 1425
  • [18] Tabu search for solving the black-and-white travelling salesman problem
    Li, Haitao
    Alidaee, Bahram
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2016, 67 (08) : 1061 - 1079
  • [19] Genetic Algorithm for the Travelling Salesman Problem Using New Crossover and Mutation Operators
    Jana, Nandadulal
    Rameshbabu, T. K.
    Kar, Samarjit
    PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2010, 9 : 302 - 308
  • [20] Fuzzy Number with Nonlinear Membership Functions to Provide Flexibility in a Multi Objective Travelling Salesman Problem
    Tiwari, Atul Kumar
    Samuel, Cherian
    Singh, Vinay Pratap
    Saraswati, Vivek
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, 2013, 174 : 1011 - 1019