Skip to main content

A Hybrid Cooperative and Reactive Search Approach for Vehicle Routing Problem with Time Windows

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8398))

Abstract

The paper proposes a new hybrid approach for Vehicle Routing Problem with Time Windows (VRPTW), which combines a cooperative problem solving paradigm with the reactive search. Process of searching for the best solution is performed by a set of cooperating heuristics working on a population of individuals. Additionally, at each iteration, a history of search of each heuristic and its performance are recorded, and next used for dynamic management of the set of heuristics and adjustment their parameters. Computational experiment which has been carried out confirmed the effectiveness of the proposed approach.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barbucha, D.: Search modes for the cooperative multi-agent system solving the vehicle routing problem. Neurocomputing 88, 13–23 (2012)

    Article  Google Scholar 

  2. Battiti, R., Brunato, M.: Reactive Search: Machine Learning for Memory-Based Heuristics. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Computer and Information Science Series, pp. 21.1–21.17. Chapman & Hall, CRC (2007)

    Google Scholar 

  3. Bellifemine, F., Caire, G., Greenwood, D.: Developing Multi-Agent Systems with Jade. John Wiley & Sons, Chichester (2007)

    Google Scholar 

  4. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35(3), 268–308 (2003)

    Article  Google Scholar 

  5. Le Bouthillier, A., Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research 32(7), 1685–1708 (2005)

    Article  MATH  Google Scholar 

  6. Le Bouthillier, A., Crainic, T.G., Kropf, P.: A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows. IEEE Intelligent Systems 20(4), 36–42 (2005)

    Article  Google Scholar 

  7. Bräysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS Journal on Computing 15(4), 347–368 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bräysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science 39, 104–118 (2005)

    Article  Google Scholar 

  9. Bräysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows, Part II: Metaheuristics. Transportation Science 39, 119–139 (2005)

    Article  Google Scholar 

  10. Chiang, W., Russell, R.: A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing 9, 417–430 (1997)

    Article  MATH  Google Scholar 

  11. Masegosa, A.D., Mascia, F., Pelta, D., Brunato, M.: Cooperative Strategies and Reactive Search: A Hybrid Model Proposal. In: Stützle, T. (ed.) LION 3. LNCS, vol. 5851, pp. 206–220. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Toulouse, M., Thulasiraman, K., Glover, F.: Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning. In: Amestoy, P.R., Berger, P., Daydé, M., Duff, I.S., Frayssé, V., Giraud, L., Ruiz, D., et al. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 533–542. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 35, 254–265 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Solomon, M.: VRPTW Benchmark problems, http://w.cba.neu.edu/~msolomon/problems.htm

  15. Transportation Optimization Portal, VRPTW instances, http://www.sintef.no/Projectweb/TOP/VRPTW/Solomon-benchmark/100-customers/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Barbucha, D. (2014). A Hybrid Cooperative and Reactive Search Approach for Vehicle Routing Problem with Time Windows. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds) Intelligent Information and Database Systems. ACIIDS 2014. Lecture Notes in Computer Science(), vol 8398. Springer, Cham. https://doi.org/10.1007/978-3-319-05458-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05458-2_22

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05457-5

  • Online ISBN: 978-3-319-05458-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics