A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems

DOI10.1016/J.COR.2012.03.016zbMath1348.90531OpenAlexW1971647084MaRDI QIDQ336709

José Manuel Tamarit, Ramón Alvarez-Valdés, Francisco Parreño

Publication date: 10 November 2016

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

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

zbMATH Keywords

heuristicsGRASPbin packingpath relinking

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (10)

A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem ⋮ The multiple container loading problem with preference ⋮ Sharing loading costs for multi compartment vehicles ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ Three-stage heuristic algorithm for three-dimensional irregular packing problem ⋮ Determining the best shipper sizes for sending products to customers ⋮ The exact solutions of several types of container loading problems ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem

Uses Software

• OR-Library
• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• GRASP and path relinking for the max-min diversity problem
• Three-dimensional bin packing problem with variable bin height
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• A probabilistic heuristic for a computationally difficult set covering problem
• An analytical model for the container loading problem
• New bounds for multidimensional packing
• GRASP for set packing problems.
• Algorithms for packing and scheduling problems. (Abstract of thesis)
• A hybrid heuristic for the \(p\)-median problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Solving the variable size bin packing problem with discretized formulations
• The two-dimensional bin packing problem with variable bin sizes and costs
• An improved typology of cutting and packing problems
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• A General Purpose Algorithm for Three-Dimensional Packing
• A Linear Programming Approach to the Cutting-Stock Problem
• An APTAS for Generalized Cost Variable-Sized Bin Packing
• Variable Sized Bin Packing
• Two-Dimensional Finite Bin-Packing Algorithms
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• The Three-Dimensional Bin Packing Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Algorithms – ESA 2004

This page was built for publication: A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems