Abstract
With ageing societies and increasing number of patients, there is a growing need for quality services that help transporting non-urgent patients to hospitals. In logistics, patient transportation problems are usually modeled as a dial-a-ride problem. In a Dial-a-Ride problem, a fleet of vehicles is providing the delivery services between the loading points and the delivery destinations. The demands are known in advance. In most cases the total travel distance of the vehicles is to be minimized. In this paper, we consider a specific dial-a-ride problem, where a single vehicle is used to transport patients to the same hospital. In determining the optimal route, the multiple and different travel needs of patients, such as their maximum travel time, are also taken into consideration. We introduce 4 different mixed integer linear programming models of the routing problem. Finally, the efficiency of the four models was compared using some real-life problems by solving them with a commercial solver.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
