Melola Discovery

← Melola Discovery

Jurnal SINTA 3

OPTIMASI BIAYA OPERASIONAL PADA KRL COMMUTER LINE DENGAN PEMBERANGKATAN KERETA

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 14 No. 1 (2020) · hlm. 123–134

DOI
10.30598/barekengvol14iss1pp123-134
ISSN
2615-3017, 1978-7227
Terbit
2020-03-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng

Abstrak

Optimal trainset dispatching can reduce passenger build-up and optimize operational costs. This research aimed to create a model of trainset dispatching for each time slot with minimum operational costs so that passenger demand can be met. The parameters in this research are the number of passengers getting-on and getting-off, the availability of each type of train series, train capacity, operational costs, and time limits for using the training series during operational hours. The model was formed into integer linear programming and resolved with Lingo 11.0 software. This model is applied in one direction from Bogor station to the Jakarta Kota commuter line. Trainset dispatching is done by selecting the 8 SF, 10 SF, and 12 SF trainset types with minimum operational costs at each time slot. The optimum results obtained during operational hours need to dispatch 56 trainset trips. Due to the limitations of the study the optimum operational cost of trainset dispatched is obtained 302C.

Jaringan kolaborasi para penulis

17 penulis · 30 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
Jaharuddin JaharuddinIPB University2
Imas Saumi AmaliaIPB University1
Elfina TanIPB University1
Bib Paruhum SilalahiIPB University1
Hidayatul MayyaniIPB University1
Siti AminahIPB 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">OPTIMASI BIAYA OPERASIONAL PADA KRL COMMUTER LINE DENGAN PEMBERANGKATAN KERETA</dc:title>
	<dc:creator>Luciana, Shelen</dc:creator>
	<dc:creator>Aman, Amril</dc:creator>
	<dc:creator>Bakhtiar, Toni</dc:creator>
	<dc:description xml:lang="en-US">Optimal trainset dispatching can reduce passenger build-up and optimize operational costs. This research aimed to create a model of trainset dispatching for each time slot with minimum operational costs so that passenger demand can be met. The parameters in this research are the number of passengers getting-on and getting-off, the availability of each type of train series, train capacity, operational costs, and time limits for using the training series during operational hours. The model was formed into integer linear programming and resolved with Lingo 11.0 software. This model is applied in one direction from&amp;nbsp; Bogor station to the Jakarta Kota commuter line. Trainset dispatching is done by selecting the 8 SF, 10 SF, and 12 SF trainset types with minimum operational costs at each time slot. The optimum results obtained during operational hours need to dispatch 56 trainset trips. Due to the limitations of the study the optimum operational cost of trainset dispatched is obtained&amp;nbsp; 302C.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2020-03-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/1444</dc:identifier>
	<dc:identifier>10.30598/barekengvol14iss1pp123-134</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 14 No 1 (2020): BAREKENG: Jurnal Ilmu Matematika dan Terapan; 123-134</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol14iss1year2020</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/1444/1438</dc:relation>
</oai_dc:dc>