Two heuristics for the one-dimensional bin-packing problem

DOI10.1007/s00291-006-0071-2zbMath1168.90598OpenAlexW2022401786MaRDI QIDQ1018262

Alok Singh, Ashok Kumar Gupta

Publication date: 19 May 2009

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-006-0071-2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

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 ⋮ A metaheuristic for the fixed job scheduling problem under spread time constraints ⋮ Security-aware database migration planning ⋮ Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ 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
• Lower bounds and reduction procedures for the bin packing problem
• Exact solution of bin-packing problems using column generation and branch-and-bound
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Hybrid evolutionary algorithms for graph coloring
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• New heuristics for one-dimensional bin-packing

This page was built for publication: Two heuristics for the one-dimensional bin-packing problem