Feasibility-Weighted Multi-Layer Benchmarking Path Optimization Model: The Cases of International Port Terminals

Several Data Envelopment Analysis (DEA)-based benchmarking approaches have been proposed to enable step-by-step performance improvement; however, they frequently overlook the practical aspects necessary to ensure the feasibility and success of the benchmarking process for real-world operations. Simply, these approaches allow inefficient Decision Making Units (DMUs) to reach their targets step by step, thus facilitating gradual performance improvement. Most of the relevant studies in the literature have focused on stratifying DMUs into multiple efficiency layers. This paper introduces a new, practical DEA-based benchmarking framework tailored to the maritime port industry. Specifically, it proposes a feasibility-weighted multi-layer benchmarking path optimization (FW-MLBP) model that determines optimal stepwise benchmarking targets for inefficient ports by minimizing the total amount of controllable resource adjustment required at each stage. This model enables an inefficient port to select a series of manageable intermediate benchmarking targets from a set of efficient ports before ultimately reaching the best-performing one. To validate the effectiveness and practicality of our proposed methodology, we applied it to 30 international port terminals, successfully identifying their optimal stepwise benchmarking targets and demonstrating a viable, incremental path toward enhanced efficiency.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-12-09
DOI
https://doi.org/10.3390/math13243927
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

Feasibility-Weighted Multi-Layer Benchmarking Path Optimization Model: The Cases of International Port Terminals

Jae‐Hun Park, Hyun-Mo Koo
Mathematics
Maritime Ports and Logistics
article

Feasibility-Weighted Multi-Layer Benchmarking Path Optimization Model: The Cases of International Port Terminals

Jae‐Hun Park, Hyun-Mo Koo
article en

Abstract

Several Data Envelopment Analysis (DEA)-based benchmarking approaches have been proposed to enable step-by-step performance improvement; however, they frequently overlook the practical aspects necessary to ensure the feasibility and success of the benchmarking process for real-world operations. Simply, these approaches allow inefficient Decision Making Units (DMUs) to reach their targets step by step, thus facilitating gradual performance improvement. Most of the relevant studies in the literature have focused on stratifying DMUs into multiple efficiency layers. This paper introduces a new, practical DEA-based benchmarking framework tailored to the maritime port industry. Specifically, it proposes a feasibility-weighted multi-layer benchmarking path optimization (FW-MLBP) model that determines optimal stepwise benchmarking targets for inefficient ports by minimizing the total amount of controllable resource adjustment required at each stage. This model enables an inefficient port to select a series of manageable intermediate benchmarking targets from a set of efficient ports before ultimately reaching the best-performing one. To validate the effectiveness and practicality of our proposed methodology, we applied it to 30 international port terminals, successfully identifying their optimal stepwise benchmarking targets and demonstrating a viable, incremental path toward enhanced efficiency.

MathematicsVol. 13(24)
Changwon National University (KR)
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.