Abstract
This work presents an improved model to solve the non-emergency patients transport (NEPT) service issues given the new rules recently established in Portugal. The model follows the same principle of the Team Orienteering Problem by selecting the patients to be included in the routes attending the maximum reduction in costs when compared with individual transportation. This model establishes the best sets of patients to be transported together. The model was implemented in AMPL and a compact formulation was solved using NEOS Server. A heuristic procedure based on iteratively solving Orienteering Problems is presented, and this heuristic provides good results in terms of accuracy and computation time. Euclidean instances as well as asymmetric real data gathered from Google maps were used, and the model has a promising performance mainly with asymmetric cost matrices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Archetti, C., Bianchessi, N., Speranza, M.G.: Optimal solutions for routing problems with profits. Discrete Appl. Math. 161(4), 547–557 (2013)
Archetti, C., Speranza, M.G., Vigo, D.: Vehicle routing problems with profits. Technical Report WPDEM2013/3, University of Brescia (2013)
ARSN (2011). http://portal.arsnorte.min-saude.pt/portal/page/portal/ARSNorte
Begur, S.V., Miller, D.M., Weaver, J.R.: An integrated spatial DSS for scheduling and routing home-health-care nurses. Interfaces 27(4), 35–48 (1997)
Bellamy, G.R., Stone, K., Richardson, S.K., Goldsteen, R.L.: Getting from here to there: evaluating West Virginia’s rural nonemergency medical transportation program. J. Rural Health 19(S5), 397–406 (2003)
Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8–15 (2010)
Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21(1), 101–111 (1994)
Chao, I., Golden, B.L., Wasil, E.A.: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88(3), 475–489 (1996)
Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29–46 (2007)
Czyzyk, J., Mesnier, M.P., Moré, J.J.: The NEOS server. IEEE J. Comput. Sci. Engrg. 5, 68–75 (1998)
Díaz-Parra, O., Ruiz-Vanoye, J.A., Bernábe Loranca, B., Fuentes-Penna, A., Barrera-Cámara, R.A.: A survey of transportation problems. J. Appl. Math. vol. 2014, Article ID 848129, p. 17 (2014). doi:10.1155/2014/848129
Dolan, E.D.: NEOS server 4.0 administrative guide. Technical Memorandum ANL/MCS-TM-250, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2001)
DRE (2011). Despacho n.º 16843/2011, Diário da República, 2.ª série — N.º 239 — 15 de Dezembro de 2011, 48767–48768 (2011)
DRE (2012a). Portaria n.º 142-A/2012. Diário da República, 1.ª série — N.º 94 — 15 de maio de 2012, 2532-(2)-2532-(3) (2012)
DRE (2012b). Portaria n.º 142-B/2012. Diário da República, 1.ª série — N.º 94 — 15 de maio de 2012, 2532-(3)-2532-(6) (2012)
DRE (2012c). Declaração de Retificação n.º 27-A/2012. Diário da República, 1.ª série — N.º 107 — 1 de junho de 2012, 2928-(2) (2012)
DRE (2012d). Portaria nº178-B/2012. Diário da República, 1.ª série — N.º 107 — 1 de junho de 2012, 2928-(2) (2012)
DRE (2012e). Despacho n.º 7702-A/2012. Diário da República, 2.ª série — N.º 108 — 4 de junho de 2012, 20410-(2) (2012)
DRE (2012f). Despacho n.º 7702-C/2012. Diário da República, 2.ª série — N.º 108 — 4 de junho de 2012, 20410-(3)-20410-(6) (2012)
DRE (2012 g). Despacho nº 8705/2012. Diário da República, 2.ª série — N.º 125 — 29 de junho de 2012, 22880– 22881 (2012)
DRE (2012 h). Declaração de Retificação n.º 36/2012. Diário da República, 1.ª série — N.º 135 — 13 de julho de 2012, 3657– 3664 (2012)
Gribkovskaia, I., Laporte, G., Shyshou, A.: The single vehicle routing problem with deliveries and selective pickups. Comput. Oper. Res. 35(9), 2908–2924 (2008)
Gropp, W., Moré, J.J.: Optimization environments and the NEOS server. In: Buhmann, M.D., Iserles, A., (eds.) Approximation Theory and Optimization: Tributes to M.J.D. Powell. Cambridge University Press, Cambridge, UK, pp. 167–182 (1997)
Gutiérrez-Jarpa, G., Marianov, V., Obreque, C.: A single vehicle routing problem with fixed delivery and optional collections. IIE Trans. 41(12), 1067–1079 (2009)
Hains, I.M., Marks, A., Georgiou, A., Westbrook, J.I.: Non-emergency patient transport: what are the quality and safety issues? a systematic review. Int. J. Qual. Health Care 23(1), 68–75 (2011)
Hu, Q., Lim, A.: An iterative three-component heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 232(2), 276–286 (2014)
Labadie, N., Mansini, R., Melechovský, J.: Wolfler Calvo, R.: The team orienteering problem with time windows: an lp-based granular variable neighborhood search. Eur. J. Oper. Res. 220(1), 15–27 (2012)
Madsen, O.B., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. 60(1), 193–208 (1995)
Oliveira, J.A., Ferreira, J., Dias, L., Figueiredo, M., Pereira, G.: Non emergency patients transport - a mixed integer linear programming. In: Proceedings of 4th International Conference on Operations Research and Enterprise Systems (ICORES 2015), Lisboa, Portugal, ISBN 978-989-758-075-8, pp. 262–269 (2015)
Psaraftis, H.N.: Dynamic vehicle routing problems. In: Vehicle Routing: Methods and studies, vol. 16, pp. 223–248 (1988)
Safaei, J.: A ride to care–a non-emergency medical transportation service in rural British Columbia. Rural Remote Health 11(2), 1637 (2011)
Stiver, H.G., Trosky, S.K., Cote, D.D., Oruck, J.L.: Self-administration of intravenous antibiotics: an efficient, cost-effective home care program. Can. Med. Assoc. J. 127(3), 207 (1982)
Vaisblat, A., Albert, D.: Medical non-emergency patient centered scheduling solution. New Magenta Papers, 40 (2013)
Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1–10 (2011)
Wilken, P., Ratnapradipa, D., Presley, D., Wodika, A.B.: An evaluation of the non-emergency medical transportation system of rural southern illinois. Am. J. Health Stud. 29(2), 199–204 (2014)
Acknowledgements
This work has been partially supported by the project GATOP - Genetic Algorithms for Team Orienteering Problem (Ref PTDC/EME-GIN/120761/2010), financed by national funds by FCT/MCTES, and co-funded by the European Social Development Fund (FEDER) through the COMPETE - Programa Operacional Fatores de Competitividade (POFC) Ref FCOMP-01-0124-FEDER-020609.
This work has been partially supported by FCT – Fundação para a Ciência e Tecnologia within the Project Scope: UID/CEC/00319/2013.
The authors would like to thank the NEOS Server at the University of Wisconsin in Madison for providing support to this study.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Oliveira, J.A., Ferreira, J., Dias, L., Figueiredo, M., Pereira, G. (2015). The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem. In: de Werra, D., Parlier, G., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2015. Communications in Computer and Information Science, vol 577. Springer, Cham. https://doi.org/10.1007/978-3-319-27680-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-27680-9_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27679-3
Online ISBN: 978-3-319-27680-9
eBook Packages: Computer ScienceComputer Science (R0)