Hybrid genetic algorithms for bin-packing and related problems

DOI10.1007/BF02125404zbMath0851.90098MaRDI QIDQ1919849

Colin R. Reeves

Publication date: 28 November 1996

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

zbMATH Keywords

genetic algorithmgraph partitioningheuristicbin-packingparallel-machine schedulinggeneralized assignmentproblem size reduction

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A hybrid genetic algorithm for the two-dimensional single large object placement problem ⋮ The container transshipment problem: searching representation landscapes with metaheuristic algorithms ⋮ A three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ Metaheuristics: A bibliography ⋮ Generalized hyper-heuristics for solving 2D regular and irregular packing problems ⋮ An indirect genetic algorithm for a nurse-scheduling problem ⋮ Comparison and hybridization of crossover operators for the nurse scheduling problem ⋮ Bin packing problem with conflicts and item fragmentation ⋮ Augmented neural networks and problem structure-based heuristics for the bin-packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for flowshop sequencing
• Solving the Graphical Steiner Tree Problem Using Genetic Algorithms