Article Per Year (5 Year)
p-Index From 2021 - 2026
2.56
P-Index
This Author published in this journals
All Journal Journal of Engineering and Management in Industrial System Infotech Journal Jurnal Sistem dan Manajemen Industri Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri JURNAL MANAJEMEN INDUSTRI DAN LOGISTIK Digital Zone: Jurnal Teknologi Informasi dan Komunikasi Jurnal Logistik Indonesia JARES (Journal of Academic Research and Sciences) Enrichment : Journal of Management Indonesian Journal of Computing, Engineering, and Design Journal of Community Services: Sustainability and Empowerment
Anak Agung Ngurah Perwira Redi
Bina Nusantara University
Arts Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Engineering Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mechanical Engineering Social Sciences Transportation Other

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

Found 20 Documents
Search

 1   2 
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.
Pemilihan Lokasi Operasi Timbang untuk fasilitas Community & Playground Center Menggunakan Model Maximum Covering Location Problem di Kota Iloilo, Filipina Redi, Anak Agung Ngurah Perwira; Flame, Roland Ross Faina; Redioka, Anak Agung Ngurah Agung; Winarno, Winarno; Kurniawan, Adji Chandra
Jurnal Sistem dan Manajemen Industri Vol. 6 No. 2 (2022): December
Publisher : Universitas Serang Raya

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

Abstract

Operation Timbang (OPT) Plus is one of the Philippines’ programs that focuses on nutrition by conducting an annual assessment for 0-59 months old children in barangays to identify the malnutrition data in the area. The barangay is the smallest administrative entity in the Philippines. OPT is a plan of action that estimates the number of malnutrition individuals and identifies those who will get prioritized programs in the community. The Iloilo City Health Office conducted the program in seven districts in the Philippines. The office planned to establish a community centre and playground facility based on the priority/demand areas. Maximum Covering Location Problem (MCLP) is used for this study to determine the optimal location that covers the area. A Mathematical Programming Language (AMPL) is used to apply mathematical programming to the MCLP. The results can be used to identify the optimal facility and the maximum coverage of the demand points. The experiment showed that the facility located in Mandurriao District is the optimal facility location. For Underweight/Severely Underweight children, a maximum total of 646 are covered, and for the Overweight/Obese, 1,041 are covered for the chosen facility. In addition, the findings of the sensitivity analysis indicate that the building of the three facilities in the case study can offer 100 percent of the required coverage area.
Tabu search heuristic for inventory routing problem with stochastic demand and time windows Maghfiroh, Meilinda Fitriani Nur; Redi, Anak Agung Ngurah Perwira
Jurnal Sistem dan Manajemen Industri Vol. 6 No. 2 (2022): December
Publisher : Universitas Serang Raya

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

Abstract

This study proposes the hybridization of tabu search (TS) and variable neighbourhood descent (VND) for solving the Inventory Routing Problems with Stochastic Demand and Time Windows (IRPSDTW). Vendor Managed Inventory (VMI) is among the most used approaches for managing supply chains comprising multiple stakeholders, and implementing VMI require addressing the Inventory Routing Problem (IRP). Considering practical constraints related to demand uncertainty and time constraint, the proposed model combines multi-item replenishment schedules with unknown demand to arrange delivery paths, where the actual demand amount is only known upon arrival at a customer location with a time limit. The proposed method starts from the initial solution that considers the time windows and uses the TS method to solve the problem. As an extension, the VND is conducted to jump the solution from its local optimal. The results show that the proposed method can solve the IRPSDTW, especially for uniformly distributed customer locations.
Mix method analysis for analyzing user behavior on logistic company mobile pocket software Persada, Satria Fadil; Afandi, Farid; Redi, Anak Agung Ngurah Perwira; Nadlifatin, Reny; Prasetyo, Yogi Tri; Kurniawan, Adji Candra
Jurnal Sistem dan Manajemen Industri Vol. 7 No. 1 (2023): June
Publisher : Universitas Serang Raya

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

Abstract

