A Study of Composite Heuristic Algorithms

DOI10.2307/2582767zbMATH Open0617.90071OpenAlexW4229548318MaRDI QIDQ3754441FDOQ3754441

Authors Michael A. Langston

Publication date 1987

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2582767

zbMATH Keywords

heuristicsschedulingpackingcomposite algorithmsworst-case behaviourrouteing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• On the solving strategy in composite heuristics
• scientific article; zbMATH DE number 1054941
• Metaheuristics in combinatorial optimization
• A combined heuristic optimization technique
• Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)

Cited in

(6)

• On the solving strategy in composite heuristics
• A comparative evaluation of heuristics for container loading
• Combining Multiple Heuristics
• Online variable-sized bin packing
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• On the effectivity of gradient methods for cutting stock problems

This page was built for publication: A Study of Composite Heuristic Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754441)