Genetic local search in combinatorial optimization

DOI10.1016/0166-218X(92)00180-TzbMath0794.90047MaRDI QIDQ1317048

Erwin Pesch, Antoon W. J. Kolen

Publication date: 24 March 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

traveling salesmangenetic algorithmstime constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Unrelated parallel machine scheduling using local search ⋮ Performance comparison of memetic algorithms ⋮ Evolution based learning in a job shop scheduling environment ⋮ TSP ejection chains ⋮ Metaheuristics: A bibliography ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Review of utilization of genetic algorithms in heat transfer problems ⋮ The job shop scheduling problem: Conventional and new solution techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of large-scale symmetric travelling salesman problems
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Evolution algorithms in combinatorial optimization
• How easy is local search?
• Genetic algorithms: Foundations and applications
• Tabu Search—Part I
• Tabu Search—Part II
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Genetic local search in combinatorial optimization