Publicação
Non emergency patients transport - a mixed integer linear programming
| Resumo: | 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. |
|---|---|
| Autores principais: | Oliveira, José A. |
| Outros Autores: | Ferreira, João Amaro Oliveira; Dias, Luis S.; Figueiredo, Manuel; Pereira, Guilherme |
| Assunto: | Non Emergency Patients Transport Team Orienteering Problem Mixed Integer Linear Programming AMPL NEOS Server Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática Engenharia e Tecnologia::Outras Engenharias e Tecnologias |
| Ano: | 2015 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | 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. |
|---|