A Two-phase algorithm for the manufacturer&amp;#x2019;s pallet loading problem

Wu, Kun-Chih; Ting, Ching‐Jung

doi:10.1109/ieem.2007.4419457

Cited by 11 publications

(25 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some exact algorithms based on mathematical models require a sub-algorithm to determine the layout of an optimal solution (Beasley, 1985;Wu & Ting, 2007). To obtain the layout of a solution, they solved another mathematical model.…”

Section: Discussionmentioning

confidence: 99%

An improved best-first branch and bound algorithm for the pallet-loading problem using a staircase structure

Ahn

Park

Yoon

2015

Expert Systems with Applications

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

An improved best-first branch and bound algorithm for the pallet-loading problem using a staircase structure

Ahn

Park

Yoon

2015

Expert Systems with Applications

View full text Add to dashboard Cite

“…Alvarez-Valdes, Parreño, and Tamarit (2005b) proposed a branch and cut algorithm using Beasley's (1985) formulation and found the optimal solutions for the problems introduced by Alvarez-Valdes, Parreño, and Tamarit (2005a); however, the required computing time was quite long. Wu and Ting (2007) developed a two-phase algorithm based on a new integer programming model. In the first phase, they obtained the maximum number of boxes that could be loaded onto a pallet.…”

Section: Existing Researchmentioning

confidence: 99%

A best-first branch and bound algorithm for the pallet-loading problem

Ahn

Yoon

Park

2014

International Journal of Production Research

View full text Add to dashboard Cite

In this study, we proposed an optimal algorithm for the pallet-loading problem (PLP). The PLP involves determining a loading pattern that can load the most identical boxes with rectangular shapes onto a large rectangular pallet. A new branch and bound algorithm, including a sub-algorithm that cheques the feasibility of the solutions, was proposed to solve a relaxed mathematical model, which did not consider the exact position of the boxes. Because the algorithm constructed the layout row-by-row and used effective branching strategies and improved bounds, it found a solution very quickly. Whenever a solution was obtained for the relaxed problem, another branch and bound algorithm (as a subalgorithm) was used to check whether the solution obtained was feasible and to determine the resulting layout. The branching strategies in the sub-algorithm used the solution from the relaxation problem to quickly find the layout of the solution. The computational results demonstrated the superiority of the proposed algorithm. The algorithm proposed in this study solved all three million problems presented with an area ratio bound of less than 101 boxes in a minute, except for one. Solutions to all of the problems were obtained within 90 s, while other existing exact algorithms required more than an hour for some problems.

show abstract

“…On the other hand, existing software like CPLEX, LINDO and CPN Tools has also been employed in the research of a solution for the PLP in [1], [4], [5] and [37]. Table 1 was developed to summarize the technique used in each of the approaches reviewed.…”

Section: Literature Reviewmentioning

confidence: 99%

“…It could be observed that the majority of them use exact algorithms with the incorporation of heuristics. The conformation of blocks (G4, G5), patterns or groups the heuristic method more widely employed when solving the PLP in either of its two variations as in the works of [1], [6], [7], [10], [14], [17], [31], [34], [37], [38] and [39]. Heuristics are normally used within these solution methods because they allowed the possibility to reduce computational time for this NPhard problem.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Una revisión literaria del Problema de Carga del Pallet

Vargas-Osorio

Zúñiga

2016

Lámpsakos

View full text Add to dashboard Cite

Abstract. Nowadays, businesses face a fi erce competition. Hence, implementing strategies to achieve competitiveness is elemental. For that purpose, in the logistics fi eld, the proper use of resources is a must. According to several experts, storing and transportation have a high impact in the overall supply chain profi t. Therefore, lowering their impact by increasing effi ciency contribute to a higher profi tability. An effi cient palletizing can cause to easily ship more goods onto a pallet with the consequent savings in transportation and storage. The denominated Pallet Loading Problem (PLP) focuses on fi nding space optimization to load the maximum quantity of packed product onto the pallet.This article presents a literature review of the most prominent approaches with the objective of showing the main characteristics and solution methods proposed by researchers. Thus, the understanding of these solution approaches can help in the development of new strategies or approaches to deal with the palletizing. Keywords:Logistics, Transportation, Pallet, Literature Review, Pallet Loading Problem.Resumen: Actualmente, las empresas enfrentan una competencia agresiva, por lo que implementar estrategias para alcanzar la competitividad es elemental. En este sentido, en Logística, el uso adecuado de los recursos es imprescindible. El impacto en la ganancia que tienen el almacenaje y el transporte, conlleva la implementación de acciones para contrarrestarlo. Un paletizado efectivo puede contribuir a reducir costos.El Problema de Carga del Pallet (PLP) procura la optimización del espacio del pallet para lograr cargar la mayor cantidad de producto debidamente empacado. El uso práctico y benefi cios del PLP han dado pie a su estudio en la búsqueda de solución.Este artículo presenta una revisión literaria de los principales estudios para mostrar las características principales y los métodos de solución propuestos, generando una base de entendimiento que permita dar sustento a la elaboración de nuevos modelos y estrategias en la solución del PLP.

show abstract

A Two-phase algorithm for the manufacturer’s pallet loading problem

Cited by 11 publications

References 23 publications

An improved best-first branch and bound algorithm for the pallet-loading problem using a staircase structure

An improved best-first branch and bound algorithm for the pallet-loading problem using a staircase structure

A best-first branch and bound algorithm for the pallet-loading problem

Una revisión literaria del Problema de Carga del Pallet

Contact Info

Product

Resources

About