Optimizing Supply Chain Shipping Time Prediction: A Hybrid Approach Using a Modified Marine Predators Algorithm

Accurate Shipping Time Estimation (STE) remains a critical and complex challenge in supply chain management, requiring the application of sophisticated and flexible machine learning (ML) techniques. Precise shipping time predictions are essential for businesses seeking to improve operational efficiency and satisfy customer demands in dynamic, time-sensitive contexts. This study proposes a novel enhancement of the Marine Predators Algorithm (MPA), specifically designed for hyperparameter optimization of ML models targeting STE. Leveraging a publicly available shipping optimization challenge dataset, which provides a comprehensive and standardized benchmark, a hybrid modeling framework is developed by integrating ML algorithms with the enhanced optimization algorithm. This integration aims to elevate both the predictive accuracy and generalization capabilities of the models. The proposed approach is rigorously compared against the MPA and the existing versions modified for hyperparameter tuning. Experimental results reveal that the enhanced MPA-based model significantly outperforms competing methods, exhibiting superior robustness and estimation accuracy. The findings highlight the efficacy of the proposed enhancement in optimizing supply chain STE models and contribute meaningful insights to the advancement of supply chain analytics.

Authors

Institutions

Publication Details

Published
2025-11-14
DOI
https://doi.org/10.1109/ismsit67332.2025.11267800
Primary Topic
Maritime Ports and Logistics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Supply Chain Shipping Time Prediction: A Hybrid Approach Using a Modified Marine Predators Algorithm

Veysel Aslantaş, Murat Taşyürek, Resul Özdemir
Maritime Ports and Logistics
article

Optimizing Supply Chain Shipping Time Prediction: A Hybrid Approach Using a Modified Marine Predators Algorithm

Veysel Aslantaş, Murat Taşyürek, Resul Özdemir
article en

Abstract

Accurate Shipping Time Estimation (STE) remains a critical and complex challenge in supply chain management, requiring the application of sophisticated and flexible machine learning (ML) techniques. Precise shipping time predictions are essential for businesses seeking to improve operational efficiency and satisfy customer demands in dynamic, time-sensitive contexts. This study proposes a novel enhancement of the Marine Predators Algorithm (MPA), specifically designed for hyperparameter optimization of ML models targeting STE. Leveraging a publicly available shipping optimization challenge dataset, which provides a comprehensive and standardized benchmark, a hybrid modeling framework is developed by integrating ML algorithms with the enhanced optimization algorithm. This integration aims to elevate both the predictive accuracy and generalization capabilities of the models. The proposed approach is rigorously compared against the MPA and the existing versions modified for hyperparameter tuning. Experimental results reveal that the enhanced MPA-based model significantly outperforms competing methods, exhibiting superior robustness and estimation accuracy. The findings highlight the efficacy of the proposed enhancement in optimizing supply chain STE models and contribute meaningful insights to the advancement of supply chain analytics.

Kayseri Eğitim ve Araştırma Hastanesi (TR), Kayseri Üniversitesi (TR), Erciyes University (TR)
Openalex Percentile: Top 49%
Maritime Ports and Logistics
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.