Garuda - Garba Rujukan Digital

Pengembangan Algoritma Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS) untuk penyelesaian kasus Vehicle Routing Problem with Time Windows (VRPTW) Iswari, Titi
Jurnal Rekayasa Sistem Industri Vol 6, No 1 (2017): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

Determining the vehicle routing is one of the important components in existing logistics systems. It is because the vehicle route problem has some effect on transportation costs and time required in the logistics system. In determining the vehicle routes, there are some restrictions faced, such as the maximum capacity of the vehicle and a time limit in which depot or customer has a limited or spesific opening hours (time windows). This problem referred to Vehicle Routing Problem with Time Windows (VRPTW). To solve the VRPTW, this study developed a meta-heuristic method called Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS). HRSA-VNS algorithm is a modification of Simulated Annealing algorithm by adding a restart strategy and using the VNS algorithm scheme in the stage of finding neighborhood solutions (neighborhood search phase). Testing the performance of HRSA-VNS algorithm is done by comparing the results of the algorithm to the Best Known Solution (BKS) and the usual SA algorithm without modification. From the results obtained, it is known that the algorithm perform well enough in resolving the VRPTW case with the average differences are -2.0% with BKS from Solomon website, 1.83% with BKS from Alvarenga, and -2.2% with usual SA algorithm without any modifications.Keywords : vehicle routing problem, time windows, simulated annealing, VNS, restart

Pengembangan Model Blood Mobile Collection Routing Problem (BMCRP) pada Proses Pengumpulan Darah Iswari, Titi; Setiawan, Fran; Sitompul, Carles
Jurnal Rekayasa Sistem Industri Vol 7, No 2 (2018): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

This research develop a model of blood mobile collection using blood donor vehicle efficiently by determining the optimal route of blood collection to the points of blood collection. The model developed in the form of mixed integer nonlinear programming (MINLP) and this model is called Blood Mobile Collection Routing Problem (BMCRP). The purpose of this model is to minimize the total distance of the blood collection routing process in which each place of blood collection has the opening hours and the closing time (time windows) and the service time in each place. This study considers the blood age (spoilage time) for 6 hours to ensure blood quality. The mathematical model is then verified to determine whether the solution is in accordance with the characteristics of BMCRP. Verification is done by solving Blood Mobile Collection Routing small cases. The simulation of solving BMCRP is done by generating eight hypothetical data sets of small cases based on vehicle routing data problems with different characteristics. Verification of BMCRP uses LINGO software. From the simulation results, the BMCRP model can obtain optimal solutions with minimum total distance travelled and does not violate any constraints on BMCRP.

Pengembangan Algoritma Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS) untuk penyelesaian kasus Vehicle Routing Problem with Time Windows (VRPTW) Titi Iswari
Jurnal Rekayasa Sistem Industri Vol. 6 No. 1 (2017): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

Determining the vehicle routing is one of the important components in existing logistics systems. It is because the vehicle route problem has some effect on transportation costs and time required in the logistics system. In determining the vehicle routes, there are some restrictions faced, such as the maximum capacity of the vehicle and a time limit in which depot or customer has a limited or spesific opening hours (time windows). This problem referred to Vehicle Routing Problem with Time Windows (VRPTW). To solve the VRPTW, this study developed a meta-heuristic method called Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS). HRSA-VNS algorithm is a modification of Simulated Annealing algorithm by adding a restart strategy and using the VNS algorithm scheme in the stage of finding neighborhood solutions (neighborhood search phase). Testing the performance of HRSA-VNS algorithm is done by comparing the results of the algorithm to the Best Known Solution (BKS) and the usual SA algorithm without modification. From the results obtained, it is known that the algorithm perform well enough in resolving the VRPTW case with the average differences are -2.0% with BKS from Solomon website, 1.83% with BKS from Alvarenga, and -2.2% with usual SA algorithm without any modifications.Keywords : vehicle routing problem, time windows, simulated annealing, VNS, restart

