Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Jurnal Optimasi Sistem Industri
Kevin Djoenneady Poetra
Universitas Katolik Parahyangan
Control & Systems Engineering Decision Sciences, Operations Research & Management Engineering Industrial & Manufacturing Engineering Mechanical Engineering

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

Found 1 Documents
Search

 1 
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

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1000.68 KB) | DOI: 10.25077/josi.v19.n2.p122-132.2020

Abstract

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.
Co-Authors Iswari, Titi Paulina Kus Ariningsih, Paulina Kus Yoon Mac Kinley Aritonang