Adaptive metaheuristics for solving the container loading problem

Consolidation freight forwarders frequently face cargo-acceptance decisions in which available cargo exceeds container capacity, shipment groups must be preserved, priority customers require service protection, and actual cargo volume and weight may deviate from declared values. This study develops a robust, service-aware cargo-selection variant of the Container Loading Problem that integrates selected freight revenue, complete-shipment requirements, customer-priority penalties, and scenario-based robust volume and weight capacity constraints. A mixed-integer linear programming formulation is proposed and used to provide exact benchmark solutions for seven controlled instances. Six metaheuristic variants are then designed and evaluated across three algorithmic families: Adaptive Large Neighborhood Search, Adaptive Simulated Annealing, and Binary Particle Swarm Optimization, each compared with its baseline counterpart. The controlled benchmark results show that Adaptive BPSO achieved the smallest average gap to the MILP optimum, at 0.0071%, while LNS and ASA also produced competitive solutions. The results also show that adaptivity is beneficial but not uniformly dominant across algorithm families. In the real-case-derived experiment using anonymized export-shipment data from an Indonesian logistics provider, Adaptive BPSO reached the best-found reference in all tested runs, while Baseline BPSO provided a strong balance between solution quality and runtime. Robust capacity analysis further shows that the selected cargo plans remained feasible under all predefined volume and weight scenarios while maintaining high container utilization. The study contributes a robust service-aware formulation, exact benchmark evidence, adaptive metaheuristic designs, and practical insights for cargo-acceptance decision support in consolidation freight forwarding.

Authors

Institutions

Publication Details

Journal
Journal of Shipping and Trade
Published
2026-11-17
DOI
https://doi.org/10.1186/s41072-026-00249-z
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Adaptive metaheuristics for solving the container loading problem

Nur Mayke Eka Normasari, Achmad Pratama Rifai, Andiny Trie Oktavia, Wahyu Kurniawan et al.
Journal of Shipping and Trade
Optimization and Packing Problems
article

Adaptive metaheuristics for solving the container loading problem

Nur Mayke Eka Normasari, Achmad Pratama Rifai, Andiny Trie Oktavia, Wahyu Kurniawan, Niasari Utami Riskie
article en

Abstract

Consolidation freight forwarders frequently face cargo-acceptance decisions in which available cargo exceeds container capacity, shipment groups must be preserved, priority customers require service protection, and actual cargo volume and weight may deviate from declared values. This study develops a robust, service-aware cargo-selection variant of the Container Loading Problem that integrates selected freight revenue, complete-shipment requirements, customer-priority penalties, and scenario-based robust volume and weight capacity constraints. A mixed-integer linear programming formulation is proposed and used to provide exact benchmark solutions for seven controlled instances. Six metaheuristic variants are then designed and evaluated across three algorithmic families: Adaptive Large Neighborhood Search, Adaptive Simulated Annealing, and Binary Particle Swarm Optimization, each compared with its baseline counterpart. The controlled benchmark results show that Adaptive BPSO achieved the smallest average gap to the MILP optimum, at 0.0071%, while LNS and ASA also produced competitive solutions. The results also show that adaptivity is beneficial but not uniformly dominant across algorithm families. In the real-case-derived experiment using anonymized export-shipment data from an Indonesian logistics provider, Adaptive BPSO reached the best-found reference in all tested runs, while Baseline BPSO provided a strong balance between solution quality and runtime. Robust capacity analysis further shows that the selected cargo plans remained feasible under all predefined volume and weight scenarios while maintaining high container utilization. The study contributes a robust service-aware formulation, exact benchmark evidence, adaptive metaheuristic designs, and practical insights for cargo-acceptance decision support in consolidation freight forwarding.

Journal of Shipping and TradeVol. 11(1)
Universitas Gadjah Mada (ID), Universitas Jenderal Achmad Yani Yogyakarta (ID)
Industry, innovation and infrastructure
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon