VNS matheuristic for a bin packing problem with a color constraint

DOI10.1016/j.endm.2017.03.006zbMath1388.90104OpenAlexW2606582384MaRDI QIDQ1687630

Peng Zhang

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.006

zbMATH Keywords

column generationlocal searchmatheuristiclarge neighborhood

Mathematics Subject Classification ID

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

Related Items (4)

An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ A heuristic for the problem of one-dimensional steel coil cutting ⋮ A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Covering graphs with few complete bipartite subgraphs
• Polynomial time approximation schemes for class-constrained packing problems
• An approximation scheme for bin packing with conflicts
• The class constrained bin packing problem with applications to video-on-demand
• Black and White Bin Packing
• Algorithms for the Bin Packing Problem with Conflicts
• Online Colored Bin Packing
• The Co-Printing Problem: A Packing Problem with a Color Constraint
• Variable neighborhood search: Principles and applications

This page was built for publication: VNS matheuristic for a bin packing problem with a color constraint