Ignatius A. Sandy
Jurusan Teknik Industri, Fakultas Teknologi Industri Universitas Katolik Parahyangan, Bandung

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

Found 3 Documents
Search

Penerapan Lightning Search Algorithm dengan 2-Opt Local Search untuk Penyelesaian Asymmetric Traveling Salesman Problem Gunawan, Yulius Chandra; Sandy, Ignatius A.
Jurnal Rekayasa Sistem Industri Vol. 13 No. 2 (2024): Vol. 13 No. 2 (2024): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26593/jrsi.v13i2.7760.191-202

Abstract

The Asymmetric Traveling Salesman Problem (ATSP) is an optimization problem where a "salesman" must visit several cities in a single trip. In the ATSP, the distance traveled from city i to j differs from the distance from city j to i. The goal of the ATSP is to minimize the total distance traveled by the "salesman." In this study, the Lightning Search Algorithm (LSA) and the 2-Opt local search algorithm are used to find solutions for the ATSP. LSA is a metaheuristic algorithm inspired by the process of lightning propagation to the earth's surface. 2-Opt is a local search algorithm that can manipulate routes to produce better solutions. This research aims to design LSA with 2-Opt for solving the ATSP and to identify the parameters that influence the ATSP solution. Three parameters are used in this study: maximum channel time (max_ctime) and forking probability (fork_prob), which are responsible for the forking phenomenon, and Boundaries (Bound), which define the solution space. ANOVA testing was conducted on 8 parameter combinations implemented on 5 ATSP cases from TSPLIB: BR17, FTV33, FTV44, FTV55, and FTV70 to determine the best parameter values. The ANOVA results show that the Bound parameter affects the solution in the FTV33, FTV44, and FTV70 cases, while the max_ctime parameter affects the solution in the FTV55 case. Based on the determined parameter values, the LSA with 2-Opt was re-implemented on the five ATSP cases. The results show that the LSA with 2-Opt was able to find the best-known solution for the BR17 case but was unable to find the best-known solution for the other cases.
Pengembangan Sistem Operasional Downstream Logistics dengan Modifikasi P1R2 Ariningsih, Paulina K.; Sandy, Ignatius A.; Adventia, Imanuele C. D.
Metris: Jurnal Sains dan Teknologi Vol. 17 No. 02 (2016): Desember
Publisher : Prodi Teknik Industri, Fakultas Teknik - Universitas Katolik Indonesia Atma Jaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Inaccuracy implementation of downstream logistics (DL, distribution) may decrease product quality. Quality decreament may happen due to product damange during distribution process, either duringloading-on and loading-off process, or during transportation process. Rejection product by the consumer due to quality mismatch may cause losses and non-valued added logistics activities. Integrated sistem approach for DL is proposed to minimize product damange during DL without compromising service level (SL) on the consumer. This paper describes the steps to improve DL’s operational activitiesusing management approach and modification of P1R2 algorithm (Packing First Routing Second). The final result and managerial implications of the process is formed in proposed Work Instruction (IK). The implementation of this improvement process is described using plastic furniture distribution study case of PT. X. As a result, 3 IK are produced. In addition, it is shown that proposed method can minimize non-value added logistics activities and reduce cost.
Penerapan Lightning Search Algorithm dengan 2-Opt Local Search untuk Penyelesaian Asymmetric Traveling Salesman Problem Gunawan, Yulius Chandra; Sandy, Ignatius A.
Jurnal Rekayasa Sistem Industri Vol. 13 No. 2 (2024): Vol. 13 No. 2 (2024): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26593/jrsi.v13i2.7760.191-202

Abstract

The Asymmetric Traveling Salesman Problem (ATSP) is an optimization problem where a "salesman" must visit several cities in a single trip. In the ATSP, the distance traveled from city i to j differs from the distance from city j to i. The goal of the ATSP is to minimize the total distance traveled by the "salesman." In this study, the Lightning Search Algorithm (LSA) and the 2-Opt local search algorithm are used to find solutions for the ATSP. LSA is a metaheuristic algorithm inspired by the process of lightning propagation to the earth's surface. 2-Opt is a local search algorithm that can manipulate routes to produce better solutions. This research aims to design LSA with 2-Opt for solving the ATSP and to identify the parameters that influence the ATSP solution. Three parameters are used in this study: maximum channel time (max_ctime) and forking probability (fork_prob), which are responsible for the forking phenomenon, and Boundaries (Bound), which define the solution space. ANOVA testing was conducted on 8 parameter combinations implemented on 5 ATSP cases from TSPLIB: BR17, FTV33, FTV44, FTV55, and FTV70 to determine the best parameter values. The ANOVA results show that the Bound parameter affects the solution in the FTV33, FTV44, and FTV70 cases, while the max_ctime parameter affects the solution in the FTV55 case. Based on the determined parameter values, the LSA with 2-Opt was re-implemented on the five ATSP cases. The results show that the LSA with 2-Opt was able to find the best-known solution for the BR17 case but was unable to find the best-known solution for the other cases.