The present study emphasizes mixed-method analysis, integrating the partial least square structural equation model (PLS-SEM) and customer journey for mobile pocket office improvement in logistic XYZ company. The extension of the unified theory of acceptance and use of technology (UTAUT 2) model by incorporating perceived risk (PR), personal innovativeness (PI), and trust (TR) variables are used. The sample for this study consisted of 243 res­pondents. Based on the results of the PLS-SEM analysis, two of the eleven tested hypotheses were determined to be rejected. In application usage, the proposed model effectively explained 85.7 per cent of the influence on beha­vioral intention (BI) and 72.1 per cent on use behavior (UB). The customer journey mapping (CJM) investigation's findings show that fluctuations in the use of mobile pocket office technology in the field are generally brought on by a lot of data entry, sluggish internet connections, and overworked field operations. The XYZ company may acquire sugges­tions and knowledge for developing further applications due to this inquiry.
Enhancing Post-Disaster Mapping Assessment: Agent-Based Simulation Modeling Integrating Ground Vehicles and Drones (Case Study: Mount Merapi's Volcanic Eruption) Liperda, Rahmad Inca; Rinaldy, Ravi Prananda; Redi, Anak Agung Ngurah Perwira; Asih, Anna Maria Sri; Sopha, Bertha Maya
Jurnal Logistik Indonesia Vol. 7 No. 2: Oktober 2023
Publisher : Institut Ilmu Sosial dan Manajemen Stiami

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31334/logistik.v7i2.3463

Abstract

This research presents an agent-based simulation model for post-disaster location mapping, considering land vehicles and drones along with access road availability and depot locations. The study examines the impact of bridge facility damage on depot selection and time indicators. Results reveal that damage to bridge facilities affects depots differently based on their location, leading to increased total processing and completion times due to interactions between land vehicles and bridges. Depot 7 emerges as the optimal location for undamaged and KRB II and III damage scenarios based on total processing time. Depot 3 performs best for KRB III damage, while Depot 8 exhibits the shortest completion time across all scenarios. These findings emphasize the importance of selecting depots with resilient road access and alternative routes, improving post-disaster logistics efficiency.
Analysis of Waste Separation Drivers in Urban Centers Using the Theory of Planned Behavior and the Norm Activation Model Maghfiroh, Meilinda Fitriani Nur; Muqimuddin, Muqimuddin; Sartika, Widya; Redi, Anak Agung Ngurah Perwira; Abdallah, Bayu Nur; Hutahaean, Glenardo Antoi; Apriani, Ratna Agil
Indonesian Journal of Computing, Engineering, and Design (IJoCED) Vol. 6 No. 1 (2024): IJoCED
Publisher : Faculty of Engineering and Technology, Sampoerna University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35806/ijoced.v6i1.392

Abstract

Urban centers worldwide are grappling with complex waste management challenges, including efficient collection, transportation, processing, and an over-reliance on landfills. A promising approach to mitigate these issues lies in bolstering public participation in waste separation, which could significantly improve recycling efforts. To effectively encourage this practice, it is crucial to understand the underlying factors that motivate community engagement in waste segregation activities. This study utilizes the Theory of Planned Behavior and the Norm Activation Model to identify and analyze determinants influencing individuals' propensity to separate waste in the sampling area of Balikpapan City, Indonesia. Balikpapan, one of the cities in Indonesia, is currently facing several distinct challenges related to waste management. Through the empirical validation of eight hypotheses, it becomes apparent that the presence of market facilitators (H3) and the influence of past behavior (H5) play pivotal roles in shaping the intention to engage in waste separation. The findings suggest that providing accessible, well-maintained market facilities and initiatives designed to enrich the public's waste separation experience are essential strategies. Implementing these strategies could significantly improve waste separation practices within specific urban contexts such as Balikpapan, Indonesia, and other cities facing similar environmental management challenges.
INITIAL SOLUTION STRATEGIES FOR SIMULATED ANNEALING IN TWO-ECHELON OPEN LOCATION ROUTING PROBLEMS winarno; Redi, Anak Agung Ngurah Perwira
JEMIS (Journal of Engineering & Management in Industrial System) Vol. 13 No. 2 (2025)
Publisher : Industrial Engineering Department, Faculty of Engineering, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21776/

Abstract

Two-Echelon Open Location Routing Problem (2EOLRP) is a logistics problem model that combines two levels of distribution, namely the main distribution center (depot) and Secondary Distribution Centers (SDCs) which then serve customers. Vehicles available at the depot serve product requests from SDCs, while vehicles available at SDCs serve end customers. This paper presents a comparative analysis of two initial solution construction methods, Random Search (RS) and Nearest Neighbor Search (NNS), combined with a Simulated Annealing (SA) algorithm to solve the 2EOLRP. The quality of the starting solutions plays a key role in enhancing metaheuristic performance, including SA. We evaluate both methods based on their solution quality and computational efficiency. Benchmark datasets adapted from well-known Two-Echelon Location Routing Problem (2ELRP) instances are used for testing. The experimental results demonstrate that NNS generally provides better initial solutions leading to improved final results, while RS offers faster computational times. The findings offer valuable insights into the impact of initialization strategies on the overall performance of SA in two-echelon distribution systems.
DEVELOPMENT OF AN ENVIRONMENTALLY-FRIENDLY LOGISTICS MODEL BY INTEGRATING DECISIONS OF LOCATION, MULTI-CAPACITY VEHICLE, AND ROUTING PROBLEM Lathifah, Artya; Sulistyo, Sinta Rahmawidya; Murti, Izzawi Winda; Redi, A.A.N Perwira
JEMIS (Journal of Engineering & Management in Industrial System) Vol. 6 No. 2 (2018)
Publisher : Industrial Engineering Department, Faculty of Engineering, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21776/ub.jemis.2018.006.02.1

Abstract

Transportation and distribution are two things that are closely related to logistics problems However, on the other hand this activity can sometimes damage the environment. Emissions from fuels used in transportation and distribution activities accounted for 29.4% of the total costs incurred by the organization in their activities. From this issue many organizations finally make environmentally friendly logistics as priority in their activities, where the goal of minimizing distribution costs and maintaining sustainability of environments. Some factors that can be improved are: determination of the location depot, combination of vehicle and the route. Therefore, this study aims to develop mathematical model that optimize these three factors integration to minimize the emission cost. The results of this research are the mathematical model, optimization of the development of the Simulated Annealing (SA) method that is applied to the problem is able to get a reduction in total emissions costs up to 18.8%.
Genetic Algorithm with Cluster-first Route-second to Solve the Capacitated Vehicle Routing Problem with Time Windows : A Case Study Putri, Karina Aginta; Rachmawati, Nur Layli; Lusiani, Mirna; Redi, Anak Agung Ngurah Perwira
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 23 No. 1 (2021): June 2021
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/jti.23.1.75-82

Abstract

In a distribution problem, designing the right distribution route can minimize the total transportation costs. Therefore, this research aims to design a distribution route that produces a minimal distribution distance by clustering the demand points first. We generated the clustering method to cluster the demand points by considering the proximity among the demand points and the total vehicle capacity. In solving this problem, we are using p-median to determine the cluster and a genetic algorithm to determine the distribution route with the characteristics of the CVRPTW problem. CVRPTW or capacitated vehicle routing problem with time windows is a type of VRP problem where there is a limitation of the vehicle capacity and service time range of its demand point. This research concludes that clustering the demand points provides a better result in terms of total distribution costs by up to 16.26% compared to the existing delivery schedule. The performance of the genetic algorithm shows an average difference of 1.73%, compared to the exact or optimal method. The genetic algorithm is 89.68% faster than the exact method in the computational time.
Co-Authors Adesatya Lentera Nagari Adji Candra Kurniawan Adji Candra Kurniawan (Universitas Pertamina) Afandi, Farid Aisyahna Nurul Mauliddina Aisyahna Nurul Mauliddina Anna Maria Sri Asih Apriani, Ratna Agil Athiyyah Zhafarina (Universitas Pertamina) Bayu Nur Abdallah, Bayu Nur Bertha Maya Sopha Deasy Lastya Sari Effendi, Nabila Salsabillah Faris Ahmad Saifuddin Faris Ahmad Saifuddin Fergyanto E. Gunawan Fernandez, Nikolas Krisma Hadi Flame, Roland Ross Faina Helen Storyna Hutahaean, Glenardo Antoi Ilham Prasetyo islam, sri susilawati Iwan Setiawan Khasanah, Annisa Uswatun Kumari, Fairuz Kurniawan, Adji Candra Kurniawan, Adji Chandra Lathifah, Artya Lestari, Tika Endah Liperda, Rahmad Inca Lusiani, Mirna Maghfiroh, Meilinda Fitriani Nur Maula, Fiki Rohmatul Mirna Lusiani (Universitas Pertamina) Muhammad Asrol Muhammad Johan Alibasa Muqimuddin Muqimuddin Murti, Izzawi Winda Mustafa, Figa Wafi Mustafa Nagari, Adesatya Lentera Nanda Ruswandi Nanda Ruswandi (Universitas Pertamina) Persada, Satria Fadil Prasetyo, Yogi Tri Putri, Karina Aginta Rachmawati, Nur Layli Rafie Djajasoepena Raihan Ahmad Fadhil (Universitas Pertamina) Redioka, Anak Agung Ngurah Agung Reny Nadlifatin Ribka Intan Putri Sinaga Rinaldy, Ravi Prananda Ruswandi, Nanda Santosa, Ahmad Arif Sartika, Widya Silvester Adi Surya Herjuna Sinta Rahmawidya Sulistyo Syaveyenda, Natasha Utami Triawan, Farid Wandy Wandy WINARNO Winarno Winarno Young, Michael Nayat