Solving the one-dimensional bin packing problem with a weight annealing heuristic

DOI10.1016/j.cor.2006.10.021zbMath1177.90347OpenAlexW2006271225MaRDI QIDQ2468485

Kok-Hua Loh, Edward A. Wasil, Bruce L. Golden

Publication date: 23 January 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.10.021

zbMATH Keywords

heuristicscombinatorial optimizationbin packingweight annealing

Mathematics Subject Classification ID

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

Related Items (12)

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A grouping genetic algorithm with controlled gene transmission for the bin packing problem ⋮ 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 ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ The freight consolidation and containerization problem ⋮ Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms ⋮ Bin packing problem with conflicts and item fragmentation ⋮ A hybrid evolutionary algorithm for the offline Bin Packing Problem ⋮ Augmented neural networks and problem structure-based heuristics for the bin-packing problem

Uses Software

• Bison

Cites Work

• Unnamed Item
• Unnamed Item
• Exact solution of bin-packing problems using column generation and branch-and-bound
• The noising method: A new method for combinatorial optimization
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Guided local search and its application to the traveling salesman problem
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• New classes of fast lower bounds for bin packing problems
• New heuristics for one-dimensional bin-packing

This page was built for publication: Solving the one-dimensional bin packing problem with a weight annealing heuristic