Skip to main content
SpringerLink
Log in

An optimization algorithm for a capacitated vehicle routing problem with time windows

  • Published:
Sādhanā Aims and scope Submit manuscript

Abstract

In this paper, vehicle routing problem (VRP) with time windows and real world constraints are considered as a real-world application on google maps. Also, tabu search is used and Hopfield neural networks is utilized. Basic constraints consist of customer demands, time windows, vehicle speed, vehicle capacity and working hours. Recently, cost and on-time delivery are the most important factors in logistics. Thus, the logistic applications attract attention of companies. In logistic management, determining the locations of delivery points and deciding the path are the vital components that should be considered. Deciding the paths of vehicles provides companies to use their vehicles efficiently. And with utilizing optimized paths, big amounts of cost and time savings will be gained. The main aim of the work is providing the best path according to the needs of the customers, minimizing the costs with utilizing the VRP and presenting an application for companies that need logistic management. To compare the results, simulated annealing is used on special scenarios. And t-test is performed in the study for the visited path in km with p-value of 0.05.

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

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15

Similar content being viewed by others

References

  1. Dantzig G and Ramser J 1959 The truck dispatching problem. Manag. Sci. 6: 80–91

    Article  MathSciNet  MATH  Google Scholar 

  2. Laporte G 1992 The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59: 345–358

    Article  MATH  Google Scholar 

  3. Tan L, Lin F and Wang H 2015 Adaptive comprehensive learning bacterial foraging optimization and its application on vehicle routing problem with time windows. Neurocomputing 151(3): 1208–1215

    Article  Google Scholar 

  4. Barbucha D 2014 A cooperative population learning algorithm for vehicle routing problem with time windows. Neurocomputing 146: 210–229

    Article  Google Scholar 

  5. Ghilas V, Demir E and Woensel T M 2016 An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Comput. Oper. Res. 72: 12–30

    Article  MathSciNet  Google Scholar 

  6. Teymourian E, Kayvanfar V, Komaki G H M and Zandieh M 2016 Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem. Inf. Sci. 334–335: 354–378

    Article  Google Scholar 

  7. Setak M, Habibi M, Karimi H and Abedzadeh M 2015 A time-dependent vehicle routing problem in multigraph with FIFO property. J. Manuf. Syst. 35: 37–45

    Article  Google Scholar 

  8. Yu V F, Jewpanya P and Redi A A N P 2016 Open vehicle routing problem with cross-docking. Comput. Ind. Eng. 94: 6–17

    Article  Google Scholar 

  9. Expósito-Izquierdo C, Rossi A and Sevaux M 2016 A two-level solution approach to solve the clustered capacitated vehicle routing problem. Comput. Ind. Eng. 91: 274–289

    Article  Google Scholar 

  10. Li J, Pardalos P M, Sun H, Pei J and Zhang Y 2015 Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. Expert Syst. Appl. 42(7): 3551–3561

    Article  Google Scholar 

  11. Montoya-Torres Jairo R, Franco J L, Isaza S N, Jiménez H F and Herazo-Padilla N 2015 A literature review on the vehicle routing problem with multiple depots. Comput. Ind. Eng. 79: 115–129

    Article  Google Scholar 

  12. Drexl M 2013 Applications of the vehicle routing problem with trailers and transshipments. Eur. J. Oper. Res. 227(2): 275–283

    Article  MathSciNet  Google Scholar 

  13. Contardo C and Martinelli R 2014 A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12: 129–146

    Article  MathSciNet  MATH  Google Scholar 

  14. Kumar S N and Panneerselvam R 2012 A survey on the vehicle routing problem and ıts variants. Intell. Inf. Manag. 4: 66–74

    Google Scholar 

  15. Glover F 1989 Tabu search – Part 1. ORSA J. Comput. 1(2): 190–206

    Article  MATH  Google Scholar 

  16. Glover F 1990 Tabu search - Part 2. ORSA J. Comput. 2(1): 4–32

    Article  MATH  Google Scholar 

  17. Piniganti L 2014 A survey of tabu search in combinatorial optimization thesis. University of Nevada, Las Vegas

    Google Scholar 

  18. Froger A, Gendreau M, Mendoza J E, Pinson E and Rousseau L M 2016 Maintenance scheduling in the electricity industry: A literature review. Eur. J. Oper. Res. 251: 695–706

    Article  MathSciNet  Google Scholar 

  19. Glover F 1990 Tabu search: A tutorial. Interfaces 20(1): 74–94

    Article  Google Scholar 

  20. Jia H, Li Y, Dong B and Ya H 2013 An ımproved tabu search approach to vehicle routing problem. Procedia-Social Behav. Sci. 96: 1208–1217

    Article  Google Scholar 

  21. Hopfield J J 1982 Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. USA 79: 2554–2558

    Article  MathSciNet  Google Scholar 

  22. Hopfield J J and Tank D W 1985 Neural computation of decisions in optimization problems. Biol. Cybern. Springer-Verlag 52: 141–152

    MathSciNet  MATH  Google Scholar 

  23. Kashmiri S 1991 The travellıng salesman problem and the Hopfıeld neural network. IEEE Proceedings of Southeastcon ‘91, Williamsburg, VA. 7–10(2): 940–943

  24. Konishi J, Shimba S, Toyama J, Kudo M and Shimbo M 1999 Tabu search for solving optimization problems on Hopfield neural networks. 1999 Third ıntematioml conference on knowledge-based ıntelligent lnformation engineeing systems, Adelaide, Australia

  25. TSPLIB. TSPLIB is a library of sample instances for the TSP. http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib.html. Visiting date: 20.11.2015

  26. Kirkpatrick S, Gelatt J and Vecchi M 1983 Optimization by simulated annealing. Science 220: 671–680

    Article  MathSciNet  MATH  Google Scholar 

  27. Goodson J C 2010 Solution methodologies for vehicle routing problems with stochastic demand. PhD (Doctor of Philosophy) thesis, University of Iowa

  28. Stegers E 2009 A solution method for vehicle routing problems with time-dependent travel times. Master thesis, Delft University of Technology, Netherlands

  29. Hosny M I 2010 Investigating heuristic and meta-heuristic algorithms for solving pickup and delivery problems. PhD thesis, Cardiff University School of Computer Science & Informatics

  30. Leung S C H, Zhang Z, Zhang D, Hua X, Lim M K 2013 A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. Eur. J. Oper. Res. 225(2): 199–210

    Article  Google Scholar 

  31. Fleming C L, Griffis S E and Bell J E 2013 The effects of triangle inequality on the vehicle routing problem. Eur. J. Oper. Res. 224(1): 1–7

    Article  Google Scholar 

  32. Sasikumar P, Haq A N and Baskar P 2010 A hybrid algorithm for the vehicle routing problem to third party reverse logistics provider. IEEE 8th International Conference on Supply Chain Management and Information Systems (SCMIS), HongKong, 1– 8

  33. Hosseini S D, Shirazi M A and Karimi B 2014 Cross-docking and milk run logistics in a consolidation network: A hybrid of harmony search and simulated annealing approach. J. Manuf. Syst. 33(4): 567–577

    Article  Google Scholar 

  34. Tavakkoli-Moghaddam R, Gazanfari M, Alinaghian M, Salamatbakhsh A and Norouzi N 2011 A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. J. Manuf. Syst. 30(2): 83–92

    Article  Google Scholar 

  35. Fard F A and Setak M 2011 Comparison between two algorithms for multi-depot vehicle routing problem with ınventory transfer between depots in a three-echelon supply chain. Int. J. Comput. Appl. (0975–8887) 28(6): 39–45

  36. Takes F 2010 Applying Monte Carlo techniques to the capacitated vehicle routing problem. Master thesis, Leiden University, The Netherlands

  37. De A, Awasthi A and Tiwari M K 2015 Robust formulation for optimizing sustainable ship routing and scheduling problem. IFAC-PapersOnLine 48(3): 368–373

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering Sciences Department, Istanbul University, Istanbul, Turkey

    Pinar Kirci

Authors
  1. Pinar Kirci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pinar Kirci.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kirci, P. An optimization algorithm for a capacitated vehicle routing problem with time windows. Sādhanā 41, 519–529 (2016). https://doi.org/10.1007/s12046-016-0488-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12046-016-0488-5

Keywords

Search

Navigation