Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing

DOI10.1016/J.COR.2016.06.009MaRDI QIDQ342540zbMATH OpenOpenAlexFDO

Authors Mirsad Buljubašić, Michel Vasquez

Publication date 17 November 2016

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

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

zbMATH Keywords

bin packingtabu searchvector bin packingconsistent neighborhood

Mathematics Subject Classification ID

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

Recommendations

• A variable neighborhood descent approach for the two-dimensional bin packing problem
• New heuristics for one-dimensional bin-packing
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• A grouping genetic algorithm with controlled gene transmission for the bin packing problem
• A set-covering-based heuristic approach for bin-packing problems
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Consistency checking within local search applied to the frequency assignment with polarization problem
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing 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
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• New classes of fast lower bounds for bin packing problems
• New heuristics for one-dimensional bin-packing
• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• Two heuristics for the one-dimensional bin-packing problem

Cited in

(16)

• Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
• Operations research in Hungary: VOCAL 2018
• Stabilized branch-and-price algorithms for vector packing problems
• A hybrid evolutionary algorithm for the offline Bin Packing Problem
• A branch-and-price algorithm for the two-dimensional vector packing problem
• An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
• Tabu search with consistent neighbourhood for strip packing
• A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem
• Algorithms for the bin packing problem with scenarios
• Local search algorithms for the bin packing problem and their relationships to various construction heuristics
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
• 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
• Bin packing problem with conflicts and item fragmentation

This page was built for publication: Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing

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