1. Foreword

   • Michel Gendreau
   • Gilbert Laporte

   EditorialNotes Pages: v - vii

2. On properties of geometric random problems in the plane

   • Patrick Jaillet

   OriginalPaper Pages: 1 - 20

3. A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations

   • Eleni Hadjiconstantinou
   • Nicos Christofides
   • Aristide Mingozzi

   OriginalPaper Pages: 21 - 43

4. A two-phase algorithm for the partial accessibility constrained vehicle routing problem

   • Frédéric Semet

   OriginalPaper Pages: 45 - 65

5. Routing models and solution procedures for regional less-than-truckload operations

   • Cynthia Barnhart
   • Daeki Kim

   OriginalPaper Pages: 67 - 90

6. A new branching strategy for time constrained routing problems with application to backhauling

   • Sylvie Gélinas
   • Martin Desrochers
   • Marius M. Solomon

   OriginalPaper Pages: 91 - 109

7. Using artificial neural networks to solve the orienteering problem

   • Qiwen Wang
   • Xiaoyun Sun
   • Jiyou Jia

   OriginalPaper Pages: 111 - 120

8. An exact algorithm for the capacitated shortest spanning arborescence

   • Paolo Toth
   • Daniele Vigo

   OriginalPaper Pages: 121 - 141

9. Dynamic vehicle routing: Status and prospects

   • Harilaos N. Psaraftis

   OriginalPaper Pages: 143 - 164

10. Dynamic fleet management as a logistics queueing network

    • Warren B. Powell
    • Tassio A. Carvalho
    • Hugo P. Simão

    OriginalPaper Pages: 165 - 188

11. A computer assistant for vehicle dispatching with learning capabilities

    • Yu Shen
    • Jean-Yves Potvin
    • Serge Roy

    OriginalPaper Pages: 189 - 211

12. A heuristic method for dispatching repair men

    • Oli B. G. Madsen
    • Kim Tosti
    • Jan Vælds

    OriginalPaper Pages: 213 - 226

13. Routing problems: A bibliography

    • Gilbert Laporte
    • Ibrahim H. Osman

    OriginalPaper Pages: 227 - 262