Nature inspired genetic algorithms for hard packing problems

DOI10.1007/s10479-008-0464-5zbMath1201.90177OpenAlexW2036165008MaRDI QIDQ610991

Philipp Rohlfshagen, John A. Bullinaria

Publication date: 13 December 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0464-5

zbMATH Keywords

genetic algorithmsbin packing problemdecodersexon shufflingmultiple Knapsack problemrepair algorithmsRNA editing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A grouping genetic algorithm with controlled gene transmission for the bin packing problem ⋮ Performance evaluation and system optimization of Green cognitive radio networks with a multiple-sleep mode

Uses Software

• Bison

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• A fast asymptotic approximation scheme for bin packing with rejection
• An Application of Bin-Packing to Multiprocessor Scheduling
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• New heuristics for one-dimensional bin-packing