A new iterated local search algorithm using genetic crossover for the traveling salesman problem

Authors:
Kengo Katayama;Hiroyuki Narihisa
Affiliations:
Okayama University of Science;Okayama University of Science
Venue:
Proceedings of the 1999 ACM symposium on Applied computing
Year:
1999

Citing 6
Cited 8

Local optimization and the traveling salesman problem

Proceedings of the seventeenth international colloquium on Automata, languages and programming
The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem

Proceedings of the third international conference on Genetic algorithms
Improved Large-Step Markov Chain Variants for the Symmetric TSP

Journal of Heuristics
Genetic Local Search Algorithms for the Travelling Salesman Problem

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
A Modified Edge Recombination Operator for the Travelling Salesman Problem

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
New Genetic Local Search Operators for the Traveling Salesman Problem

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature

Optimal configuration of a command and control network: balancing performance and reconfiguration constraints

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Scheduling and caching strategies for correlated data in push-based information systems

ACM SIGAPP Applied Computing Review
Solving the maximum clique problem by k-opt local search

Proceedings of the 2004 ACM symposium on Applied computing
An Evolutionary ILS-Perturbation Technique

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A continuous variable neighbourhood search based on specialised EAs: application to the noiseless BBO-benchmark 2009

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
A continuous variable neighbourhood search based on specialised eas: application to the noisy BBO-benchmark 2009 testbed

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report

Computers and Operations Research
A new iterated local search algorithm for solving broadcast scheduling problems in packet radio networks

EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract