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 条

[31] Solving travelling salesman problem using black hole algorithm
Hatamlou, Abdolreza
SOFT COMPUTING, 2018, 22 (24) : 8167 - 8175
[32] Local Search Based on a Local Utopia Point for the Multiobjective Travelling Salesman Problem
Michalak, Krzysztof
INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2015, 2015, 9375 : 281 - 289
[33] Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
Basu, Sumanta
Sharma, Megha
Ghosh, Partha Sarathi
INFOR, 2017, 55 (02) : 134 - 158
[34] A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem
Eremeev, Anton, V
Kovalenko, Yulia, V
MEMETIC COMPUTING, 2020, 12 (01) : 23 - 36
[35] Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
P. Larrañaga
C.M.H. Kuijpers
R.H. Murga
I. Inza
S. Dizdarevic
Artificial Intelligence Review, 1999, 13 : 129 - 170
[36] The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem
Katayama, K
Sakamoto, H
Narihisa, H
MATHEMATICAL AND COMPUTER MODELLING, 2000, 31 (10-12) : 197 - 203
[37] The Convex-hull-and-k-line travelling salesman problem
Deineko, VG
Woeginger, GJ
INFORMATION PROCESSING LETTERS, 1996, 59 (06) : 295 - 301
[38] Genetic algorithms for the travelling salesman problem:: A review of representations and operators
Larrañaga, P
Kuijpers, CMH
Murga, RH
Inza, I
Dizdarevic, S
ARTIFICIAL INTELLIGENCE REVIEW, 1999, 13 (02) : 129 - 170
[39] SELF-ADAPTIVE GENETIC ALGORITHM AND TRAVELLING SALESMAN PROBLEM
Perzina, Radomir
16TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING MENDEL 2010, 2010, : 56 - 63
[40] Solving Travelling Salesman Problem using Discreet Social Group Optimization
Verma, Sumit
Jena, Junali Jasmine
Satapathy, Suresh Chandra
Rout, Minakhi
JOURNAL OF SCIENTIFIC & INDUSTRIAL RESEARCH, 2020, 79 (10): : 928 - 930

← 1 2 3 4 5 →