This article addresses the problem of optimizing the transportation of disabled persons from home to specialized centers or schools. It is modeled 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 DARP is then solved with an adaptive large neighborhood search (ALNS) algorithm. This method includes classical destroy and repair heuristics as well as new operators exploiting the common delivery nodes aspect, as well as criterion-specic operators. The algorithm is evaluated on a set of 14 real life instances with up to 200 requests and 51 destination points.