Open AccessSimulated annealing algorithm for solving pickup and delivery problem with LIFO, time duration and limited vehicle number
Author(s) -
Andriansyah Andriansyah,
Nissa Prasanti,
Hasan Yudhi Sastra
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/697/1/012021
Subject(s) - pickup , fifo and lifo accounting , simulated annealing , duration (music) , algorithm , computer science , mathematical optimization , mathematics , fifo (computing and electronics) , artificial intelligence , physics , acoustics , computer hardware , image (mathematics)
Nowadays, the process of delivering goods or documents from one place to another can be done faster by utilizing a courier service. This courier must be able to create a travel route to pick goods and deliver them with a short time. Route creation will be more difficult if there is a time window for each customer and the goods being transported are heavy or dangerous items. In this case, the courier company must implement a last-in-first-out rules. In addition, with the limitation of vehicles number, companies have to minimize the number of underserved customers. This problem called pickup and delivery problem with last-in-first-out, time duration, and limited vehicle number. In this study, to solve the problem, simulated annealing algorithm was used for some dataset. To explore the solution space for the problem, this algorithm will use pair relocation operator. In several experiments, the results show a good solution and short computation time.