Learn More
In this paper, we consider a variant of the pickup and delivery problem where any demand may be dropped off elsewhere than at 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(More)
préemptif et asymétrique à l'aide d'une Arbre-représentation des tournées M. La roix2∗, H. Kerivin1, A. Quilliot2, H. Toussaint2 1 Department of Mathemati al S ien es, Clemson University, CLEMSON, O-326 Martin Hall, Clemson, SC 29634 USA. kerivin lemson.edu 2 LIMOS, CNRS UMR 6158, Université Blaise-Pas al Clermont-Ferrand II, Complexe S ienti que des(More)
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of(More)
  • 1