@inproceedings{30aae0ff9f12495dad284fb53f4df41f,
title = "Time Windows routing optimization for logistic service provider industry",
abstract = "The pickup \& delivery problem with time windows (PDPTW) is a common problem faced by logistics service providers when they run their business to pick and to deliver packages. The PDPTW is a non polynomial hard (NP-hard) problem which means the problem's complexity increases as the size of the problem grows. A real life problem is an NP-hard problem that very difficult to be solved with exact method. Therefore, most studies on PDPTW problem utilize metaheuristics methods that come up with a good acceptable result solved in reasonabe time. The PDPTW problem in this study that taken from is a real logistic service provider is solved by Tabu Search Algorithm (TSA). The results show that TSA gives a better solution than the existing ones. The total travel distance reduced by 147.01 km (25.23\% saving) and the total service time reduced by 215.53 minutes (12.89\% saving). This study also shows that initial solution used impacts the computational time. Clustering method gives shorter computation time than Nearest Neighbour.",
keywords = "Clustering, Nearest Neighbour, Pickup \& delivery problem with time windows, Routing problem, Tabu Search",
author = "F. Farizal and Amar Rachman and Krisnantio, \{Yohanes Wisnu\}",
note = "Publisher Copyright: {\textcopyright} 2023 Author(s).; 2021 International Summit on Education, Technology and Humanity, ISETH 2021 ; Conference date: 20-12-2021 Through 21-12-2021",
year = "2023",
month = jun,
day = "7",
doi = "10.1063/5.0141960",
language = "English",
series = "AIP Conference Proceedings",
publisher = "American Institute of Physics Inc.",
editor = "Naufal Ishartono and Yasir Sidiq and Endah Sudarmilah and Fikriyah, \{Vidya Nahdhiyatul\} and Anggono, \{Agus Dwi\}",
booktitle = "Proceedings of the International Summit on Education, Technology and Humanity 2021",
address = "United States",
}