Heuristics for determining the number of warehouses for storing non-compatible products

DOI10.1111/j.1475-3995.2005.00523.xzbMath1202.90005OpenAlexW2001973270MaRDI QIDQ3410327

John M. Wilson, Chuda Basnet

Publication date: 27 November 2006

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2005.00523.x

zbMATH Keywords

graph colouringheuristic algorithmbin packingwarehouse management

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (13)

A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses ⋮ Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Efficient algorithms for the offline variable sized bin-packing problem ⋮ A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts ⋮ An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ Bin packing problem with conflicts and item fragmentation ⋮ On the benchmark instances for the bin packing problem with conflicts ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints

Cites Work

• Exact solution of bin-packing problems using column generation and branch-and-bound
• Local search algorithms for the bin packing problem and their relationships to various construction heuristics
• A variable neighborhood search for graph coloring.
• Heuristics and lower bounds for the bin packing problem with conflicts
• Ant colony optimization and local search for bin packing and cutting stock problems
• New heuristics for one-dimensional bin-packing

This page was built for publication: Heuristics for determining the number of warehouses for storing non-compatible products