Structural analysis of local search heuristics in combinatorial optimization

DOI10.1016/0305-0548(87)90043-8zbMath0632.90056OpenAlexW2072092748MaRDI QIDQ1095797

James R. Evans

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90043-8

zbMATH Keywords

artificial intelligenceComputational resultslocal search heuristicsmean tardiness job sequencingstate-space graphs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

A tabu search experience in production scheduling, Some relations between neighbourhood graphs for a permutation problem, Improving the performance of enumerative search methods. I: Exploiting structure and intelligence, The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem, The afforestation problem: A heuristic method based on simulated annealing, Dynamics of local search trajectory in traveling salesman problem, Single machine scheduling with nonlinear cost functions, Mechanisms for local search

Cites Work

• Independent sets in regular graphs
• A graph theoretic interpretation of the sufficiency conditions for the contiguous-binary-switching (CBS)-rule
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item