Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems

The ongoing container shortage crisis has presented significant challenges for the freight forwarding industry, requiring companies to implement adaptive measures in order to maintain peak operational efficiency. This article presents a novel mathematical model and artificial bee colony algorithm (A...

Full description

Bibliographic Details
Main Authors: Suriya Phongmoo, Komgrit Leksakul, Nivit Charoenchai, Chawis Boonmee
Format: Article
Language:English
Published: MDPI AG 2023-05-01
Series:Applied Sciences
Subjects:
Online Access:https://www.mdpi.com/2076-3417/13/11/6601
_version_ 1797597870652653568
author Suriya Phongmoo
Komgrit Leksakul
Nivit Charoenchai
Chawis Boonmee
author_facet Suriya Phongmoo
Komgrit Leksakul
Nivit Charoenchai
Chawis Boonmee
author_sort Suriya Phongmoo
collection DOAJ
description The ongoing container shortage crisis has presented significant challenges for the freight forwarding industry, requiring companies to implement adaptive measures in order to maintain peak operational efficiency. This article presents a novel mathematical model and artificial bee colony algorithm (ABC) with a Pareto-based approach to solve single-container-loading problems. The goal is to fit a set of boxes with strongly heterogeneous boxes into a container with a specific dimension to minimize the broken space and maximize profits. Furthermore, the proposed algorithm incorporates the bottom-left fill method, which is a heuristic strategy for packing containers. We conducted numerical testing to identify optimal parameters using the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover accent="true"><mrow><mi>C</mi></mrow><mo>~</mo></mover></mrow></semantics></math></inline-formula> metric method. Subsequently, we evaluated the performance of our proposed algorithm by comparing it to other heuristics and meta-heuristic approaches using the relative improvement (RI) value. Our analysis showed that our algorithm outperformed the other approaches and achieved the best results. These results demonstrate the effectiveness of the proposed algorithm in solving real-world single-container-loading problems for freight forwarding companies.
first_indexed 2024-03-11T03:11:30Z
format Article
id doaj.art-6a0e721efe484412b67a54d6d8c128fc
institution Directory Open Access Journal
issn 2076-3417
language English
last_indexed 2024-03-11T03:11:30Z
publishDate 2023-05-01
publisher MDPI AG
record_format Article
series Applied Sciences
spelling doaj.art-6a0e721efe484412b67a54d6d8c128fc2023-11-18T07:34:17ZengMDPI AGApplied Sciences2076-34172023-05-011311660110.3390/app13116601Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading ProblemsSuriya Phongmoo0Komgrit Leksakul1Nivit Charoenchai2Chawis Boonmee3Graduate Program in Industrial Engineering, Department of Industrial Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai 50200, ThailandSupply Chain and Engineering Management Research Unit, Chiang Mai University, Chiang Mai 50200, ThailandDepartment of Industrial Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai 50200, ThailandDepartment of Industrial Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai 50200, ThailandThe ongoing container shortage crisis has presented significant challenges for the freight forwarding industry, requiring companies to implement adaptive measures in order to maintain peak operational efficiency. This article presents a novel mathematical model and artificial bee colony algorithm (ABC) with a Pareto-based approach to solve single-container-loading problems. The goal is to fit a set of boxes with strongly heterogeneous boxes into a container with a specific dimension to minimize the broken space and maximize profits. Furthermore, the proposed algorithm incorporates the bottom-left fill method, which is a heuristic strategy for packing containers. We conducted numerical testing to identify optimal parameters using the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover accent="true"><mrow><mi>C</mi></mrow><mo>~</mo></mover></mrow></semantics></math></inline-formula> metric method. Subsequently, we evaluated the performance of our proposed algorithm by comparing it to other heuristics and meta-heuristic approaches using the relative improvement (RI) value. Our analysis showed that our algorithm outperformed the other approaches and achieved the best results. These results demonstrate the effectiveness of the proposed algorithm in solving real-world single-container-loading problems for freight forwarding companies.https://www.mdpi.com/2076-3417/13/11/6601artificial bee colonymulti-objectivessingle-container-loading problem
spellingShingle Suriya Phongmoo
Komgrit Leksakul
Nivit Charoenchai
Chawis Boonmee
Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems
Applied Sciences
artificial bee colony
multi-objectives
single-container-loading problem
title Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems
title_full Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems
title_fullStr Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems
title_full_unstemmed Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems
title_short Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems
title_sort artificial bee colony algorithm with pareto based approach for multi objective three dimensional single container loading problems
topic artificial bee colony
multi-objectives
single-container-loading problem
url https://www.mdpi.com/2076-3417/13/11/6601
work_keys_str_mv AT suriyaphongmoo artificialbeecolonyalgorithmwithparetobasedapproachformultiobjectivethreedimensionalsinglecontainerloadingproblems
AT komgritleksakul artificialbeecolonyalgorithmwithparetobasedapproachformultiobjectivethreedimensionalsinglecontainerloadingproblems
AT nivitcharoenchai artificialbeecolonyalgorithmwithparetobasedapproachformultiobjectivethreedimensionalsinglecontainerloadingproblems
AT chawisboonmee artificialbeecolonyalgorithmwithparetobasedapproachformultiobjectivethreedimensionalsinglecontainerloadingproblems