Navigating a Greener Horizon: Route Optimization of LNG Shipping

This research addresses a critical gap in maritime logistics optimization by developing the first comprehensive Capacitated Vehicle Routing Problem (CVRP) framework specifically designed for Japan's domestic Liquified Natural Gas (LNG) terminal distribution network. Despite Japan being the world's second-largest LNG consumer with 37 operational terminals, no prior academic research has systematically optimized inter-terminal routing within this strategically important market. The study develops solutions using Mixed Integer Linear Programming (MILP) and Clarke-Wright Savings Algorithm to minimize operational costs while incorporating Boil-Off Gas (BOG) losses as a novel constraint in maritime CVRP formulations. Through analysis of five vessel capacity configurations (125,000-180,000 m³) across eight representative Japanese terminals, this research demonstrates that 180,000 m³ vessels achieve optimal performance with 3-vessel fleet deployment and 80.2% average utilization. When operational consistency constraints require minimum 80% target utilization, the optimal configuration shifts to 170,000 m³ vessels, achieving 84.9% average utilization with significantly reduced variability (3.6% standard deviation versus 15.8% unconstrained). The research validates MILP optimality for medium-scale instances while establishing metaheuristic alternatives for larger operational deployments.

Authors

Institutions

Publication Details

Journal
Jurnal Locus Penelitian dan Pengabdian
Published
2025-10-08
DOI
https://doi.org/10.58344/locus.v4i10.4920
Primary Topic
Maritime Transport Emissions and Efficiency
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Navigating a Greener Horizon: Route Optimization of LNG Shipping

Komarudin Komarudin, Anila Nur Sidiqa
Jurnal Locus Penelitian dan Pengabdian
Maritime Transport Emissions and Efficiency
article

Navigating a Greener Horizon: Route Optimization of LNG Shipping

Komarudin Komarudin, Anila Nur Sidiqa
article en

Abstract

This research addresses a critical gap in maritime logistics optimization by developing the first comprehensive Capacitated Vehicle Routing Problem (CVRP) framework specifically designed for Japan's domestic Liquified Natural Gas (LNG) terminal distribution network. Despite Japan being the world's second-largest LNG consumer with 37 operational terminals, no prior academic research has systematically optimized inter-terminal routing within this strategically important market. The study develops solutions using Mixed Integer Linear Programming (MILP) and Clarke-Wright Savings Algorithm to minimize operational costs while incorporating Boil-Off Gas (BOG) losses as a novel constraint in maritime CVRP formulations. Through analysis of five vessel capacity configurations (125,000-180,000 m³) across eight representative Japanese terminals, this research demonstrates that 180,000 m³ vessels achieve optimal performance with 3-vessel fleet deployment and 80.2% average utilization. When operational consistency constraints require minimum 80% target utilization, the optimal configuration shifts to 170,000 m³ vessels, achieving 84.9% average utilization with significantly reduced variability (3.6% standard deviation versus 15.8% unconstrained). The research validates MILP optimality for medium-scale instances while establishing metaheuristic alternatives for larger operational deployments.

Jurnal Locus Penelitian dan PengabdianVol. 4(10)
University of Indonesia (ID)
Openalex Percentile: Top 74%
Maritime Transport Emissions and Efficiency
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.