Variable neighbourhood search for the variable sized bin packing problem

DOI10.1016/J.COR.2011.07.003MaRDI QIDQ1762087zbMATH OpenOpenAlexFDO

Authors V. Schmid, Christian Blum, V. C. Hemmelmayr

Publication date 15 November 2012

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

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

zbMATH Keywords

hybrid algorithmsvariable neighbourhood searchvariable sized bin packing

Mathematics Subject Classification ID

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

Recommendations

• Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
• Heuristics for the variable sized bin-packing problem
• Relaxations and exact solution of the variable sized bin packing problem
• Efficient algorithms for real-life instances of the variable size bin packing problem
• A variable neighborhood descent approach for the two-dimensional bin packing problem

Cites work

• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Accelerating column generation for variable sized bin-packing problems
• Algorithms for packing and scheduling problems. (Abstract of thesis)
• Algorithms for the variable sized bin packing problem
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
• Heuristics for the variable sized bin-packing problem
• Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings
• Relaxations and exact solution of the variable sized bin packing problem
• Solving the variable size bin packing problem with discretized formulations
• Variable Sized Bin Packing
• Variable neighborhood search
• Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms

Cited in

(16)

• Solving the variable size bin packing problem with discretized formulations
• Efficient algorithms for real-life instances of the variable size bin packing problem
• A generalized bin packing problem for parcel delivery in last-mile logistics
• A hybrid algorithm based on variable neighbourhood for the strip packing problem
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers
• Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
• Heuristics for the variable sized bin-packing problem
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• Relaxations and exact solution of the variable sized bin packing problem
• scientific article; zbMATH DE number 6129400 (Why is no real title available?)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem
• A variable neighborhood descent approach for the two-dimensional bin packing problem
• A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts

This page was built for publication: Variable neighbourhood search for the variable sized bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762087)