Pengembangan Model Blood Mobile Collection Routing Problem (BMCRP) pada Proses Pengumpulan Darah Titi Iswari; Fran Setiawan; Carles Sitompul
Jurnal Rekayasa Sistem Industri Vol. 7 No. 2 (2018): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

This research develop a model of blood mobile collection using blood donor vehicle efficiently by determining the optimal route of blood collection to the points of blood collection. The model developed in the form of mixed integer nonlinear programming (MINLP) and this model is called Blood Mobile Collection Routing Problem (BMCRP). The purpose of this model is to minimize the total distance of the blood collection routing process in which each place of blood collection has the opening hours and the closing time (time windows) and the service time in each place. This study considers the blood age (spoilage time) for 6 hours to ensure blood quality. The mathematical model is then verified to determine whether the solution is in accordance with the characteristics of BMCRP. Verification is done by solving Blood Mobile Collection Routing small cases. The simulation of solving BMCRP is done by generating eight hypothetical data sets of small cases based on vehicle routing data problems with different characteristics. Verification of BMCRP uses LINGO software. From the simulation results, the BMCRP model can obtain optimal solutions with minimum total distance travelled and does not violate any constraints on BMCRP.

Sequential Routing-Loading Algorithm for Optimizing One-Door Container Closed-Loop Logistics Operations Paulina Kus Ariningsih; Titi Iswari; Kevin Djoenneady Poetra; Yoon Mac Kinley Aritonang
Jurnal Optimasi Sistem Industri Vol. 19 No. 2 (2020): Published in November 2020
Publisher : The Industrial Engineering Department of Engineering Faculty at Universitas Andalas

One-door container type of vehicle is the main tool for urban logistics in Indonesia which may take the form of truck, car, or motorcycle container. The operations would be more effective when it is performed through pickup-delivery or forward-reverse at a time. However, there is difficulty to optimize the operation of routing and container loading processes in such a system. This article is proposing an improvement for algorithm for sequential routing- loading process which had been tested in the small datasets but not yet tested in the case of big data set and vehicle routing problem with time windows. The improvement algorithm is tested in big data set with the input of the vehicle routing problem with time windows (VRP-TW) using the solution optimization of the Simulated Annealing process with restart point procedure (SA-R) for the routing optimization and Genetic Algorithm (GA) to optimize the container loading algorithm. The large data sets are hypothetical generated data for 800-2500 single-sized products, 4 types of container capacity, and 100-400 consumer spots. As result, the performance of the proposed algorithm in terms of cost is influenced by the number of spots to be visited by the vehicle and the vehicle capacity. Limitations and further analysis are also described in this article.

Proposing an Algorithm to Solve the Forward and Reverse Logistics Distribution Problem with One Door Container Stephen Sanjaya Budi; Paulina Kus Ariningsih; Titi Iswari
Jurnal Teknik Industri Vol. 21 No. 1 (2019): June 2019
Publisher : Institute of Research and Community Outreach - Petra Christian University

Forward and reverse logistics are two types of distribution methods that shall be synergized in practices. Two problems in synergizing the two distributions type are (1) how to route vehicles and (2) how to pack the goods inside the vehicle. A truck with only one door for loading and unloading process could create numerous problems of item packing activities. An item picked up from a customer could occasionally block other goods which need to be delivered; hence, the courier shall unload other items before the loading process. This condition will increase the probability of item damage, longer on-loading/off-loading (lo/lo) time, and higher lo/lo cost because of the rapid item movement. Therefore, this article aims to propose an algorithm to solve the problem by creating an algorithm hybrid of routing and packing to find the solution for routing and packing problem, sequentially, with a metaheuristic approach. The proposed method calculates the cost from routing procedure and sum of item movement in every loading and unloading process. Based on the trial on 25 cases, this algorithm generates 59.64% of the containers have zero goods repacking. Several potential future research avenues are also proposed in this article.

Title

Found 6 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 6 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 6 Documents
Search