Non Emergency Patients Transport - A Mixed Integer Linear Programming

José A. Oliveira, João Ferreira, Luís Dias, Manuel Figueiredo, Guilherme Pereira

Abstract

This work presents a model and a heuristic 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 problems with one vehicle was presented, and this heuristic provides good results in terms of accuracy and computation time.

References

  1. Archetti, C., Bianchessi, N., & Speranza, M. G. (2013). Optimal solutions for routing problems with profits. Discrete Applied Mathematics, 161(4), 547-557.
  2. Archetti, C., Speranza, M. G., & Vigo, D. (2013). Vehicle routing problems with profits. Tech. Report WPDEM2013/3, University of Brescia.
  3. ARSN (2011). http://portal.arsnorte.min-saude.pt/portal/ page/portal/ARSNorte.
  4. Begur, S. V., Miller, D. M., & Weaver, J. R. (1997). An integrated spatial DSS for scheduling and routing home-health-care nurses. Interfaces, 27(4), 35-48.
  5. Bellamy, G. R., Stone, K., Richardson, S. K., & Goldsteen, R. L. (2003). Getting from here to there: Evaluating West Virginia's rural nonemergency medical transportation program. The Journal of Rural Health, 19(S5), 397-406.
  6. Berbeglia, G., Cordeau, J. F., & Laporte, G. (2010). Dynamic pickup and delivery problems. European Journal of Operational Research, 202(1), 8-15.
  7. Butt, S. E., & Cavalier, T. M. (1994). A heuristic for the multiple tour maximum collection problem. Computers & Operations Research, 21(1), 101-111.
  8. Chao, I., Golden, B. L., & Wasil, E. A. (1996). A fast and effective heuristic for the orienteering problem. European Journal of Operational Research, 88(3), 475-489.
  9. Cordeau, J. F., & Laporte, G. (2007). The dial-a-ride problem: models and algorithms. Annals of Operations Research, 153(1), 29-46.
  10. Czyzyk, J., Mesnier,M. P., Moré. J. J. (1998). The NEOS server. IEEE J. Computational Sci. Engrg. 5, 68-75.
  11. Díaz-Parra, O., Ruiz-Vanoye, J. A., Bernábe Loranca, B., Fuentes-Penna, A., & Barrera-Cámara, R. A. (2014). A Survey of Transportation Problems. Journal of Applied Mathematics, vol. 2014, Article ID 848129, 17 pages, 2014. doi:10.1155/2014/848129.
  12. Dolan, E. D.( 2001). NEOS server 4.0 administrative guide. Technical Memorandum ANL/MCS-TM-250, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 2001.
  13. DRE (2011). Despacho n.º 16843/2011, Diário da República, 2.ª série - N.º 239 - 15 de Dezembro de 2011, 48767-48768.
  14. 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).
  15. 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).
  16. 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).
  17. DRE (2012d). Portaria nº178-B/2012. Diário da República, 1.ª série - N.º 107 - 1 de junho de 2012, 2928-(2).
  18. DRE (2012e). Despacho n.º 7702-A/2012. Diário da República, 2.ª série - N.º 108 - 4 de junho de 2012, 20410-(2).
  19. 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).
  20. DRE (2012g). Despacho nº 8705/2012. Diário da República, 2.ª série - N.º 125 - 29 de junho de 2012, 22880- 22881.
  21. DRE (2012h). 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.
  22. Gribkovskaia, I., Laporte, G., & Shyshou, A. (2008). The single vehicle routing problem with deliveries and selective pickups. Computers & Operations Research, 35(9), 2908-2924.
  23. Gropp, W., & Moré, J.J. (1997). Optimization environments and the NEOS server. M. D. Buhmann, A. Iserles, eds. Approximation Theory and Optimization: Tributes to M. J. D. Powell. Cambridge University Press, Cambridge, UK, (1997) 167-182.
  24. Gutiérrez-Jarpa, G., Marianov, V., & Obreque, C. (2009). A single vehicle routing problem with fixed delivery and optional collections. IIE Transactions, 41(12), 1067-1079.
  25. Hains, I. M., Marks, A., Georgiou, A., & Westbrook, J. I. (2011). Non-emergency patient transport: what are the quality and safety issues? A systematic review. International Journal for Quality in Health Care, 23(1), 68-75.
  26. Hu, Q., & Lim, A. (2014). An iterative three-component heuristic for the team orienteering problem with time windows. European Journal of Operational Research, 232(2), 276-286.
  27. Labadie, N., Mansini, R., Melechovský, J., & Wolfler Calvo, R. (2012). The team orienteering problem with time windows: An lp-based granular variable neighborhood search. European Journal of Operational Research, 220(1), 15-27.
  28. Madsen, O. B., Ravn, H. F., & Rygaard, J. M. (1995). A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research, 60(1), 193-208.
  29. Psaraftis, H. N. (1988). Dynamic vehicle routing problems. Vehicle routing: Methods and studies, 16, 223-248.
  30. Safaei, J. (2011). A ride to care-a non-emergency medical transportation service in rural British Columbia. Rural and Remote Health, 11(1637).
  31. Stiver, H. G., Trosky, S. K., Cote, D. D., & Oruck, J. L. (1982). Self-administration of intravenous antibiotics: an efficient, cost-effective home care program. Canadian Medical Association Journal, 127(3), 207.
  32. Vaisblat, A., & Albert, D. (2013). Medical non-emergency patient centered scheduling solution. New Magenta Papers, 40.
  33. Vansteenwegen, P., Souffriau, W., & Oudheusden, D. V. (2011). The orienteering problem: A survey. European Journal of Operational Research, 209(1), 1-10.
  34. Wilken, P., Ratnapradipa, D., Presley, D., & Wodika, A. B. (2014). An evaluation of the non-emergency medical transportation system of rural southern illinois. American Journal of Health Studies, 29(2).
Download


Paper Citation


in Harvard Style

A. Oliveira J., Ferreira J., Dias L., Figueiredo M. and Pereira G. (2015). Non Emergency Patients Transport - A Mixed Integer Linear Programming . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 262-269. DOI: 10.5220/0005214902620269


in Bibtex Style

@conference{icores15,
author={José A. Oliveira and João Ferreira and Luís Dias and Manuel Figueiredo and Guilherme Pereira},
title={Non Emergency Patients Transport - A Mixed Integer Linear Programming},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={262-269},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005214902620269},
isbn={978-989-758-075-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Non Emergency Patients Transport - A Mixed Integer Linear Programming
SN - 978-989-758-075-8
AU - A. Oliveira J.
AU - Ferreira J.
AU - Dias L.
AU - Figueiredo M.
AU - Pereira G.
PY - 2015
SP - 262
EP - 269
DO - 10.5220/0005214902620269