Non emergency patients transport - a mixed integer linear programming

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...

Full description

Bibliographic Details
Main Author: Oliveira, José A. (author)
Other Authors: Ferreira, João Amaro Oliveira (author), Dias, Luis S. (author), Figueiredo, Manuel (author), Pereira, Guilherme (author)
Format: conferencePaper
Language:eng
Published: 2015
Subjects:
Online Access:http://hdl.handle.net/1822/38717
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/38717
Description
Summary: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.