Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Data and Social Networks

CSoNet 2019: Computational Data and Social Networks pp 63–69Cite as

A RVND+ILS Metaheuristic to Solve the Delivery Man Problem with Time Windows

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11917))

Abstract

The Delivery Man Problem with Time Windows (DMPTW) is an extension of the Delivery Man Problem (DMP). The objective of DMPTW is to minimize the sum of travel durations between a depot and several customer locations while the delivery made in a specific time window given by the customers. It has many practical applications in network, e.g., whenever servers have to accommodate a set of requests so as to minimize clients’ total (or average) waiting time. To solve medium and large size instances, two-phase metaheuristic algorithm is proposed. The first stage constructs a feasible solution using Neighborhood Descent with Random neighborhood ordering (RVND), and the optimization stage improves the feasible solution with an Iterated Local Search (ILS). The proposed algorithm is tested on the DMPTW benchmark instances from the literature. The results indicate that the developed algorithm has improved the best solutions for 34 instances in a reasonable computation time.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Notes

  1. 1.

    Dongarra, J. J., 2011. Performance of various computers using standard linear equations software. Tech. Rep. CS-89-85.

  2. 2.

    https://sites.google.com/a/soict.hust.edu.vn/dmptw/.

References

  1. Ban, H.B., Nguyen, D.N.: Improved genetic algorithm for minimum latency problem. In: Proceedings of SOICT, pp. 9–15 (2010)

    Google Scholar 

  2. Ban, H.B., Nguyen, K., Ngo, M.C., Nguyen, D.N.: An efficient exact algorithm for minimum latency problem. J. PI 10, 1–8 (2013)

    Google Scholar 

  3. Ban, H.B., Nghia, N.D.: A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem. J. FI 156(1), 21–44 (2017)

    Article  MathSciNet  Google Scholar 

  4. Ban, H.B., Nghia, N.D.: Metaheuristic for the minimum latency problem with time windows. In: Proceedings of RIVF, pp. 1–6 (2017)

    Google Scholar 

  5. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, W., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of STOC, pp. 163–171 (1994)

    Google Scholar 

  6. Dumas, Y., Desrosiers, J., Gélinas, E.: An optimal algorithm for the traveling salesman problem with time windows. J. Oper. Res. 43, 367–371 (1995)

    Article  MathSciNet  Google Scholar 

  7. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Opt. 6(2), 109–133 (1995)

    Article  MathSciNet  Google Scholar 

  8. Gendreau, M., Hertz, A., Laporte, G., Stan, M.: A generalized insertion heuristic for the traveling salesman problem with time windows. J. Oper. Res. 43, 330–335 (1998)

    Article  Google Scholar 

  9. Heilporn, G., Cordeau, J.F., Laporte, G.: The delivery man problem with time windows. Discrete Optim. 7(4), 269–282 (2010)

    Article  MathSciNet  Google Scholar 

  10. Lopez-Ibanez, M., Blum, C.: Beam-ACO for the traveling salesman problem with time windows. J. Comput. Oper. Res. 37(9), 1570–1583 (2010)

    Article  Google Scholar 

  11. Mladenovic, N., Hansen, P.: Variable neighborhood search. J. Oper. Res. 24(11), 1097–1100 (1997)

    MathSciNet  MATH  Google Scholar 

  12. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215–310

    Google Scholar 

  13. Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. J. Netw. 22, 263–283 (1992)

    Article  MathSciNet  Google Scholar 

  14. Ohlmann, J.W., Thomas, B.W.: A compressed-annealing heuristic for the traveling salesman problem with time windows. J. Inform. 19(1), 80–90 (2007)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam

    Ha-Bang Ban

Authors
  1. Ha-Bang Ban
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ha-Bang Ban .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Andrea Tagarelli

  2. University of Illinois at Urbana-Champaign, Urbana, IL, USA

    Hanghang Tong

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ban, HB. (2019). A RVND+ILS Metaheuristic to Solve the Delivery Man Problem with Time Windows. In: Tagarelli, A., Tong, H. (eds) Computational Data and Social Networks. CSoNet 2019. Lecture Notes in Computer Science(), vol 11917. Springer, Cham. https://doi.org/10.1007/978-3-030-34980-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34980-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34979-0

  • Online ISBN: 978-3-030-34980-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation