Login
Section Innovation in Industrial Engineering

Clarke and Wright Green Vehicle Routing Minimizes Costs Emissions and Distance


Metode Perutean Kendaraan Ramah Lingkungan Clarke dan Wright Meminimalkan Biaya, Emisi, dan Jarak
Vol. 27 No. 4 (2026): October:

Laila Widyaiswara Sukardi (1), Farida Pulansari (2)

(1) Program Studi Teknik Industri, Universitas Pembangunan Nasional “Veteran” Jawa Timur, Indonesia
(2) Program Studi Teknik Industri, Universitas Pembangunan Nasional “Veteran” Jawa Timur, Indonesia
Fulltext View | Download

Abstract:

General Background: Distribution activities in supply chains require efficient route planning to reduce operational challenges related to distance, fuel consumption, costs, emissions, and driver burden. Specific Background: Distribution activities for Starpack products were carried out using routes that were not yet optimal, resulting in increased distribution costs, fuel consumption, carbon emissions, and driver workload. Knowledge Gap: Previous studies applying Green Vehicle Routing Problem (GVRP) mainly focused on economic and environmental aspects, while social aspects in distribution route evaluation received limited attention. Aims: This study aims to determine optimal distribution routes for Starpack products using the Green Vehicle Routing Problem approach within Sustainable Supply Chain Management (SSCM). Results: The study applies the Sweep algorithm for customer clustering and the Clarke & Wright Saving algorithm for route construction. The selected Clarke & Wright Saving algorithm generates four distribution routes compared with eight existing company routes and five routes from the Sweep algorithm. The selected method produces 11,250 km/month travel distance, 2,289.75 liters/month fuel consumption, IDR 47,070,300/month distribution operating costs, and 6,089.19 kg CO₂/month carbon emissions with the lowest driver distribution burden. Novelty: This research integrates economic, environmental, and social evaluations through Triple Bottom Line considerations in GVRP implementation. Implications: The study provides an approach for supporting sustainable distribution route planning within SSCM implementation.


Highlights:



  • Clarke & Wright Saving algorithm produces four distribution routes from the evaluated methods.

  • Distribution evaluation incorporates economic, environmental, and social aspects.

  • The proposed route planning reduces distribution distance, fuel requirements, and carbon emissions.


Keywords: Green Vehicle Routing Problem (GVRP), Clarke & Wright Saving Algorithm, Sweep Algorithm, Sustainable Supply Chain Management, Distribution Route.

Downloads

Download data is not yet available.

References

P. Lestari, A. Hasibuan, and B. Harahap, “Analisis Penentuan Rute Distribusi menggunakan Metode Nearest Neighbor di PT Medan Juta Rasa Tanjung Morawa,” Factory: Jurnal Industri, Manajemen dan Rekayasa Sistem Industri, vol. 1, no. 1, pp. 26–32, 2022, doi: 10.56211/factory.v1i1.110.

K. A. Maulana and A. Emaputra, “Penentuan Jalur Distribusi Gas LPG dengan Metode Savings Matrix dan Nearest Neighbor pada PT XYZ,” Jurnal Rekayasa Industri (JRI), vol. 4, no. 2, pp. 94–103, 2022, doi: 10.37631/jri.v4i2.634.

E. Shekarian, B. Ijadi, A. Zare, and J. Majava, “Sustainable Supply Chain Management: A Comprehensive Systematic Review of Industrial Practices,” Sustainability, vol. 14, no. 13, Art. no. 7892, 2022, doi: 10.3390/su14137892.

A. B. Carroll, J. A. Brown, and A. K. Buchholtz, Business & Society: Ethics, Sustainability, and Stakeholder Management, 10th ed. Boston, MA, USA: Cengage Learning, 2017.

I. N. Pujawan and E. R. Mahendrawathi, Supply Chain Management, 4th ed. Yogyakarta, Indonesia: Andi, 2024.

J.-F. Cordeau, G. Laporte, and S. Ropke, “Vehicle Routing Problems,” in Handbook of Transportation Science, P. M. Pardalos and M. G. C. Resende, Eds. Cham, Switzerland: Springer, 2016.

H. Zhang, H. Ge, J. Yang, and Y. Tong, “Review of Vehicle Routing Problems: Models, Classification and Solving Algorithms,” Archives of Computational Methods in Engineering, vol. 29, no. 1, pp. 195–221, 2022, doi: 10.1007/s11831-021-09574-x.

K. Erdogdu and K. Karabulut, “Bi-Objective Green Vehicle Routing Problem,” International Transactions in Operational Research, vol. 29, no. 3, pp. 1602–1626, 2022, doi: 10.1111/itor.13044.

R. Arifian and F. Pulansari, “Determination of the Shortest Distribution Routes to Minimize Fuel Consumption and CO₂ Emission Using Sweep and Clarke & Wright Saving Algorithms,” Indonesian Journal of Industrial Engineering & Management (IJIEM), vol. 4, no. 2, pp. 146–156, 2023, doi: 10.22441/ijiem.v4i2.20493.

A. Setiawan, S. W. Nensi, N. C. Rizani, T. Y. B. Matutina, and K. Hamidi, “Optimasi Pemilihan Rute Terpendek Distribusi Gas LPG 3 Kg Menggunakan Algoritma Sweep Berbasis Python,” JISI: Jurnal Integrasi Sistem Industri, vol. 12, no. 2, pp. 235–248, 2025, doi: 10.24853/jisi.12.2.235-248.

P. Oktaviani, I. Permata Dalnis, and E. Wirdianto, “Usulan Rute Pendistribusian Gas LPG Menggunakan Algoritma Dijkstra dan Algoritma Genetika pada Model CGVRP,” Jurnal Rekayasa Sistem Industri, vol. 14, no. 1, pp. 131–145, 2025, doi: 10.26593/jrsi.v14i1.8491.131-145.

I. S. Fauzi, I. B. Wardani, I. L. Putra, and P. Puspitasari, “Penerapan Algoritma Sweep dan Particle Swarm Optimization (PSO) sebagai Alternatif Menentukan Rute Distribusi,” Faktor Exacta, vol. 16, no. 4, pp. 264–273, 2023, doi: 10.30998/faktorexacta.v16i4.18962.

D. Ariyanto and Suseno, “Optimalisasi Penentuan Rute Distribusi Roti Bakar Dengan Metode Saving Matrix Dan Algoritma Nearest Neighbor Pada Pabrik Roti Bakar Azhari,” Jurnal Ilmiah Teknik Industri dan Inovasi, vol. 2, no. 1, pp. 1–11, 2024, doi: 10.59024/jisi.v2i1.494.

H. Sekarningtyas, I. Faza, and R. Kafidzin, “Penentuan Jumlah dan Rute Kendaraan untuk Distribusi Tabung Oksigen (O₂) Wilayah Jawa Timur dengan Algoritma Clarke and Wright Savings pada PT GCS,” Juremi: Jurnal Riset Ekonomi, vol. 3, no. 2, pp. 219–226, 2023, doi: 10.53625/juremi.v3i2.6492.

A. Gunawan, Pengantar Logistics & Supply Chain. Bandung, Indonesia: Indonesia Emas Group, 2025.