Milk Run Strategy Optimization with AnyLogistix: Chemical Product Distribution in Indonesia

This study focuses on the optimization of transportation routes for the distribution of chemical products Product X in the Jabodetabek and Karawang areas using the Transportation Optimization (TO) module in AnyLogistix software. This study uses a trial-and-error approach on the parameter "maximum number of customers in one route" to find the most optimal scenario in terms of transportation costs and distance traveled. Four scenarios are generated with different maximum numbers of customers per route, ranging from 3 to 6 customers. The results show that scenario 3, with a maximum of 5 customers per route, produces the lowest total transportation cost of IDR 36,113,000 and a total distance traveled of 12,235 km. Scenario 4, with 6 customers per route, increases transportation costs to IDR 38,808,000 due to the increase in the number of direct shipments due to distance constraints. This study highlights the importance of balancing the number of direct shipments, customer grouping, and route optimization to achieve cost efficiency. This study suggests that companies consider the use of heterogeneous vehicles and sourcing policies involving additional facilities for further optimization. Additional simulations using the simulation module (SIM) in AnyLogistix are also proposed to simulate facility costs and transportation mode selection in more detail.

Institutions

Publication Details

Journal
Journal of optimization in industrial engineering
Published
2024-10-23
DOI
https://doi.org/10.71720/joie.2025.1188023
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Milk Run Strategy Optimization with AnyLogistix: Chemical Product Distribution in Indonesia

Journal of optimization in industrial engineering
Vehicle Routing Optimization Methods
article

Milk Run Strategy Optimization with AnyLogistix: Chemical Product Distribution in Indonesia

article en

Abstract

This study focuses on the optimization of transportation routes for the distribution of chemical products Product X in the Jabodetabek and Karawang areas using the Transportation Optimization (TO) module in AnyLogistix software. This study uses a trial-and-error approach on the parameter "maximum number of customers in one route" to find the most optimal scenario in terms of transportation costs and distance traveled. Four scenarios are generated with different maximum numbers of customers per route, ranging from 3 to 6 customers. The results show that scenario 3, with a maximum of 5 customers per route, produces the lowest total transportation cost of IDR 36,113,000 and a total distance traveled of 12,235 km. Scenario 4, with 6 customers per route, increases transportation costs to IDR 38,808,000 due to the increase in the number of direct shipments due to distance constraints. This study highlights the importance of balancing the number of direct shipments, customer grouping, and route optimization to achieve cost efficiency. This study suggests that companies consider the use of heterogeneous vehicles and sourcing policies involving additional facilities for further optimization. Additional simulations using the simulation module (SIM) in AnyLogistix are also proposed to simulate facility costs and transportation mode selection in more detail.

Journal of optimization in industrial engineering
Pertamina (Indonesia) (ID), Andalas University (ID)
Industry, innovation and infrastructure
Openalex Percentile: Top 47%
Vehicle Routing Optimization Methods
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.