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 to be 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.

[1]  Richard F. Hartl,et al.  Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..

[2]  Verena Schmid,et al.  Hybrid column generation and large neighborhood search for the dial-a-ride problem , 2013, Comput. Oper. Res..

[3]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[4]  Ron S. Kenett,et al.  Statistics for Business and Economics. , 1988 .

[5]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[6]  ZitzlerE.,et al.  Multiobjective evolutionary algorithms , 1999 .

[7]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[8]  Fabien Tricoire,et al.  Multi-directional local search , 2012, Comput. Oper. Res..

[9]  Maged Dessouky,et al.  A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .

[10]  Fabien Lehuédé,et al.  A multi-criteria large neighbourhood search for the transportation of disabled people , 2014, J. Oper. Res. Soc..

[11]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

[12]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[13]  Jacques Desrosiers,et al.  A Request Clustering Algorithm for Door-to-Door Handicapped Transportation , 1991, Transp. Sci..

[14]  Gilbert Laporte,et al.  Dynamic transportation of patients in hospitals , 2010, OR Spectr..

[15]  Richard F. Hartl,et al.  Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports , 2011, Comput. Oper. Res..

[16]  Sophie N. Parragh,et al.  A heuristic two-phase solution approach for the multi-objective dial-a-ride problem , 2009 .

[17]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[18]  Gerrit K. Janssens,et al.  Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots , 2014 .

[19]  Gilbert Laporte,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .

[20]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[21]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[22]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[23]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers , 2002 .

[24]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[25]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[26]  Paolo Detti,et al.  A planning and routing model for patient transportation in health care , 2013, Electron. Notes Discret. Math..

[27]  Jonathan F. Bard,et al.  The heterogeneous pickup and delivery problem with configurable vehicle capacity , 2013 .

[28]  Sophie N. Parragh.  Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem , 2011, Transportation research. Part C, Emerging technologies.

[29]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[30]  Gilbert Laporte,et al.  Combining multicriteria analysis and tabu search for dial-a-ride problems , 2013 .

[31]  Gilbert Laporte,et al.  Measuring quality of service in dial-a-ride operations: the case of a Canadian city , 2012 .

[32]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[33]  Gilbert Laporte,et al.  Quality of service in dial-a-ride operations , 2009, Comput. Ind. Eng..

[34]  Chengbin Chu,et al.  A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints , 2006, Eur. J. Oper. Res..