Local search algorithms for the bin packing problem and their relationships to various construction heuristics
From MaRDI portal
Publication:1402503
DOI10.1023/A:1021837611236zbMath1035.90074OpenAlexW1598795752MaRDI QIDQ1402503
Publication date: 28 August 2003
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021837611236
local searchreal-world problembin packing problem with conflictsconstruction heuristicelementary bin packing problemprioritized improvement
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ The freight consolidation and containerization problem ⋮ Energy efficient spatial TDMA scheduling in wireless networks ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Heuristics for determining the number of warehouses for storing non-compatible products
This page was built for publication: Local search algorithms for the bin packing problem and their relationships to various construction heuristics
