Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem

1999 ◽  
pp. 125-139 ◽  
Author(s):  
Andrea Lodi ◽  
Silvano Martello ◽  
Daniele Vigo
Keyword(s):  
Bin Packing ◽  
Search Algorithm ◽  
Packing Problem ◽  
Neighborhood Search ◽  
Two Dimensional ◽  
Bin Packing Problem ◽  
Neighborhood Search Algorithm

A variable neighborhood search algorithm for the bin packing problem with compatible categories

2019 ◽  
Vol 124 ◽  
pp. 209-225 ◽  
Author(s):  
Luiz F.O. Moura Santos ◽  
Renan Sallai Iwayama ◽  
Luísa Brandão Cavalcanti ◽  
Leandro Maciel Turi ◽  
Fabio Emanuel de Souza Morais ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Bin Packing ◽  
Search Algorithm ◽  
Packing Problem ◽  
Neighborhood Search ◽  
Bin Packing Problem ◽  
Neighborhood Search Algorithm

scholarly journals A Reduced Variable Neighborhood Search Approach to the Heterogeneous Vector Bin Packing Problem

2021 ◽  
Vol 50 (4) ◽  
pp. 808-826
Author(s):  
Đorđe Stakić ◽  
Miodrag Živković ◽  
Ana Anokić
Keyword(s):  
Variable Neighborhood Search ◽  
Bin Packing ◽  
Optimization Problems ◽  
Packing Problem ◽  
Neighborhood Search ◽  
Two Dimensional ◽  
Total Cost ◽  
Bin Packing Problem ◽  
Benchmark Instances ◽  
Search Approach

The two-dimensional heterogeneous vector bin packing problem (2DHet-VBPP) consists of packing the set of items into the set of various type bins, respecting their two resource limits. The problem is to minimize the total cost of all bins. The problem, known to be NP-hard, can be formulated as a pure integer linear program, but optimal solutions can be obtained by the CPLEX Optimizer engine only for small instances. This paper proposes a metaheuristic approach to the 2DHet-VBPP, based on Reduced variable neighborhood search (RVNS). All RVNS elements are adapted to the considered problem and many procedures are designed to improve efficiency of the method. As the Two-dimensional Homogeneous-VBPP (2DHom-VBPP) is more often treated, we considered also a special version of the RVNS algorithm to solve the 2DHom-VBPP. The results obtained and compared to both CPLEX results and results on benchmark instances from literature, justify the use of the RVNS algorithm to solve large instances of these optimization problems.

Variable Neighborhood Search Algorithm for the Variable Cost and Size Bin Packing Problem

2019 ◽  
pp. 1-17
Author(s):  
Héctor J. Fraire-Huacuja ◽  
Alejandro Estrada Padilla ◽  
Laura Cruz-Reyes ◽  
Claudia Gómez-Santillán ◽  
Nelson Rangel-Valdez ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Bin Packing ◽  
Search Algorithm ◽  
Hypothesis Test ◽  
Value Added ◽  
Packing Problem ◽  
Neighborhood Search ◽  
Variable Cost ◽  
Order Batching ◽  
Bin Packing Problem

A company that transports goods to supply customers usually needs to plan the routes that the fleet must follow, since transportation means a high percentage of the value added to goods. The vehicles must be loaded with the products located in the warehouse to fulfill the orders requested by customers. Many enterprises use order batching and picking systems to improve the warehouse management. This chapter describes a novel algorithm based on the methodology of variable neighborhood search for the variable cost and size bin packing problem. This problem considers that the sizes and costs of the bins can be different and there is no correlation between them, which is a sensible assumption for the order batching process in many applications. A series of computational experiments were conducted with a set of hard instances to validate this approach. The results show that the proposed algorithm outperforms the state-of-the-art algorithm, and a statistical hypothesis test is used to support the obtained conclusions.

scholarly journals A Binary Crow Search Algorithm for Solving Two-dimensional Bin Packing Problem with Fixed Orientation

2020 ◽  
Vol 167 ◽  
pp. 809-818 ◽  
Author(s):  
Soukaina Laabadi ◽  
Mohamed Naimi ◽  
Hassan El Amri ◽  
Boujemâa Achchab
Keyword(s):  
Bin Packing ◽  
Search Algorithm ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem ◽  
Fixed Orientation

An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations

2021 ◽  
pp. 105550
Author(s):  
Hao Zhang ◽  
Qiang Liu ◽  
Lijun Wei ◽  
Jiawei Zeng ◽  
Jiewu Leng ◽  
...  
Keyword(s):  
Local Search ◽  
Bin Packing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem

A new lower bound for the non-oriented two-dimensional bin-packing problem

2007 ◽  
Vol 35 (3) ◽  
pp. 365-373 ◽  
Author(s):  
François Clautiaux ◽  
Antoine Jouglet ◽  
Joseph El Hayek
Keyword(s):  
Lower Bound ◽  
Bin Packing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem
Sign in / Sign up

Export Citation Format

Share Document