Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

THE SAMPLE SCHEDULING APPLICATION OF THE ANT COLONY OPTIMIZATION ALGORITHM IN VEHICLE ROUTING PROBLEM TO FIND THE SHORTEST ROUTE

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 1 (2024) · hlm. 0643–0656

DOI
10.30598/barekengvol18iss1pp0643-0656
ISSN
2615-3017, 1978-7227
Terbit
2024-03-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

In this collaborative research initiative with the Research Center and Industry Standardization in Surabaya, the primary objective is to obtain Indonesian National Standard certificates through the collection of samples from companies in East Java. The focal challenge revolves around the optimization of delivery routes for vehicles with specific capacities, constituting the Vehicle Routing Problem (VRP), and is addressed through the application of the Ant Colony Optimization (ACO) algorithm. The study confronts constraints, including the limitation of time and resources during the sample collection process, and grapples with challenges associated with travel distances that impact overall efficiency. The utilization of Sample Scheduling software (Si Dull) developed in Visual Basic introduces configurational constraints for route planning with the aim of minimizing distances. The overarching aim is to implement the ACO algorithm, culminating in the development of the Si Dull application, to elevate the efficacy of the sample collection process for industrial certification in Surabaya, thereby contributing to enhanced efficiency in travel distances for sample collection endeavors

Jaringan kolaborasi para penulis

3 penulis · 2 tautan kepenulisan bersama · 2 lintas organisasi

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

  • UIN Syekh Wasil Kediri
  • Politeknik Negeri Malang
  • Bandung Institute of Technology
  • 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
A.N.M. SalmanBandung Institute of Technology1

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">THE SAMPLE SCHEDULING APPLICATION OF THE ANT COLONY OPTIMIZATION ALGORITHM IN VEHICLE ROUTING PROBLEM TO FIND THE SHORTEST ROUTE</dc:title>
	<dc:creator>Mahfudhotin, Mahfudhotin</dc:creator>
	<dc:creator>Palupi, Ratnaning</dc:creator>
	<dc:description xml:lang="en-US">In this collaborative research initiative with the Research Center and Industry Standardization in Surabaya, the primary objective is to obtain Indonesian National Standard certificates through the collection of samples from companies in East Java. The focal challenge revolves around the optimization of delivery routes for vehicles with specific capacities, constituting the Vehicle Routing Problem (VRP), and is addressed through the application of the Ant Colony Optimization (ACO) algorithm. The study confronts constraints, including the limitation of time and resources during the sample collection process, and grapples with challenges associated with travel distances that impact overall efficiency. The utilization of Sample Scheduling software (Si Dull) developed in Visual Basic introduces configurational constraints for route planning with the aim of minimizing distances. The overarching aim is to implement the ACO algorithm, culminating in the development of the Si Dull application, to elevate the efficacy of the sample collection process for industrial certification in Surabaya, thereby contributing to enhanced efficiency in travel distances for sample collection endeavors</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-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/10626</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss1pp0643-0656</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 1 (2024): BAREKENG: Journal of Mathematics and Its Application; 0643-0656</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss1year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/10626/7587</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Mahfudhotin Mahfudhotin, Ratnaning Palupi</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>