The paper describes a system for the solution of dial a ride problem (DRP). Dial a ride problem (DRP) is to take over the passenger from a place of departure to a place of arrival. It is characterised by a set of transport demands and a number of vehicles available. The ultimate aim is to offer an alternative to displacement optimised individually and collectively. The DRP is classified as NP–hard problem that is why most research has been concentrated on the use of approximate methods to solve it. Indeed, it is a multi–criteria problem, the proposed solution of which aims to reduce both route duration, and cost in response to a certain quality of service provided. In this work, we offer our contribution to the study and solving the DRP in the application using the simulated annealing algorithm. Tests show competitive results on Cordeau and Laporte (2003) benchmark datasets while improving processing times.
Keywords: heuristics, dial–a–ride problem, DRP, multicriteria optimisation, simulated annealing, transport demand, vehicle availability, vehicle routing, scheduling, flexible transport, modelling