Skip to main content

An Improved Genetic Algorithm for Vehicle Routing Problem with Time Windows Considering Temporal-Spatial Distance

  • Conference paper
  • First Online:
Advanced Intelligent Computing Technology and Applications (ICIC 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14086))

Included in the following conference series:

Abstract

In recent years, the impact of the epidemic has led to a gradual recovery of the logistics industry, bringing new opportunities to improve the country's economy. Therefore, the study of the vehicle routing problem with time windows (VRPTW) is of great practical importance. To the best of our knowledge, most studies only consider the distance in customer space and ignore the effect of time windows on objectives. In this paper, we propose an improved genetic algorithm (IGA) to solve the vehicle routing problem with time windows considering temporal-spatial distance (VRPTWTSD). In the proposed algorithm, a hybrid initialization method is first designed, which includes two problem-specific methods, namely the temporal-spatial distance insertion heuristic (TSDIH) and the earliest ready time heuristic (ERH). In addition, two knowledge-based crossover operators are designed for the encoding method to expand the search space. Finally, a series of problem-applicable instances are generated and the effectiveness of the algorithm is proved by statistical analysis through comparison with several well-known algorithms.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Lahyani, R., Coelho, L.C., Khemakhem, M., Laporte, G., Semet, F.: A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia. OMEGA-The Int. J. Manage. Sci. 51, 1–10 (2015)

    Article  Google Scholar 

  2. Dorling, K., Heinrichs, J., Messier, G.G., Magierowski, S.: Vehicle routing problems for drone delivery. IEEE Trans. Syst. Man Cybern. Syst. 47, 70–85 (2017)

    Article  Google Scholar 

  3. Mourao, M.C., Almeida, M.T.: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. Eur. J. Oper. Res. 121, 420–434 (2000)

    Article  MATH  Google Scholar 

  4. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Chapter 2 Time constrained routing and scheduling. In: Handbooks in Operations Research and Management Science. Elsevier, pp. 35–139 (1995)

    Google Scholar 

  6. Cook, W.a.R., Jennifer, L.: A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problem with Time Windows (1999)

    Google Scholar 

  7. Liu, S.-C., Chen, J.-R.: A heuristic method for the inventory routing and pricing problem in a supply chain. Expert Syst. Appl. 38, 1447–1456 (2011)

    Article  Google Scholar 

  8. Hashimoto, H., Ibaraki, T., Imahori, S., Yagiura, M.: The vehicle routing problem with flexible time windows and traveling times. Discret. Appl. Math. 154, 2271–2290 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wang, Y., Wang, L., Peng, Z., Chen, G., Cai, Z., Xing, L.: A multi ant system based hybrid heuristic algorithm for vehicle routing problem with service time customization. Swarm Evol. Comput. 50, 100563 (2019)

    Article  Google Scholar 

  10. Xiaoju, F., et al.: Active vitamin D3 protects against diabetic kidney disease by regulating the jnk signaling pathway in rats. Int. J. Diabetes Endocrinology 6, 105–113 (2021)

    Article  Google Scholar 

  11. Iqbal, S., Kaykobad, M., Rahman, M.S.: Solving the multi-objective vehicle routing problem with soft time windows with the help of bees. Swarm Evol. Comput. 24, 50–64 (2015)

    Article  Google Scholar 

  12. Cai, Y., Cheng, M., Zhou, Y., Liu, P., Guo, J.-M.: A hybrid evolutionary multitask algorithm for the multiobjective vehicle routing problem with time windows. Inf. Sci. 612, 168–187 (2022)

    Article  Google Scholar 

  13. Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput. Intell. Mag. 12, 73–87 (2017)

    Article  Google Scholar 

  14. Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11, 712–731 (2007)

    Article  Google Scholar 

  15. He, Z., Yen, G.G.: Many-objective evolutionary algorithms based on coordinated selection strategy. IEEE Trans. Evol. Comput. 21, 220–233 (2017)

    Article  Google Scholar 

  16. Chen, H., Tian, Y., Pedrycz, W., Wu, G., Wang, R., Wang, L.: Hyperplane assisted evolutionary algorithm for many-objective optimization problems. IEEE Trans. Cybern. 50, 3367–3380 (2020)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, J., Li, J.q. (2023). An Improved Genetic Algorithm for Vehicle Routing Problem with Time Windows Considering Temporal-Spatial Distance. In: Huang, DS., Premaratne, P., Jin, B., Qu, B., Jo, KH., Hussain, A. (eds) Advanced Intelligent Computing Technology and Applications. ICIC 2023. Lecture Notes in Computer Science, vol 14086. Springer, Singapore. https://doi.org/10.1007/978-981-99-4755-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-981-99-4755-3_35

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-99-4754-6

  • Online ISBN: 978-981-99-4755-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics