A Review of Pallet Loading Problem with Formulations and Solutions

Chenyang Zhang; Mengchu Zhou

doi:10.1049/icp.2024.3690

A Review of Pallet Loading Problem with Formulations and Solutions

Research output: Contribution to journal › Conference article › peer-review

Abstract

An optimal or near-optimal solution to Pallet Loading Problems (PLP) can mean high efficiency and low logistics costs in various industry scenarios, such as warehouse management, shipping, and airline cargo transportation. Three-Dimensional Bin Packing Problems (3D-BPP) and Container Loading Problems (CLP) have many commonalities with PLP. Therefore, reviewing their solutions can inspire us to solve PLP. In this paper, we discuss different scenarios of PLP and indicate their various constraints and objectives. Then, we summarize different algorithms and show their advantages and disadvantages. Finally, we discuss the possible future research direction, which can help advance this research field.

Original language	English (US)
Pages (from-to)	261-266
Number of pages	6
Journal	IET Conference Proceedings
Volume	2023
Issue number	49
DOIs	https://doi.org/10.1049/icp.2024.3690
State	Published - 2023
Externally published	Yes
Event	2023 International Conference on Automation in Manufacturing, Transportation and Logistics, iCaMaL 2023 - Wuhan, China Duration: Nov 3 2023 → Nov 5 2023

All Science Journal Classification (ASJC) codes

General Engineering

Keywords

3D BIN PACKING PROBLEM
CONTAINER LOADING PROBLEM
PALLET LOADING PROBLEM

Access to Document

10.1049/icp.2024.3690

Cite this

@article{0e4e609563864f498831f102a6cb96a7,

title = "A Review of Pallet Loading Problem with Formulations and Solutions",

abstract = "An optimal or near-optimal solution to Pallet Loading Problems (PLP) can mean high efficiency and low logistics costs in various industry scenarios, such as warehouse management, shipping, and airline cargo transportation. Three-Dimensional Bin Packing Problems (3D-BPP) and Container Loading Problems (CLP) have many commonalities with PLP. Therefore, reviewing their solutions can inspire us to solve PLP. In this paper, we discuss different scenarios of PLP and indicate their various constraints and objectives. Then, we summarize different algorithms and show their advantages and disadvantages. Finally, we discuss the possible future research direction, which can help advance this research field.",

keywords = "3D BIN PACKING PROBLEM, CONTAINER LOADING PROBLEM, PALLET LOADING PROBLEM",

author = "Chenyang Zhang and Mengchu Zhou",

note = "Publisher Copyright: {\textcopyright} The Institution of Engineering & Technology 2023.; 2023 International Conference on Automation in Manufacturing, Transportation and Logistics, iCaMaL 2023 ; Conference date: 03-11-2023 Through 05-11-2023",

year = "2023",

doi = "10.1049/icp.2024.3690",

language = "English (US)",

volume = "2023",

pages = "261--266",

journal = "IET Conference Proceedings",

issn = "2732-4494",

publisher = "Institution of Engineering and Technology",

number = "49",

}

TY - JOUR

T1 - A Review of Pallet Loading Problem with Formulations and Solutions

AU - Zhang, Chenyang

AU - Zhou, Mengchu

N1 - Publisher Copyright: © The Institution of Engineering & Technology 2023.

PY - 2023

Y1 - 2023

N2 - An optimal or near-optimal solution to Pallet Loading Problems (PLP) can mean high efficiency and low logistics costs in various industry scenarios, such as warehouse management, shipping, and airline cargo transportation. Three-Dimensional Bin Packing Problems (3D-BPP) and Container Loading Problems (CLP) have many commonalities with PLP. Therefore, reviewing their solutions can inspire us to solve PLP. In this paper, we discuss different scenarios of PLP and indicate their various constraints and objectives. Then, we summarize different algorithms and show their advantages and disadvantages. Finally, we discuss the possible future research direction, which can help advance this research field.

AB - An optimal or near-optimal solution to Pallet Loading Problems (PLP) can mean high efficiency and low logistics costs in various industry scenarios, such as warehouse management, shipping, and airline cargo transportation. Three-Dimensional Bin Packing Problems (3D-BPP) and Container Loading Problems (CLP) have many commonalities with PLP. Therefore, reviewing their solutions can inspire us to solve PLP. In this paper, we discuss different scenarios of PLP and indicate their various constraints and objectives. Then, we summarize different algorithms and show their advantages and disadvantages. Finally, we discuss the possible future research direction, which can help advance this research field.

KW - 3D BIN PACKING PROBLEM

KW - CONTAINER LOADING PROBLEM

KW - PALLET LOADING PROBLEM

UR - http://www.scopus.com/inward/record.url?scp=85216737745&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85216737745&partnerID=8YFLogxK

U2 - 10.1049/icp.2024.3690

DO - 10.1049/icp.2024.3690

M3 - Conference article

AN - SCOPUS:85216737745

SN - 2732-4494

VL - 2023

SP - 261

EP - 266

JO - IET Conference Proceedings

JF - IET Conference Proceedings

IS - 49

T2 - 2023 International Conference on Automation in Manufacturing, Transportation and Logistics, iCaMaL 2023

Y2 - 3 November 2023 through 5 November 2023

ER -

A Review of Pallet Loading Problem with Formulations and Solutions

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this