Constraint Propagation for the Dial-a-Ride Problem with Split Loads - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Recent Advances in Computational Optimization. Année : 2013

Constraint Propagation for the Dial-a-Ride Problem with Split Loads

Résumé

Abstract. This paper deals with a new problem: the Dial and Ride Problem with Split Loads (DARPSL), while using randomized greedy insertion techniques together with constraint propagation techniques. Though it focuses here on the static versions of Dial and Ride, it takes into account the fact that practical DARP has to be handled according to a dynamical point of view, and even, in some case, in real time contexts. So, the kind of algorithmic solution which is proposed here, aim at making easier to bridge both points of view. First, we propose the general framework of the model and discuss the link with dynamical DARP, second, we describe the two algorithms (DARP and DARPSL), and lastly, show numerical experiments for both.
Fichier principal
Vignette du fichier
2013.SamDele.DARPSL.pdf (343.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00916491 , version 1 (10-12-2013)

Identifiants

Citer

Samuel Deleplanque, Alain Quilliot. Constraint Propagation for the Dial-a-Ride Problem with Split Loads. Recent Advances in Computational Optimization., 2013, Studies in Computational Intelligence (470), pp.31-50. ⟨10.1007/978-3-319-00410-5_3⟩. ⟨hal-00916491⟩
64 Consultations
292 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More