A planning and routing model for patient transportation in health care
Authors:
- Alberto CoppiACAlberto Coppi
- Paolo DettiPDPaolo Detti
- Jessica RaffaelliJRJessica Raffaelli
- 1 June 2013
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 41, 125-132
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windowsTransportation Research Part C: Emerging Technologies, 2011
- An Exact Algorithm for the Pickup and Delivery Problem with Time WindowsOperations Research, 2011
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraintsOR Spectrum, 2010
- Branch and Cut and Price for the Pickup and Delivery Problem with Time WindowsTransportation Science, 2009
- A dial-a-ride problem for client transportation in a health-care organizationComputers & Operations Research, 2007
- An Exact Algorithm for the Multiple Vehicle Pickup and Delivery ProblemTransportation Science, 2004
- Drive: Dynamic Routing of Independent VehiclesOperations Research, 1998
- An Integrated Spatial DSS for Scheduling and Routing Home-Health-Care NursesInterfaces, 1997
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991