A. Quilliot

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)
Taylor & Francis makes every effort to ensure the accuracy of all the information (the " Content ") contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views(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