Penerapan Algoritma Sweep dan Particle Swarm Optimization (PSO) sebagai Alternatif Menentukan Rute Distribusi
One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has im...
Saved in:
Published in | Faktor exacta $b (Online) Vol. 16; no. 4 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
08.01.2024
|
Online Access | Get full text |
Cover
Loading…
Abstract | One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has implications for shorter travel times and lower costs. This research adapts the Capacitated Vehicle Routing Problem (CVRP) model with the approach of sweep and Particle Swarm Optimization (PSO) algorithm to determine the route. To generate a comparison route, we use the Nearest Neighbor (NN) algorithm. The result was that 100 agents were divided into 6 clusters and the total distance of the PSO-generated route is 218.115 units or 85.70% of the route distance generated by Nearest Neighbor algorithm . |
---|---|
AbstractList | One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has implications for shorter travel times and lower costs. This research adapts the Capacitated Vehicle Routing Problem (CVRP) model with the approach of sweep and Particle Swarm Optimization (PSO) algorithm to determine the route. To generate a comparison route, we use the Nearest Neighbor (NN) algorithm. The result was that 100 agents were divided into 6 clusters and the total distance of the PSO-generated route is 218.115 units or 85.70% of the route distance generated by Nearest Neighbor algorithm . |
Author | Wardani, Imaniah Bazlina Fauzi, Ilham Saiful Puspitasari, Peni Putra, Indra Lukmana |
Author_xml | – sequence: 1 givenname: Ilham Saiful surname: Fauzi fullname: Fauzi, Ilham Saiful – sequence: 2 givenname: Imaniah Bazlina surname: Wardani fullname: Wardani, Imaniah Bazlina – sequence: 3 givenname: Indra Lukmana surname: Putra fullname: Putra, Indra Lukmana – sequence: 4 givenname: Peni surname: Puspitasari fullname: Puspitasari, Peni |
BookMark | eNqljz1PwzAURS1UJAL0P5gNhgTbCWk9IqBiQY0oQzfrNbxUpokTPTt8_XqsiIGd6Ur36lzpnLKZ6x0ydiFFlgutl9cNHEJP-Al1gOxdlrbI5FKX6ogl6kaoNM_1dsYSqRc6VYtye8Lm3r8JIZQqSiGKhHUVOiQYwPHbdt-TDR3wzQfiwF9jVwEFW7cYK6COr4dgO_sNwfaOX1ab9RX3uIM92EgHJBeXhj_FSxfGQ-Sfx4D83vpAdjd6e86OG2g9zn_zjOnVw8vdY1pT7z1hYwayHdCXkcJMiuavopkUzaSY_4f9AUj9Zvw |
ContentType | Journal Article |
DBID | AAYXX CITATION |
DOI | 10.30998/faktorexacta.v16i4.18962 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | CrossRef |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science |
EISSN | 2502-339X |
ExternalDocumentID | 10_30998_faktorexacta_v16i4_18962 |
GroupedDBID | AAYXX ADBBV ALMA_UNASSIGNED_HOLDINGS BCNDV CITATION GROUPED_DOAJ M~E |
ID | FETCH-crossref_primary_10_30998_faktorexacta_v16i4_189623 |
ISSN | 1979-276X |
IngestDate | Fri Aug 23 03:01:39 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-crossref_primary_10_30998_faktorexacta_v16i4_189623 |
ParticipantIDs | crossref_primary_10_30998_faktorexacta_v16i4_18962 |
PublicationCentury | 2000 |
PublicationDate | 2024-01-08 |
PublicationDateYYYYMMDD | 2024-01-08 |
PublicationDate_xml | – month: 01 year: 2024 text: 2024-01-08 day: 08 |
PublicationDecade | 2020 |
PublicationTitle | Faktor exacta $b (Online) |
PublicationYear | 2024 |
SSID | ssj0002246004 ssib044736727 |
Score | 4.5939612 |
Snippet | One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage... |
SourceID | crossref |
SourceType | Aggregation Database |
Title | Penerapan Algoritma Sweep dan Particle Swarm Optimization (PSO) sebagai Alternatif Menentukan Rute Distribusi |
Volume | 16 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dT9swELc6kKa9jLExwRiTJ_HAFKVrE-fDj7CBYGKAVKb1LXKcBKI2BZVkm_qP8e9x57iJQaABL1bkKCfH98vd-XIfhGzGvhSuz_u2HwaBzXwZ24LLFL74zEtEJmUg0TXw88jf_8V-DL1hp3NtRC1VZdyVs3vzSp7DVZgDvmKW7BM42xCFCbgG_sIIHIbxUTw-UTWj4Xu2tsdnF3DML4Q1-Juml1aCsk0_AVNiWljHIBwKnXWJduXJ4BhdAldpLM5EDhS0azDDSFdURSP07mMYwXcsrptju0rTlN0ToxLLhf8TshRAkMV3S5fqKo_VTEUMHIzPRWENRJ61sYi_AZ91UynrAAtxiHNrR8zGuqW3EtlVqTohgSBLpsI6rEYYb9veVV1PrkSdLw_7kZtuDIcpN4YpeXnAbSdQbQ1BMak5MM8c23X58Ja49g1Ysvu0gAtWL6Y2ZGof6m3o_un7Oev2Q66F_63K23c0YhOnCCckRSwySUWKVKRIvSCLTsA9zzjLgyBjLHDxD3fj7MOqfb1eHeGgX_Ml-Txf6teHFmrYSobRc_qGvNanFbpdA2mZdNLJW7I07wRCtWJ4R4oGibRBIlVIpMBfOkciVUikJhLpFuDwC9UopC0KaYtCiiikLQpXCN_bPf22b8-XHV3WNVOi_-6k-54sTC4m6SqhvMcDj8dZBlYVk6EMHZ6ypB8mzMPIYWeNOE-n_-E5D62TVy1WP5KFclqlG2CElvEnxfAbyC6Ryg |
link.rule.ids | 315,786,790,870,27955,27956 |
linkProvider | Directory of Open Access Journals |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Penerapan+Algoritma+Sweep+dan+Particle+Swarm+Optimization+%28PSO%29+sebagai+Alternatif+Menentukan+Rute+Distribusi&rft.jtitle=Faktor+exacta+%24b+%28Online%29&rft.au=Fauzi%2C+Ilham+Saiful&rft.au=Wardani%2C+Imaniah+Bazlina&rft.au=Putra%2C+Indra+Lukmana&rft.au=Puspitasari%2C+Peni&rft.date=2024-01-08&rft.issn=1979-276X&rft.eissn=2502-339X&rft.volume=16&rft.issue=4&rft_id=info:doi/10.30998%2Ffaktorexacta.v16i4.18962&rft.externalDBID=n%2Fa&rft.externalDocID=10_30998_faktorexacta_v16i4_18962 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1979-276X&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1979-276X&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1979-276X&client=summon |