• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

The splittable pickup and delivery problem with reloads

Thumbnail
Date
2008
Dewey
Recherche opérationnelle
Sujet
Reloads; PDP; Pickup and delivery problem; Branch-and-cut; Metric inequalities; Multicommodity flow; Mixed-integer linear program; Transportation problems
Journal issue
European Journal of Industrial Engineering
Volume
2
Number
2
Publication date
2008
Article pages
112-133
Publisher
Inderscience Enterprises Limited
DOI
http://dx.doi.org/10.1504/EJIE.2008.017347
URI
https://basepub.dauphine.fr/handle/123456789/2085
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Kerivin, Hervé
Lacroix, Mathieu
Mahjoub, Ali Ridha
Quilliot, Alain
Type
Article accepté pour publication ou publié
Abstract (EN)
In this paper, we consider a variant of the Pickup and Delivery Problem (PDP), where any demand may be dropped off elsewhere other than its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We discuss the complexity of this problem and present two mixed-integer linear programming formulations based on a space-time graph. We describe some valid inequalities for the problem along with separation routines. Based on these results, we develop a branch-and-cut algorithm for the problem, and present some computational results.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.