Fairer comparisons for travelling salesman problem solutions using hash functions
DOI10.1007/978-3-031-30035-6_1OpenAlexW4361859196MaRDI QIDQ6149082FDOQ6149082
Authors: Mehdi El Krari, Rym Nesrine Guibadj, John R. Woodward, 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
local searchgenetic algorithmscombinatorial problemshash functionstravelling salesman problemmemetic algorithms
Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
- Wilcoxon-Mann-Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules
- A Method for Solving Traveling-Salesman Problems
- Assignment Problems and the Location of Economic Activities
- Title not available (Why is that?)
- Scheduling algorithms
- Stochastic local search. Foundations and applications.
- A survey for the quadratic assignment problem
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- The Traveling-Salesman Problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hashing vectors for tabu search
- Combinatorial generation via permutation languages
- Heuristics for vehicle routing problems: sequence or set optimization?
This page was built for publication: Fairer comparisons for travelling salesman problem solutions using hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149082)
