Naslov
Solving the Dial-a-Ride Problem Using an Adapted Genetic Algorithm

Autori
Zelić, Stjepan ; Đurasević, Marko ; Jakobović, Domagoj ; Planinić, Lucija

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Lecture Notes in Computer Science / - : Springer, 2022, 689-699

ISBN
978-3-031-08420-1

Skup
20th International Conference of the Italian Association for Artificial Intelligence (AIxIA 2021)

Mjesto i datum
Italija; online, 01.12.2021. - 03.12.2021

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Genetic algorithm ; Dial a ride problem ; Optimisation

Sažetak
The dial-a-ride problem (DARP) deals with the transportation of people from source to destination locations. One of the most common use cases is in the transportation of elderly or sick people, and as such it represents an important problem to consider. Since DARP is NP-hard, it most often has to be solved using various heuristic methods. Previous studies demonstrated that metaheuristics are suitable for solving this kind of problem. However, in most cases, basic metaheuristics have been considered without any adaptation to the problem, which could potentially limit their performance. Therefore, in this study a GA is proposed and several of its elements adapted for solving DARP. The obtained results show that the proposed algorithm can achieve better results than similar methods from previous studies. Moreover, the experiments demonstrate that the results can be improved by considering some constraints as soft constraints and including them in the cost function to give the algorithm more flexibility in the search.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo

POVEZANOST RADA