Fairer comparisons for travelling salesman problem solutions using hash functions

DOI10.1007/978-3-031-30035-6_1OpenAlexW4361859196MaRDI QIDQ6149082

Rym Nesrine Guibadj, John R. Woodward, Mehdi El Krari, Denis Robilliard

Publication date: 12 January 2024

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30035-6_1

zbMATH Keywords

genetic algorithmslocal searchcombinatorial problemstravelling salesman problemhash functionsmemetic algorithms

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wilcoxon-Mann-Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• A survey for the quadratic assignment problem
• Heuristics for vehicle routing problems: sequence or set optimization?
• Hashing vectors for tabu search
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• Assignment Problems and the Location of Economic Activities
• TSPLIB—A Traveling Salesman Problem Library
• Combinatorial generation via permutation languages
• The Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other

This page was built for publication: Fairer comparisons for travelling salesman problem solutions using hash functions