Wahyu Kurniawan, Achmad Pratama Rifai , Nur Aini Masruroh,
Volume 0, Issue 0 (10-2025)
Abstract
Adaptive Simulated Annealing (ASA) and Adaptive Large Neighborhood Search (ALNS) are two metaheuristic algorithms widely applied to solve discrete optimization problems. This study employs both algorithms to address the Container Loading Problem (CLP), a critical challenge in the consolidation-based freight forwarding industry, where maximizing container utilization directly influences revenue and operational efficiency. The case company, a national freight forwarding enterprise operating consolidation services in Indonesia, currently achieves an average container utilization rate of 56.8%, indicating a substantial opportunity for improvement. By formulating the CLP as a discrete combinatorial optimization model, this research aims to enhance both container load utilization and revenue through algorithmic optimization. The novelty of this work lies in its comparative implementation of ASA and ALNS under adaptive parameter calibration, applied to a real-world freight forwarding context, which remains rarely explored in previous CLP studies. Experimental results show that ALNS consistently outperforms ASA in terms of both objective value and robustness across scenarios. Specifically, the ALNS method achieves 85.4% container utilization and an average revenue increase of 8.6% per container, demonstrating superior efficiency in freight consolidation optimization. Additionally, experiments conducted under equal iteration conditions further support that ALNS maintains higher stability and better solution consistency compared to ASA, particularly in terms of fitness and utilization efficiency across different iteration scenarios. Despite ALNS requiring longer computation time, it remains well within the acceptable time frame for freight forwarding operations, where up to 24 hours is available for shipment planning. These findings provide practical implications for logistics firms seeking to integrate metaheuristic-based decision support systems to improve capacity utilization, responsiveness, and profitability.
Mr Aliakbar Hasani, Mr Seyed Hessameddin Zegordi,
Volume 26, Issue 1 (3-2015)
Abstract
In this study, an optimization model is proposed to design a Global Supply Chain (GSC) for a medical device manufacturer under disruption in the presence of pre-existing competitors and price inelasticity of demand. Therefore, static competition between the distributors’ facilities to more efficiently gain a further share in market of Economic Cooperation Organization trade agreement (ECOTA) is considered. This competition condition is affected by disruption occurrence. The aim of the proposed model is to maximize the expected net after-tax profit of GSC under disruption and normal situation at the same time. To effectively deal with disruption, some practical strategies are adopted in the design of GSC network. The uncertainty of the business environment is modeled using the robust optimization technique based on the concept of uncertainty budget. To tackle the proposed Mixed-Integer Nonlinear Programming (MINLP) model, a hybrid Taguchi-based Memetic Algorithm (MA) with an adaptive population size is developed that incorporates a customized Adaptive Large Neighborhood Search (ALNS) as its local search heuristic. A fitness landscape analysis is used to improve the systematic procedure of neighborhood selection in the proposed ALNS. A numerical example and computational results illustrate the efficiency of the proposed model and algorithm in dealing with global disruptions under uncertainty and competition pressure.
