Article Per Year (5 Year)
p-Index From 2020 - 2025
1.286
P-Index
This Author published in this journals
All Journal Infotech Journal Jurnal Sistem dan Manajemen Industri Unistek: Jurnal Pendidikan dan Aplikasi Industri Jurnal Manajemen Transportasi & Logistik (JMTRANSLOG) JESCEE- Journal of Emerging Supply Chain, Clean Energy, and Process Engineering
Ruswandi, Nanda
Unknown Affiliation
Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering Mechanical Engineering Transportation Other

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

Found 2 Documents
Search
Journal : Jurnal Sistem dan Manajemen Industri

 1 
Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution Redi, Anak Agung Ngurah Perwira; Maula, Fiki Rohmatul; Kumari, Fairuz; Syaveyenda, Natasha Utami; Ruswandi, Nanda; Khasanah, Annisa Uswatun; Kurniawan, Adji Chandra
Jurnal Sistem dan Manajemen Industri Vol. 4 No. 1 (2020)
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30656/jsmi.v4i1.2215

Abstract

This study aims to find a set of vehicles routes with the minimum total transportation time for pharmaceutical distribution at PT. XYZ in West Jakarta. The problem is modeled as the capacitated vehicle routing problem (CVRP). The CVRP is known as an NP-Hard problem. Therefore, a simulated annealing (SA) heuristic is proposed. First, the proposed SA performance is compared with the performance of the algorithm form previous studies to solve CVRP. It is shown that the proposed SA is useful in solving CVRP benchmark instances. Then, the SA algorithm is compared to a commonly used heuristic known as the nearest neighborhood heuristics for the case study dataset. The results show that the simulated Annealing and the nearest neighbor algorithm is performing well based on the percentage differences between each algorithm with the optimal solution are 0.03% and 5.50%, respectively. Thus, the simulated annealing algorithm provides a better result compared to the nearest neighbour algorithm. Furthermore, the proposed simulated annealing algorithm can find the solution as same as the exact method quite consistently. This study has shown that the simulated annealing algorithm provides an excellent solution quality for the problem.
Implementasi Algoritma Discrete Particle Swarm Optimization Pada Permasalahan CVRP Aisyahna Nurul Mauliddina; Nagari, Adesatya Lentera; Redi, Anak Agung Ngurah Perwira; Kurniawan, Adji Candra; Ruswandi, Nanda; Faris Ahmad Saifuddin
Jurnal Sistem dan Manajemen Industri Vol. 4 No. 2 (2020)
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30656/jsmi.v4i2.2607

Abstract

Capacitated Vehicle Routing Problem (CVRP) is known as an NP-hard problem. It is because CVRP problems are very hard for finding optimal solutions, especially in large instances. In general, the NP-hard problem is difficult to solve in the exact method, so the metaheuristic approach is implemented in the CVRP problem to find a near-optimal solution in reasonable computational time. This research uses the DPSO algorithm for solving CVRP with ten instances of benchmark datasets. DPSO implementation uses tuning parameters with the One Factor at Time (OFAT) method to select the best DPSO parameters. The outcome objective function will be compared with several PSO models proposed in previous studies. Statistical test using One Way Reputed Measure ANOVA is needed to compare algorithm performance. First, ANOVA uses for comparing’s results. Then, ANOVA is also used to test DPSO’s performance compared with DPSO-SA, SR-1, and SR-2 algorithm. The computational result shows that the basic DPSO algorithm not competitive enough with other methods for solving CVRP.
Co-Authors Aisyahna Nurul Mauliddina Anak Agung Ngurah Perwira Redi Apriliani, Dea Nurfirda Dianisa, Pramesti Adwinda Faris Ahmad Saifuddin Febriyani Hutasuhut, Dhian Herlina, Rohma Ievana Febrianty Rumalutur, Yizri Inca Liperda, Rahmad Khasanah, Annisa Uswatun Kumari, Fairuz Kurniawan, Adji Candra Kurniawan, Adji Chandra Liperda, Rahmad Inca Lusiani, Mirna Maula, Fiki Rohmatul Nagari, Adesatya Lentera Putri Fadillah, May Ramdhani A., A Nur Shafirah Sandi, Evelyn Sukarno, Iwan Suri, Faras Karningtia Syaveyenda, Natasha Utami