scholarly journals Overlap Detection in 2D Amorphous Shapes for Paper Optimization in Digital Printing Presses

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1033
Author(s):  
Yainier Labrada-Nueva ◽  
Martin H. Cruz-Rosales ◽  
Juan Manuel Rendón-Mancha ◽  
Rafael Rivera-López ◽  
Marta Lilia Eraña-Díaz ◽  
...  
Keyword(s):  
Bin Packing ◽  
Search Algorithm ◽  
Packing Problem ◽  
Environmental Benefits ◽  
Production Costs ◽  
Digital Printing ◽  
Neighborhood Structure ◽  
Paper Waste ◽  
Bin Packing Problem ◽  
Printing Presses

Paper waste in the mockups design with regular, irregular, and amorphous patterns is a critical problem in digital printing presses. Paper waste reduction directly impacts production costs, generating business and environmental benefits. This problem can be mapped to the two-dimensional irregular bin-packing problem. In this paper, an iterated local search algorithm using a novel neighborhood structure to detect overlaps between amorphous shapes is introduced. This algorithm is used to solve the paper waste problem, modeled as one 2D irregular bin-packing problem. The experimental results show that this approach works efficiently and effectively to detect and correct the overlaps between regular, irregular, and amorphous figures.

scholarly journals Optimizing large scale bin packing problem with hybrid harmony search algorithm

2021 ◽  
pp. 205-220 ◽  
Author(s):  
Amol C. Adamuthe ◽  
Tushar R. Nitave
Keyword(s):  
Bin Packing ◽  
Search Algorithm ◽  
Harmony Search ◽  
Packing Problem ◽  
Harmony Search Algorithm ◽  
Exploration And Exploitation ◽  
Iterative Search ◽  
Bin Packing Problem ◽  
Acceleration Rate ◽  
Wide Range

Bin packing problem (BPP) is a combinatorial optimization problem with a wide range of applications in fields such as financial budgeting, load balancing, project management, supply chain management. Harmony search algorithm (HSA) is widely used for various real-world and engineering problems due to its simplicity and efficient problem solving capability. Literature shows that basic HSA needs improvement in search capability as the performance of the algorithm degrades with increase in the problem complexity. This paper presents HSA with improved exploration and exploitation capability coupled with local iterative search based on random swap operator for solving BPP. The study uses the despotism based approach presented by Yadav et al. (2012) [Yadav P., Kumar R., Panda S.K., Chang, C. S. (2012). An intelligent tuned harmony search algorithm for optimisation. Information Sciences, 196, 47-72.] to divide Harmony memory (HM) into two categories which helps to maintain balance between exploration and exploitation. Secondly, local iterative search explores multiple neighborhoods by exponentially swapping components of solution vectors. A problem specific HM representation, HM re-initialization strategy and two adaptive PAR strategies are tested. The performance of proposed HSA is evaluated on 180 benchmark instances which consists of 100, 200 and 500 objects. Evaluation metrics such as best, mean, success rate, acceleration rate and improvement measures are used to compare HSA variations. The performance of the HSA with iterative local search outperforms other two variations of HSA.

An Effective Resolution Algorithm for the Two Dimensional Bin Packing Problem

2011 ◽  
Vol 291-294 ◽  
pp. 2574-2578
Author(s):  
Yu Yu Zhou ◽  
Yun Qing Rao ◽  
Chao Yong Zhang ◽  
Guo Jun Zhang
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Neighborhood Structure ◽  
Placement Method ◽  
Bin Packing Problem ◽  
Left Corner ◽  
Bottom Left ◽  
Resolution Algorithm

We address a two dimensional bin packing problem in this paper. Firstly, we adopt and improve bottom left placement method, which is presented as bottom left corner-occupying (BLCO). Secondly, borrowing from the respective advantages of the two algorithms, a hybrid of genetic algorithm (GA) and tabu search (TS), is developed to solve the problem. Thirdly, using a new neighborhood structure combined with the appropriate move evaluation strategy, we propose TS to re-intensify search from the promising solutions. The hybrid GATS is tested on a set of instances taken from the literature and the computation results validate the quality of the solutions.

Sign in / Sign up

Export Citation Format

Share Document