Abstract
This paper addresses the problem of optimizing the transportation of disabled persons from home to specialized centres or schools. It is modelled as a Dial-a-ride problem (DARP), where several people share the same destination. Particular emphasis is placed on the objective function in order to consider several potentially conflicting interests. We propose a multi-criteria model from Multi-attribute Utility Theory based on the Choquet integral. The resulting multi-criteria DARP is then solved with a large neighbourhood search algorithm. This method includes classical destroy and repair heuristics as well as new operators exploiting the shared destination feature and criterion-specific operators. The algorithm is evaluated on a set of 14 real-world instances in the field of health care logistics, with up to 200 requests and 51 destination points.
Sign-in/Register to access full text options 
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.
