Article Per Year (5 Year)
p-Index From 2019 - 2024
0.408
P-Index
This Author published in this journals
All Journal BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) Milang Journal of Mathematics and Its Applications
J. JAHARUDDIN
Bogor Agricultural University
Agriculture, Biological Sciences & Forestry Computer Science & IT Control & Systems Engineering Earth & Planetary Sciences Economics, Econometrics & Finance Energy Engineering Mathematics Mechanical Engineering Physics Transportation

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

Found 1 Documents
Search
Journal : BAREKENG: Jurnal Ilmu Matematika dan Terapan

 1 
OPTIMIZING THE PROCESS OF PICK-UP AND DELIVERY WITH TIME WINDOWS USING ANT COLONY AND TABU SEARCH ALGORITHMS Imas Saumi Amalia; Toni Bakhtiar; Jaharuddin Jaharuddin
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 16 No 2 (2022): BAREKENG: Jurnal Ilmu Matematika dan Terapan
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (730.711 KB) | DOI: 10.30598/barekengvol16iss2pp651-662

Abstract

The provision of goods shuttle services sometimes faces several constraints, such as the limitation on the number of vehicles, vehicle capacity, and service time, or the vehicle used has single transport access. To avoid losses, a strategy is needed in determining the optimal route and policy for arranging goods in the vehicle especially if there are two types of goods involved. Traveling Salesman Problem and Pick-up and Delivery with Handling Costs and Time Windows (TSPPDHTW) is a model of an optimization problem that aims to minimize the total travel and goods handling costs in the goods pick-up and delivery with the constraints previously mentioned. Solving that model using the exact method requires a very long computation time so it’s not effective to be implemented in real-life. This study aims to develop a (meta)heuristic based on Ant Colony Optimization (ACO) and Tabu Search (TS) to be ACOTS to solve TSPPDHTW with reasonable computation time. The development is carried out by adding functions of clustering, evaluating constraints, cutting tours, arranging of goods, and evaluating moves on the TS, as well as modifying transition rules. The result has a deviation of about 22% and 99.99% less computational time than the exact method.
Co-Authors A. KUSNANTO A. T. WIBOWO D. NATALIA E. N. BANO Endar H. Nugrahani Eti Rohaeti Euis Aprianti F. FAHRURRAZI F. HANUM Farida Hanum H. HASANNUDIN H. HERMANSYAH I. ALDILLA Imas Saumi Amalia L. D. OKTAFIANI L. HAKIM N. AIN P. SIANTURI S. SISWANDI Sahamony, Nur Fitriyani T. BAKHTIAR Toni Bakhtiar