Skip to main content
SpringerLink
Log in
Book cover

International Conference on Machine Learning for Cyber Security

ML4CS 2020: Machine Learning for Cyber Security pp 235–249Cite as

A Capacitated Vehicle Routing Problem with Order Release Time Based on a Hybrid Harmony Search

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12487))

Abstract

With the popularity of Internet technology, e-commerce enterprises have rapidly developed. Orders need to be collected before delivery, and vehicles are waiting in the warehouse for most enterprises. This paper considers a capacitated vehicle routing problem with order release time, with the aim of minimizing the maximum order delivery time. A mathematical model is first built, and then, a hybrid harmony search algorithm is proposed to address the nearest optimal solutions, with three methods to generate initial harmony memory, an optimization algorithm to evaluate each harmony and a tabu search to improve initial solutions and neighbourhood solutions. The linear programming software CPLEX is applied to verify the rationality of the mathematical model. Computational results indicate that the average solution quality of all generated instances obtained by the hybrid harmony search is better than the current operational strategy of the enterprise, a tabu search algorithm and a genetic algorithm in the related articles.

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

References

  1. Gevaers, R., Van de Voorde, E., Vanelslander, T.: Cost modelling and simulation of last-mile characteristics in an innovative B2C supply chain environment with implications on urban areas and cities. Proc. Soc. Behav. Sci. 125, 398–411 (2014). https://doi.org/10.1016/j.sbspro.2014.01.1483

    Article  Google Scholar 

  2. Low, C.Y., Li, R.K., Chang, C.M.: Integrated scheduling of production and delivery with time windows. Int. J. Logist. Res. Appl. 51, 897–909 (2013). https://doi.org/10.1080/00207543.2012.677071

    Article  Google Scholar 

  3. Li, K., Chen, B., Sivakumar, A.I., Wu, Y.: An inventory–routing problem with the objective of travel time minimization. Eur. J. Oper. Res. 236, 936–945 (2014). https://doi.org/10.1016/j.ejor.2013.07.034

    Article  MathSciNet  MATH  Google Scholar 

  4. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959). https://doi.org/10.1287/mnsc.6.1.80

    Article  MathSciNet  MATH  Google Scholar 

  5. Szeto, W.Y., Wu, Y., Ho, S.C.: An artificial bee colony algorithm for the capacitated vehicle routing problem. Int. J. Prod. Res. 215, 126–135 (2011). https://doi.org/10.1016/j.ejor.2011.06.006

    Article  Google Scholar 

  6. Akpinar, S.: Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Exp. Syst. Appl. 61, 28–38 (2016). https://doi.org/10.1016/j.eswa.2016.05.023

    Article  Google Scholar 

  7. Liu, R., Jiang, Z.: A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints. Appl. Soft Comput. 80, 18–30 (2019). https://doi.org/10.1016/j.asoc.2019.03.008

    Article  Google Scholar 

  8. Liu, T., Luo, Z., Qin, H., Lim, A.: A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints. Eur. J. Oper. Res. 266, 487–497 (2018). https://doi.org/10.1016/j.ejor.2017.10.017

    Article  MathSciNet  MATH  Google Scholar 

  9. Marques, G., Sadykov, R., Deschamps, J.-C., Dupas, R.: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput. Oper. Res. 114, 104833 (2020). https://doi.org/10.1016/j.cor.2019.104833

    Article  MathSciNet  MATH  Google Scholar 

  10. Ng, K.K.H., Lee, C.K.M., Zhang, S.Z., Wu, K., Ho, W.: A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Comput. Ind. Eng. 109, 151–168 (2017). https://doi.org/10.1016/j.cie.2017.05.004

    Article  Google Scholar 

  11. Wei, L., Zhang, Z., Zhang, D., Leung, S.C.H.: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 265, 843–859 (2018). https://doi.org/10.1016/j.ejor.2017.08.035

    Article  MathSciNet  MATH  Google Scholar 

  12. Bortfeldt, A.: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comput. Oper. Res. 39, 2248–2257 (2012). https://doi.org/10.1016/j.cor.2011.11.008

    Article  MathSciNet  MATH  Google Scholar 

  13. Allahyari, S., Salari, M., Vigo, D.: A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. Eur. J. Oper. Res. 242, 756–768 (2015). https://doi.org/10.1016/j.ejor.2014.10.048

    Article  MathSciNet  MATH  Google Scholar 

  14. Xu, Z., Elomri, A., Pokharel, S., Mutlu, F.: A model for capacitated green vehicle routing problem with the time-varying vehicle speed and soft time windows. Comput. Ind. Eng. 137, 106011 (2019). https://doi.org/10.1016/j.cie.2019.106011

    Article  Google Scholar 

  15. Ciancio, C., Laganá, D., Vocaturo, F.: Branch-price-and-cut for the mixed capacitated general routing problem with time windows. Eur. J. Oper. Res. 267, 187–199 (2018). https://doi.org/10.1016/j.ejor.2017.11.039

    Article  MathSciNet  MATH  Google Scholar 

  16. Madankumar, S., Rajendran, C.: Mathematical models for green vehicle routing problems with pickup and delivery: a case of semiconductor supply chain. Comput. Oper. Res. 89, 183–192 (2018). https://doi.org/10.1016/j.cor.2016.03.013

    Article  MathSciNet  MATH  Google Scholar 

  17. Lu, E.H.-C., Yang, Y.-W.: A hybrid route planning approach for logistics with pickup and delivery. Exp. Syst. Appl. 118, 482–492 (2019). https://doi.org/10.1016/j.eswa.2018.10.031

    Article  Google Scholar 

  18. Hornstra, R.P., Silva, A., Roodbergen, K.J., Coelho, L.C.: The vehicle routing problem with simultaneous pickup and delivery and handling costs. Comput. Oper. Res. 115, 104858 (2020). https://doi.org/10.1016/j.cor.2019.104858

    Article  MathSciNet  MATH  Google Scholar 

  19. Shi, Y., Boudouh, T., Grunder, O.: A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Exp. Syst. Appl. 72, 160–176 (2017). https://doi.org/10.1016/j.eswa.2016.12.013

    Article  Google Scholar 

  20. Gutierrez, A., Dieulle, L., Labadie, N., Velasco, N.: A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 99, 135–147 (2018). https://doi.org/10.1016/j.cor.2018.06.012

    Article  MathSciNet  MATH  Google Scholar 

  21. Bertazzi, L., Secomandi, N.: Faster rollout search for the vehicle routing problem with stochastic demands and restocking. Eur. J. Oper. Res. 270, 487–497 (2018). https://doi.org/10.1016/j.ejor.2018.03.034

    Article  MathSciNet  MATH  Google Scholar 

  22. Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129–146 (2014). https://doi.org/10.1016/j.disopt.2014.03.001

    Article  MathSciNet  MATH  Google Scholar 

  23. Li, Y., Soleimani, H., Zohal, M.: An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives. J. Clean. Prod. 227, 1161–1172 (2019). https://doi.org/10.1016/j.jclepro.2019.03.185

    Article  Google Scholar 

  24. Leggieri, V., Haouari, M.: Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems. Eur. J. Oper. Res. 263, 755–767 (2017). https://doi.org/10.1016/j.ejor.2017.05.039

    Article  MathSciNet  MATH  Google Scholar 

  25. Bevilaqua, A., Bevilaqua, D., Yamanaka, K.: Parallel island based memetic algorithm with Lin-Kernighan local search for a real-life two-echelon heterogeneous vehicle routing problem based on Brazilian wholesale companies. Appl. Soft Comput. 76, 697–711 (2019). https://doi.org/10.1016/j.asoc.2018.12.036

    Article  Google Scholar 

  26. Eskandarpour, M., Ouelhadj, D., Hatami, S., Juan, A.A., Khosravi, B.: Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges. Eur. J. Oper. Res. 277, 479–491 (2019). https://doi.org/10.1016/j.ejor.2019.02.048

    Article  MathSciNet  MATH  Google Scholar 

  27. Archetti, C., Feillet, D., Speranza, M.G.: Complexity of routing problems with release dates. Eur. J. Oper. Res. 247, 797–803 (2015). https://doi.org/10.1016/j.ejor.2015.06.057

    Article  MathSciNet  MATH  Google Scholar 

  28. Reyes, D., Erera, A.L., Savelsbergh, M.W.P.: Complexity of routing problems with release dates and deadlines. Eur. J. Oper. Res. 266, 29–34 (2018). https://doi.org/10.1016/j.ejor.2017.09.020

    Article  MathSciNet  MATH  Google Scholar 

  29. Archetti, C., Feillet, D., Mor, A., Speranza, M.G.: An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization. Comput. Oper. Res. 98, 24–37 (2018). https://doi.org/10.1016/j.cor.2018.05.001

    Article  MathSciNet  MATH  Google Scholar 

  30. Liu, L., Li, K., Liu, Z.: A capacitated vehicle routing problem with order available time in e-commerce industry. Eng. Optim. 49, 449–465 (2017). https://doi.org/10.1080/0305215x.2016.1188092

    Article  MathSciNet  Google Scholar 

  31. Li, W., Wu, Y., Kumar, P.N.R., Li, K.: Multi-trip vehicle routing problem with order release time. Eng. Optim. 52, 1279–1294 (2019). https://doi.org/10.1080/0305215x.2019.1642880

    Article  MathSciNet  Google Scholar 

  32. Cattaruzza, D., Absi, N., Feillet, D.: The multi-trip vehicle routing problem with time windows and release dates. Transp. Sci. 50, 676–693 (2016). https://doi.org/10.1287/trsc.2015.0608

    Article  Google Scholar 

  33. Zhen, L., Ma, C., Wang, K., Xiao, L., Zhang, W.: Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transp. Res. E Logist. Transp. Rev. 135, 101866 (2020). https://doi.org/10.1016/j.tre.2020.101866

    Article  Google Scholar 

  34. Shelbourne, B.C., Battarra, M., Potts, C.N.: The vehicle routing problem with release and due dates. INFORMS J. Comput. 29, 705–723 (2018). https://doi.org/10.1287/ijoc.2017.0756

    Article  MathSciNet  Google Scholar 

  35. Soman, J.T., Patil, R.J.: A scatter search method for heterogeneous fleet vehicle routing problem with release dates under lateness dependent tardiness costs. Expert Syst. Appl. 150, 113302 (2020). https://doi.org/10.1016/j.eswa.2020.113302

    Article  Google Scholar 

  36. Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76, 60–68 (2001). https://doi.org/10.1177/003754970107600201

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 71862034 and 71862035); The Scientific Research Funding of Yunnan Department of Education (No. 2017ZZX004); The Scientific Research Funding of Yunnan University of Finance and Economics (No. 2019D04); The Yunnan Fundamental Research Project under grant NO. 2019FB085.

Author information

Authors and Affiliations

  1. School of Logistics, Yunnan University of Finance and Economics, Kunming, 650221, China

    Ling Liu, Sen Liu & Hui Tan

  2. College of Management, Shenzhen University, Shenzhen, 518060, China

    Ben Niu

  3. Institute of Big Data Intelligent Management and Decision, Shenzhen University, Shenzhen, China

    Ben Niu

Authors
  1. Ling Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ben Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hui Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Sen Liu or Ben Niu .

Editor information

Editors and Affiliations

  1. Xidian University, Xi'an, China

    Xiaofeng Chen

  2. Guangzhou University, Guangzhou, China

    Hongyang Yan

  3. Michigan State University, East Lansing, MI, USA

    Qiben Yan

  4. Division of Computer, Electrical and Mathematical Sciences and Engineering, King Abdullah University of Science, Thuwal, Saudi Arabia

    Xiangliang Zhang

Ethics declarations

The authors declare no conflicts of interest.

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, L., Liu, S., Niu, B., Tan, H. (2020). A Capacitated Vehicle Routing Problem with Order Release Time Based on a Hybrid Harmony Search. In: Chen, X., Yan, H., Yan, Q., Zhang, X. (eds) Machine Learning for Cyber Security. ML4CS 2020. Lecture Notes in Computer Science(), vol 12487. Springer, Cham. https://doi.org/10.1007/978-3-030-62460-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-62460-6_21

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation