Solving the pallet loading problem

Martins, Gustavo Henrique Alves; Dell, Robert F.

doi:10.1016/j.ejor.2006.11.012

Cited by 45 publications

(59 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This example is just one case, each n and k pairs have several combinations depending on the occurrence of PLCs. Equation (18) shows the formula, which defines the number of possible combinations.…”

Section: Complexity Of Order Picking Of One Ul Without Order Separationmentioning

confidence: 99%

“…However, while the physical product parameters (dimensions, weight, SKU type) and product stacking properties influence the physically possible picking sequence in order to build stable ULs, researchers rarely take into account these aspects during SLA and routing optimisation. Furthermore, many researchers have attained valuable results in the fields of Pallet Loading and Bin Packing Problem (e.g., [18,17,3,21,11]), but the solutions are rarely harmonised with SLA and routing algorithms. Shiau et al solved the multi-container loading problem and defined the order picking sequence but they avoided the SLA [22].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Necessity and complexity of order picking routing optimisation based on pallet loading features

Bódis

Botzheim

Földesi

2017

Acta Universitatis Sapientiae, Informatica

View full text Add to dashboard Cite

Abstract. Order picking is the most labour-intensive and costly activity of warehouses. The main challenges of its improvement are the synchronisation of warehouse layout, storage assignment policy, routing, zoning, and batching. Furthermore, the competitiveness of the warehouse depends on how it adapts to the unique customer demands and product parameters and the changes. The operators usually have to manage the picking sequence based on best practices taking into consideration the product stacking factors and minimising the lead time. It is usually necessary to support the operators by making effective decisions. Researchers of the pallet loading problem, bin packing problem, and order picking optimisation provide a wide horizon of solutions but their results are rarely synchronised. Necessity and complexity of OPRO based on PLF 163The research defines the order picking routing problem based on Pallet Loading Feature (PLF). It describes measurement and product stacking rule evaluation methods to highlight when the PLF based optimisation is necessary. The paper shows that in order picking problems based on PLF, the number of combinations a brute-force search algorithm has to examine grows exponentially, which highlights the importance of meta-heuristic optimisation. The study describes a Simulated Annealing algorithm for order picking based on PLF.

show abstract

Section: Complexity Of Order Picking Of One Ul Without Order Separationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Necessity and complexity of order picking routing optimisation based on pallet loading features

Bódis

Botzheim

Földesi

2017

Acta Universitatis Sapientiae, Informatica

View full text Add to dashboard Cite

show abstract

“…Martins and Dell (2007) define the Minimum Size Instance (MSI) of an equivalence class of PLP and present an algorithm for MSI. Martins and Dell (2008) present new bounds, heuristics, and an exact algorithm for the MPL The set of all PLP instances with an area ratio (pallet area divided by box area) less than 101 boxes can be represented by 3,080,730 equivalent classes. They propose a heuristic, namely, G5-heuristic, which finds optimal solutions to 3,073,724 of these 3,080,730 classes and in the remaining 7006 classes only differs from the best known bound by one box.…”

Section: Literature Reviewmentioning

confidence: 99%

Pallet Consolidation Problems in Distribution Centers

Rim¹,

Lim²

2011

Journal of Korean Institute of Industrial Engineers

View full text Add to dashboard Cite

물류센터의 팔렛합적 문제 임석철․임규석 아주대학교 대학원 산업공학과In most distribution centers, products are received from the suppliers in units of pallet, stored in a rack, moved to the picking area for replenishment, picked according to customer orders, and shipped to customers. In some distribution centers, however, replenishment is made in not a whole pallet but only a portion of a pallet load, mainly due to the limited space in the order-picking area; as a result, partially loaded pallets occupy cells in the rack. As the number of slow-moving items increases, more cells are occupied by partially loaded pallets so that fewer empty cells are available for storing full, incoming pallets. This will necessitate the construction or leasing of additional storage space, which will entail significant cost. As an alternative, we propose pallet consolidation, which involves moving a partial load to another partially-loaded pallet in order to create one empty cell in the rack. In this paper, we define three pallet consolidation problems; formulate each problem as a binary integer programming model; and present heuristic algorithms for the problems. The average performance of each of the proposed heuristics is evaluated using simulation.

show abstract

“…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%

“…In other cases, programming languages such as C+ in its different versions have been the chosen language for the development of the algorithms as referred in [3], [8], [10], [12], [14], [23], [25], [26], [31], [37] and [39].…”

Section: Literature Reviewmentioning

confidence: 99%

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

Solving the pallet loading problem

Cited by 45 publications

References 24 publications

Necessity and complexity of order picking routing optimisation based on pallet loading features

Necessity and complexity of order picking routing optimisation based on pallet loading features

Pallet Consolidation Problems in Distribution Centers

Una revisión literaria del Problema de Carga del Pallet

Contact Info

Product

Resources

About