Two heuristics for the one-dimensional bin-packing problem

DOI10.1007/S00291-006-0071-2MaRDI QIDQ1018262zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• New heuristics for one-dimensional bin-packing
• A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
• Bin packing problems in one dimension: Heuristic solutions and confidence intervals
• Hybrid genetic algorithms for bin-packing and related problems
• scientific article; zbMATH DE number 3950202

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• 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
• Hybrid evolutionary algorithms for graph coloring
• Lower bounds and reduction procedures for the bin packing problem
• New heuristics for one-dimensional bin-packing
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP

Cited in

(20)

• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• scientific article; zbMATH DE number 5911854 (Why is no real title available?)
• A metaheuristic for the fixed job scheduling problem under spread time constraints
• Security-aware database migration planning
• scientific article; zbMATH DE number 2040652 (Why is no real title available?)
• Two heuristics for the label printing 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
• A hybrid evolutionary algorithm for the offline Bin Packing Problem
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
• Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
• New heuristics for one-dimensional bin-packing
• Augmented neural networks and problem structure-based heuristics for the bin-packing problem
• On a dual version of the one-dimensional bin packing problem
• scientific article; zbMATH DE number 1336411 (Why is no real title available?)
• A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem
• A short note on a simple search heuristic for the diskspacking problem
• Evolutionary Computation in Combinatorial Optimization
• Bin packing problems in one dimension: Heuristic solutions and confidence intervals

Describes a project that uses

Uses Software

• Bison

This page was built for publication: Two 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 Q1018262)