A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem

DOI10.1007/978-3-030-61534-5_25MaRDI QIDQ6487995zbMATH OpenFDO

Authors N. Pillay

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-61534-5_25

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Exact and approximate methods for a one-dimensional minimax bin-packing problem
• One-space bounded algorithms for two-dimensional bin packing
• Two heuristics for the one-dimensional bin-packing problem
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
• New heuristics for one-dimensional bin-packing
• On a dual version of the one-dimensional bin packing problem
• A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
• Solving the one-dimensional bin packing problem with a weight annealing heuristic

This page was built for publication: A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem

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