The non-emergency patient transport modelled as a team orienteering problem

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.

ject 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 par tially supported by FCT – Fu ndação para a Ciência e Tecnologia within the Project Scope: UID/CEC/00319/2013