A linearly decreasing deterministic annealing algorithm for the multi-vehicle dial-a-ride problem.

ABSTRACT: Dial a ride problem (DARP) is a complex version of the pick-up and delivery problem with many practical applications in the field of transportation. This study proposes an enhanced deterministic annealing algorithm for the solution of large-scale multi-vehicle DARPs. The proposed method always explores the feasible search space; therefore, a feasible solution is guaranteed at any point of termination. This method utilises advanced local search operators to accelerate the search for optimal solutions and it relies on a linearly decreasing deterministic annealing schedule to limit poor jumps during the course of search. This study puts forward a systematic series of experiments to compare the performance of solution methods from various angles. The proposed method is compared with the most e

SUBMITTER: Mortazavi A 

PROVIDER: S-EPMC10852268 | biostudies-literature | 2024

REPOSITORIES: biostudies-literature