Article Per Year (5 Year)
p-Index From 2019 - 2024
2.766
P-Index
This Author published in this journals
All Journal Unisda Journal of Mathematics and Computer Science (UJMC) J-SAKTI (Jurnal Sains Komputer dan Informatika) TESLA: Jurnal Teknik Elektro Energy : Jurnal Ilmiah Ilmu-Ilmu Teknik JPPM (Jurnal Pengabdian dan Pemberdayaan Masyarakat) Jurnal Pengabdian Masyarakat (ABDIRA) J-SAKTI (Jurnal Sains Komputer dan Informatika) TEKIBA : Jurnal Teknologi dan Pengabdian Masyarakat Jurnal Fortech EXPLORE INTRO : Jurnal Informatika dan Teknik Elektro Journal of Informatics Development
Ira Aprilia
Universitas Panca Marga
Aerospace Engineering Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Energy Engineering Environmental Science Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Mathematics Mechanical Engineering Nursing Public Health Social Sciences Other

Published : 20 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Unisda Journal of Mathematics and Computer Science (UJMC)

 1 
Vehicle Routing Problem by Combining Nearest Neighbour and Local Search Kurnia Iswardani; Ira Aprilia; Dwi Putri K
UJMC (Unisda Journal of Mathematics and Computer Science) Vol 9 No 1 (2023): Unisda Journal of Mathematics and Computer science
Publisher : Mathematics Department, Faculty of Mathematics and Sciences Unisda Lamongan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52166/ujmc.v9i1.4763

Abstract

PT. X is a company tasked with distributing Elpiji Gas to major agents. The problem under study is to find a more optimal distribution route so it can maximize the use of other resources, for example the number of trucks used. This distribution problem will be solved by a combination two methods, Nearest Neighbor and Local Search with the hope of getting the shortest route. The way the Nearest Neighbor method works is selecting the Agent's location based on the shortest distance from the last location and improving the solution using Local Search (intra-route insertion (1-0)) by moving one customer's position in one route so that a good distribution route is produced
Co-Authors Aan Priyadi Achmad Arif Nurohim Ahmad Izzuddin Andika Hidayatullah Andrik Sunyoto Anggy Febriany Anud Wijaya Ary Analisa Rahma Bangun Samudra Dani Hari Tunggal Prasetiyo Dwi Putri K Dwi Putri Kartini Dyah Ariyanti Dyah Aryanti Faisol Affandi Hermin Arista Imam Marzuki Indah Noor Dwi Kusuma Dewi Indro Wicaksono Kurnia Iswardani Linda Kurnia Supraptiningsih M. Fathuddin Noor Maryamah Maryamah Mas Ahmad Baihaqi Misdiyanto M Misdiyanto Misdiyanto Misdiyanto Misdiyanto Muhammad Anas Nuzul Hikmah Rendy Widi Susanto Rio Dwi Heri K Wafa Tajul Arifin Bisri Yanuar Ramadhan Yustina Suhandini T