Skip to main content
SpringerLink
Log in

A tabu search heuristic for the single vehicle pickup and delivery problem with time windows

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

The single vehicle pickup and delivery problem with time windows is a generalization of the traveling salesman problem. In such a problem, a number of transportation requests have to be satisfied by one vehicle, each request having constraints to respect: a pickup at its origin and a delivery at its destination, and a time window at each location. The capacity of the vehicle has to be respected. The aim is to minimize the total distance traveled by the vehicle. A number of exact and approximate solution methods exists in the literature, but to the author's knowledge none of them make use of metaheuristics, still promising with other vehicle routing problems. In this paper we present tabu search and probabilistic tabu search. Results obtained on classical traveling salesman problems and a class of randomly generated instances indicate that our approach often produces optimal solutions in a relatively short execution time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ascheuer, N. (1995) Hamiltonian path problems in the on-line optimization of flexible manufacturing systems Ph.D. thesis, Technische Universität Berlin, Germany.

    Google Scholar 

  • Bodin, L. D., Golden, B. L., Assad, A. and Ball, M. O. (1983) Routing and scheduling of vehicles and crew: the state of the art. Computers and Operations Research, 10(2), 63-211.

    Google Scholar 

  • Bodin, L. and Sexton, T. (1986). The multi-vehicle subscriber dial-a-ride problem, TIMS Studies in the Management Science, 22, 73-86.

    Google Scholar 

  • van der Bruggen, L. J. J., Lenstra, J. K. and Schuur, P. C. (1993) Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transportation Science, 27(3), 298-311.

    Google Scholar 

  • Desrochers, M., Lenstra, J. K., Savelsbergh, M. P. W. and Soumis, F. (1988) Vehicle routing with time windows: optimisation and approximation, in Vehicle Routing: Methods and Studies, B. L. Golden and A. A. Assad (eds), Elsevier Science.

  • Desrosiers, J., Dumas, Y. and Soumis, F. (1986) A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. American Journal of Mathematical and Management Sciences, 6(3), 301-325.

    Google Scholar 

  • Dumas, Y. and Desrosiers, J. (1986) A shortest path problem for vehicle routing with pickup, delivery and time windows, Cahiers du GERAD, Ecole des Hautes Etudes Commerciales de Montréal, Canada.

    Google Scholar 

  • Dumas, Y., Desrosiers, J. and Soumis, F. (1991) The pickup and delivery problem with time windows. European Journal of Operational Research, 54(1), 7-22.

    Google Scholar 

  • Gendreau, M., Laporte, G. and Potvin, J.-Y. (1997) Vehicle routing: modern heuristics, in Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra (eds), John Wiley.

  • Glover, F. (1989) Tabu search. I. ORSA Journal on Computing, 1(3), 190-206.

    Google Scholar 

  • Glover, F. (1990) Tabu search. II. ORSA Journal on Computing, 2(1), 4-32.

    Google Scholar 

  • Glover, F. (1995) Tabu search fondamentals and uses. Research report, University of Colorado, USA.

    Google Scholar 

  • Glover, F. and Lokketangen, A. (1994) Probabilistic tabu search for zero-one mixed integer programming problems, University of Colorado, Boulder, USA.

    Google Scholar 

  • Golden, B. L., Wasil, E. A., Kelly, J. P. and Chao, I.-M. (1998) The impact of metaheuristics on solving the vehicle routing problems: algorithms, problem sets, and computational results, in Fleet Management and Logistics, T. C. Crainic and G. Laporte (eds), Kluwer Academic.

  • Healy, P. and Moll, R. (1995) A new extension of local search applied to the dial a ride problem, European Journal of Operational Research, 83, 83-104.

    Google Scholar 

  • Ioachim, I., Desrosiers, J., Dumas, Y., Salomon, M. M. and Villeneuve, D. (1995) A request clustering algorithm for door-to-door handicapped transportation, Transportation Science, 29(1), 63-78.

    Google Scholar 

  • Kalantari, B., Hill, A. V. and Adora, S. R. (1985) An algorithm for the traveling salesman with pickup and delivery customers. European Journal of Operational Research, 22, 377-386.

    Google Scholar 

  • Laguna, M. and Glover, F. (1993) Integrating target analysis and tabu search for improved scheduling problems. Expert Systems with Applications, 6, 287-297.

    Google Scholar 

  • Lin, S. and Kernighan, B. (1973) An effective heuristic algorithm for the traveling salesman problem, Operations Research, 21(2), 498-516.

    Google Scholar 

  • Madsen, O. B. G., Ravn, H. F. and Rygaard, J. M. (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Annals of Operations Research, 60, 193-208.

    Google Scholar 

  • Mati, Y. (1999) The pickup and delivery problem with time windows. DEA Research Report, Automatic Laboratory of Grenoble, INPG, France. (In french)

    Google Scholar 

  • Psaraftis, H. N. (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 14(2), 130-154.

    Google Scholar 

  • Psaraftis, H. N. (1983a) An exact algorithm for the single vehicle many-to-many immediate request dial-a-ride problem with time windows. Transportation Science, 17, 351-357.

    Google Scholar 

  • Psaraftis, H. N. (1983b) Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Transportation Research, 17B, 133-145.

    Google Scholar 

  • Savelsbergh, M. P. W. and Sol, M. (1995) The general pickup and delivery problem. Transportation Science, 29(1), 17-29.

    Google Scholar 

  • Savelsbergh, M. P. W. and Sol, M. (1998) Drive: dynamic routing of independant vehicles. Operations Research, 46(4), 474-491.

    Google Scholar 

  • Sexton, T. R. and Bodin, L. D. (1983) The multiple-vehicle subscriber dial-a-ride problem. Working paper MS/S 83-009, College of Business and Management, University of Maryland.

  • Sexton, T. R. and Bodin, L. D. (1985a) Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transportation Science, 19(4), 378-410.

    Google Scholar 

  • Sexton, T. R. and Bodin, L. D. (1985b) Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. Transportation Science, 19(4), 411-435.

    Google Scholar 

  • Sexton, T. and Choi, Y. (1986) Pick-up and delivery of partial loads with time windows. The American Journal of Mathematical and Management Sciences, 6, 369-398.

    Google Scholar 

  • Sharma, R. R. K. and Paradkar, S. S. (1995) Modelling a railway freight transport system. Asia Pacific Journal of Operational Research, 12(1), 17-36.

    Google Scholar 

  • Skorin-Kapov, J. (1990) Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2(1), 33-41.

    Google Scholar 

  • Taillard, E. (1991) Robust Taboo search for the quadratic assignment problem. Parallel Computing, 17, 443-455.

    Google Scholar 

  • Taillard, E., Badeau, P., Gendreau, M., Guertin, F. and Potvin, J.-Y. (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2), 170-186.

    Google Scholar 

  • http://www.zib.de/ascheuer/ATSPTW.html

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Automatique de Grenoble - Ensieg, BP 46, 38402, St Martin d'Hères Cedex, France

    Antoine Landrieu, Yazid Mati & Zdenek Binder

Authors
  1. Antoine Landrieu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yazid Mati
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zdenek Binder
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Landrieu, A., Mati, Y. & Binder, Z. A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. Journal of Intelligent Manufacturing 12, 497–508 (2001). https://doi.org/10.1023/A:1012204504849

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012204504849

Search

Navigation