Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem

DOI10.1016/J.EJOR.2010.11.004MaRDI QIDQ531429zbMATH OpenOpenAlexFDO

Authors Krzysztof Fleszar, Christoforos Charalambous

Publication date 29 April 2011

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2010.11.004

zbMATH Keywords

bin-oriented heuristicsbin-packingheuristicspackingreductions

Mathematics Subject Classification ID

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

Recommendations

• New heuristics for one-dimensional bin-packing
• Two heuristics for the one-dimensional bin-packing problem
• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Bin packing problems in one dimension: Heuristic solutions and confidence intervals

Cites work

• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• Analysis of a Compound Bin Packing Algorithm
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Computing the asymptotic worst-case of bin packing lower bounds
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• LP models for bin packing and cutting stock problems
• Modified subset sum heuristics for bin packing
• New bin packing fast lower bounds
• New classes of fast lower bounds for bin packing problems
• New heuristics for one-dimensional bin-packing
• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• Two heuristics for the one-dimensional bin-packing problem
• Worst-case analysis of the subset sum algorithm for bin packing.
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(8)

• Lower bounds and algorithms for the minimum cardinality bin covering problem
• Bin packing problem with conflicts and item fragmentation
• A hybrid evolutionary algorithm for the offline Bin Packing Problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• A grouping genetic algorithm with controlled gene transmission for the bin packing problem
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows

Describes a project that uses

Uses Software

• Bison

This page was built for publication: Average-weight-controlled bin-oriented heuristics for 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 Q531429)