A multi-criteria large neighborhood search for the transportation of disabled people - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of the Operational Research Society Année : 2014

A multi-criteria large neighborhood search for the transportation of disabled people

Résumé

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.
Fichier non déposé

Dates et versions

hal-00578540 , version 1 (21-03-2011)

Identifiants

Citer

Fabien Lehuédé, Renaud Masson, Sophie N. Parragh, Olivier Péton, Fabien Tricoire. A multi-criteria large neighborhood search for the transportation of disabled people. Journal of the Operational Research Society, 2014, 65, pp.983-1000. ⟨10.1057/jors.2013.17⟩. ⟨hal-00578540⟩
110 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More