Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance

Bulletin of Electrical Engineering and Informatics · Vol. 11 No. 2 (2022) · hlm. 1026–1036

DOI
10.11591/eei.v11i2.3223
ISSN
2089-3191, 2302-9285
Terbit
2022-04-01
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

One problem in collaborative pickup delivery problem (PDP) was excessive outsourced jobs. It happened in many studies on the collaborative PDP. Besides, the revenue sharing in it was unclear although important. This work aimed to propose a novel collaborative PDP model which minimizes total travel distance while maintains low outsourced jobs. It proposed several contributions. First, it prioritized internal jobs first rather than full collaborative model. Second, it proposed new revenue sharing model. It adopted cluster-first route-second and mixed pickup and delivery. It was developed by combining the genetic algorithm and nearest distance algorithm where the genetic algorithm was used in the clustering process and the nearest distance was used in the routing process. The simulation result shows that the proposed model was better than the comparing models: (1) combined K-means and genetic algorithm model (KMGA) and (2) combined simulated annealing and last-in first-out (SNLIFO) model. When the number of orders was high (300 units), the total travel distance of the proposed model was 37 percent lower than the KMGA model and 30 percent lower than the SNLIFO model. In average, the outsourcing rate of the proposed model was 70 percent lower than the previous models.

Kata kunci

Jaringan kolaborasi para penulis

18 penulis · 40 tautan kepenulisan bersama · 4 lintas organisasi

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

  • Telkom University
  • Institut Teknologi Telkom Surabaya
  • 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
Faisal Candrasyah HasibuanTelkom University6
Helmy WidyantaraInstitut Teknologi Telkom Surabaya3
Ig. Prasetya Dwi WibawaTelkom University1
Sultan Chisson ObieTelkom University1
Axel DavidTelkom University1
Panji Christoper SilalahiTelkom University1
Yohanes Yogas HerlambangTelkom University1
Muhammad Dwi HariyantoTelkom University1
Seno Adi PutraTelkom University1
Andrew Brian OsmondTelkom University1
Budhi IrawanTelkom University1
Rifqi Muhammad FikriTelkom University1
Muhammad Riyadhul Jinan NasutionTelkom University1
Faiq HaqqaniTelkom University1
Raenaldi Ardiansyah SidikTelkom University1
Ratna Astuti NugrahaeniTelkom 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: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance</dc:title><dc:creator>Purba Daru Kusuma</dc:creator><dc:creator>Meta Kallista</dc:creator><dc:subject>pickup and delivery problem</dc:subject><dc:subject>revenue sharing</dc:subject><dc:subject>cluster-first route-second</dc:subject><dc:subject>genetic algorithm</dc:subject><dc:subject>travel distance minimization</dc:subject><dc:subject>task prioritization</dc:subject><dc:description xml:lang="en">One problem in collaborative pickup delivery problem (PDP) was excessive outsourced jobs. It happened in many studies on the collaborative PDP. Besides, the revenue sharing in it was unclear although important. This work aimed to propose a novel collaborative PDP model which minimizes total travel distance while maintains low outsourced jobs. It proposed several contributions. First, it prioritized internal jobs first rather than full collaborative model. Second, it proposed new revenue sharing model. It adopted cluster-first route-second and mixed pickup and delivery. It was developed by combining the genetic algorithm and nearest distance algorithm where the genetic algorithm was used in the clustering process and the nearest distance was used in the routing process. The simulation result shows that the proposed model was better than the comparing models: (1) combined K-means and genetic algorithm model (KMGA) and (2) combined simulated annealing and last-in first-out (SNLIFO) model. When the number of orders was high (300 units), the total travel distance of the proposed model was 37 percent lower than the KMGA model and 30 percent lower than the SNLIFO model. In average, the outsourcing rate of the proposed model was 70 percent lower than the previous models.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2022-04-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v11i2.3223</dc:identifier><dc:identifier>10.11591/eei.v11i2.3223</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 11 No 2 (2022); 1026-1036</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/3223/2559</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>