Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation

Abstract

This paper considers a generalization of a bi-objective dial-a-ride problem, incorporating real-life characteristics of patient transportation. It studies the impact of combination restrictions, preventing particular user combinations and limiting the set of drivers to which particular users can be assigned. The academic literature currently lacks insights into the effect of these restrictions on the cost structure of a service provider. A multi-directional local search algorithm is developed to solve this problem, taking into account the fundamental tradeoff between operational efficiency and service quality. Local search is integrated into a variable neighborhood descent framework that applies an intelligent candidate list principle to reduce computation time. Moreover, a new scheduling procedure is proposed, constructing time schedules that minimize total user ride time. It proves faster and more efficient than existing scheduling procedures. Overall, computational experiments on existing benchmark data extended with combination restrictions reveal a general pattern in the effect of the combination restrictions. Such insights are essential for service providers in order to support policy choices, e.g. related to service quality or medical education of drivers.