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

DOI10.1016/j.cor.2016.06.009zbMath1349.90707OpenAlexW2440164697MaRDI QIDQ342540

Michel Vasquez, Mirsad Buljubašić

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

tabu searchbin packingvector bin packingconsistent neighborhood

Mathematics Subject Classification ID

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

Related Items (10)

An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ 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 ⋮ Bin packing problem with conflicts and item fragmentation ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ Operations research in Hungary: VOCAL 2018 ⋮ A hybrid evolutionary algorithm for the offline Bin Packing Problem ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem ⋮ Using VRPSolver to efficiently solve the \textsc{differential harvest problem}

Cites Work

• Unnamed Item
• A grouping genetic algorithm with controlled gene transmission for the bin packing problem
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
• Two heuristics for the one-dimensional bin-packing problem
• Exact solution of bin-packing problems using column generation and branch-and-bound
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• 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
• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
• A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
• Consistency checking within local search applied to the frequency assignment with polarization problem
• 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

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