Author
Listed:
- Natalia Romero-Olarte
(Department of Industrial Engineering, Universidad de los Andes, Bogotá 111711, Colombia)
- Santiago Amézquita-Ortiz
(Department of Industrial Engineering, Universidad de los Andes, Bogotá 111711, Colombia)
- John Willmer Escobar
(Department of Accounting and Finance, Universidad del Valle, Cali 760032, Colombia)
- David Álvarez-Martínez
(Department of Industrial Engineering, Universidad de los Andes, Bogotá 111711, Colombia)
Abstract
The container loading problem (CLP) has a broad spectrum of applications in industry and has been studied for over 60 years due to its high complexity. This paper addresses a realistic single-container loading scenario with practical constraints, including orientation limitations, maximum stacking weight, static stability, overall container weight limit, and fractional loading for multiple drop-off points (multidrop). We propose an open-source decision support system (DSS) implemented on a widely used platform (MS Excel®), which employs a heuristic algorithm to find efficient loading solutions under these constraints. The DSS uses a multi-start randomized constructive algorithm based on a maximal residual space representation. The constructive phase builds the loading pattern in vertical layers (columns or walls), while respecting all practical constraints. The performance of the proposed heuristic is validated through extensive computational experiments on classical benchmark instances, comparing its results against the recent state-of-the-art methods. We also analyze the impact of multi-drop constraints on utilization metrics. The DSS features an interactive interface for creating/loading instances, visualizing step-by-step packing patterns, and displaying key statistics, thus providing a user-friendly decision tool for practitioners.
Suggested Citation
Natalia Romero-Olarte & Santiago Amézquita-Ortiz & John Willmer Escobar & David Álvarez-Martínez, 2025.
"Decision Support System to Solve Single-Container Loading Problem Considering Practical Constraints,"
Mathematics, MDPI, vol. 13(10), pages 1-22, May.
Handle:
RePEc:gam:jmathe:v:13:y:2025:i:10:p:1668-:d:1659427
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:10:p:1668-:d:1659427. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.