Local search algorithms for the bin packing problem and their relationships to various construction heuristics
DOI10.1023/A:1021837611236zbMATH Open1035.90074OpenAlexW1598795752MaRDI QIDQ1402503FDOQ1402503
Authors: D. Massart
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
Recommendations
- New heuristics for one-dimensional bin-packing
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- scientific article; zbMATH DE number 4112059
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
local searchreal-world problembin packing problem with conflictsconstruction heuristicelementary bin packing problemprioritized improvement
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cited In (10)
- Title not available (Why is that?)
- Locality-preserving allocations problems and coloured bin packing
- Adaptive large neighborhood search for solving the circle bin packing problem
- 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
- The freight consolidation and containerization problem
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
- Energy efficient spatial TDMA scheduling in wireless networks
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402503)