Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

OPTIMIZATION MODEL FOR MULTI-DEPOT ELECTRIC VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS WITH SCENARIO-BASED ANALYSIS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 4 (2025) · hlm. 2751–2764

DOI
10.30598/barekengvol19iss4pp2751-2764
ISSN
2615-3017, 1978-7227
Terbit
2025-09-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

The adoption of electric vehicles has increased due to their cost-efficiency and environmental impact. However, limited battery capacity requires careful route planning to ensure vehicles complete deliveries efficiently. This study focuses on the Multi-Depot Electric Vehicle Routing Problem with Soft Time Windows (MDEVRPSTW), where electric vehicles can depart from and return to multiple depots, while serving customers within predefined time windows that allow limited violations with penalty costs. The model is formulated using Mixed Integer Linear Programming (MILP) and solved using the exact branch-and-bound method in Lingo 20.0. Two operational scenarios are considered: (1) vehicles must return to their original depot, and (2) vehicles are allowed to return to any depot. Hypothetical data is used to simulate delivery routes with varied time windows and battery capacity constraints. Results show that both scenarios produce feasible, cost-minimizing solutions. Allowing flexible depot return (scenario 2) consistently reduces total travel cost, highlighting the practical benefit of depot flexibility in real-world logistics. This model contributes to the EV routing literature by integrating multiple depots—both fixed and flexible return options—soft time windows, and battery constraints into a single formulation. However, it assumes constant travel speeds and does not account for charging durations, which presents an opportunity for future research.

Jaringan kolaborasi para penulis

14 penulis · 23 tautan kepenulisan bersama · 3 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • IPB University
  • Bank Indonesia
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Imas Saumi AmaliaIPB University2
Shelen LucianaIPB University1
Amril AmanIPB University1
Farida HanumIPB University1
Jaharuddin JaharuddinIPB University1
Noer Azam AchsaniIPB University1
Dedi Budiman HakimIPB University1
Ferry SyarifuddinBank Indonesia1
Dominicus Savio PriyarsonoIPB University1
Siti JahrohIPB University1
Kristio RapiIPB University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">OPTIMIZATION MODEL FOR MULTI-DEPOT ELECTRIC VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS WITH SCENARIO-BASED ANALYSIS</dc:title>
	<dc:creator>Tan, Elfina</dc:creator>
	<dc:creator>Bakhtiar, Toni</dc:creator>
	<dc:creator>Jaharuddin, Jaharuddin</dc:creator>
	<dc:description xml:lang="en-US">The adoption of electric vehicles has increased due to their cost-efficiency and environmental impact. However, limited battery capacity requires careful route planning to ensure vehicles complete deliveries efficiently. This study focuses on the Multi-Depot Electric Vehicle Routing Problem with Soft Time Windows (MDEVRPSTW), where electric vehicles can depart from and return to multiple depots, while serving customers within predefined time windows that allow limited violations with penalty costs. The model is formulated using Mixed Integer Linear Programming (MILP) and solved using the exact branch-and-bound method in Lingo 20.0. Two operational scenarios are considered: (1) vehicles must return to their original depot, and (2) vehicles are allowed to return to any depot. Hypothetical data is used to simulate delivery routes with varied time windows and battery capacity constraints. Results show that both scenarios produce feasible, cost-minimizing solutions. Allowing flexible depot return (scenario 2) consistently reduces total travel cost, highlighting the practical benefit of depot flexibility in real-world logistics. This model contributes to the EV routing literature by integrating multiple depots—both fixed and flexible return options—soft time windows, and battery constraints into a single formulation. However, it assumes constant travel speeds and does not account for charging durations, which presents an opportunity for future research.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17724</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss4pp2751-2764</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application; 2751-2764</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss4year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17724/11102</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Elfina Tan, Toni Bakhtiar, Jaharuddin Jaharuddin</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>