A MATLAB-Based Application to Solve Vehicle Routing Problem Using GA

  • Nikki RathoreEmail author
  • P. K. Jain
  • M. Parida
Conference paper
Part of the Lecture Notes on Multidisciplinary Industrial Engineering book series (LNMUINEN)


Application of vehicle routing problem in real-life logistics operations is a need of today’s world, and this paper focuses on developing a vehicle routing problem for the delivery and pickup of products from multiple depot to the graphically scattered customers. The proposed model can be used in real-life applications of various logistic operations where there is a need to determine the optimized location of warehouse for setup so that the demand of customers is fully satisfied. To do so, a genetic algorithm-based solution methodology is proposed to solve the above-stated problem. The proposed algorithm is tested on generated data based on real-life scenarios. The experiments show that the proposed algorithm successfully finds the potential locations for warehouse setup based on the demand and location of customers for minimum transportation cost. The presented approach can provide good solutions to a large-scale problem generally found in real life.


VRP Multi-depot Time windows Genetic algorithm Real life Uttarakhand 


  1. 1.
    Alaia, E. Ben, Dridi, I.H., Bouchriha, H., Borne, P.: Insertion of new depot locations for the optimization of multi-vehicles multi-depots pickup and delivery problems using genetic algorithm. In: 2015 International Conference on Industrial Engineering and Systems Management (IESM), pp. 695–701. IEEE (2015)Google Scholar
  2. 2.
    Balakrishnan, N.: Simple heuristics for the vehicle routeing problem with soft time windows. J. Oper. Res. Soc. 44, 279–287 (1993). Scholar
  3. 3.
    Ceselli, A., Righini, G., Salani, M.: A column generation algorithm for a rich vehicle-routing problem. Transp. Sci. 43, 56–69 (2009). Scholar
  4. 4.
    Chiang, W.C., Russell, R.A.: A metaheuristic for the vehicle-routeing problem with soft time windows. J. Oper. Res. Soc. 55, 1298–1310 (2004). Scholar
  5. 5.
    Dhahri, A., Zidi, K., Ghedira, K.: Variable neighborhood search based set covering ILP model for the vehicle routing problem with time windows. Procedia Comput. Sci. 29, 844–854 (2014). Scholar
  6. 6.
    Eilam Tzoreff, T., Granot, D., Granot, F., Sošić, G.: The vehicle routing problem with pickups and deliveries on some special graphs. Discret. Appl. Math. 116, 193–229 (2002). Scholar
  7. 7.
    Golden, B.L., Raghavan, S., Wasil, E.A.: The vehicle routing problem: latest advances and new challenges. Springer, Boston, MA, USA (2008)CrossRefGoogle Scholar
  8. 8.
    Liu, S.C., Lin, C.C.: A heuristic method for the combined location routing and inventory problem. Int. J. Adv. Manuf. Technol. 26, 372–381 (2005). Scholar
  9. 9.
    Marinakis, Y., Iordanidou, G.-R., Marinaki, M.: Particle swarm optimization for the vehicle routing problem with stochastic demands. Appl. Soft Comput. 13, 1693–1704 (2013). Scholar
  10. 10.
    Miranda, D.M., Conceição, S.V.: The vehicle routing problem with hard time windows and stochastic travel and service time. Expert Syst. Appl. 64, 104–116 (2016). Scholar
  11. 11.
    Novoa, C., Storer, R.: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196, 509–515 (2009). Scholar
  12. 12.
    Özyurt, Z., Aksen, D.: Solving the multi-depot location-routing problem with lagrangian relaxation. In: Baker, E.K., Joseph, A., Mehrotra, A., Trick, M.A. (eds.) Extending the horizons: advances in computing, optimization, and decision technologies, pp. 125–144. Springer, Boston, MA, USA (2007)CrossRefGoogle Scholar
  13. 13.
    Shen, Y.M., Chen, R.M.: Optimal multi-depot location decision using particle swarm optimization. Adv. Mech. Eng. 9, 1–15 (2017). Scholar
  14. 14.
    Taillard, É., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170–186 (1997). Scholar
  15. 15.
    Taş, D., Gendreau, M., Dellaert, N., van Woensel, T., de Kok, A.G.: Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach. Eur. J. Oper. Res. 236, 789–799 (2014). Scholar
  16. 16.
    Tasan, A.S., Gen, M.: A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput. Ind. Eng. 62, 755–761 (2012). Scholar
  17. 17.
    Thangiah, S.R., Osman, I.H., Sun, T.: Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Comput. Sci. Dep. Slippery Rock Univ. Tech. Rep. SRU CpScTR9427. 1–37 (1993)Google Scholar
  18. 18.
    Tsirimpas, P., Tatarakis, A., Minis, I., Kyriakidis, E.G.: Single vehicle routing with a predefined customer sequence and multiple depot returns. Eur. J. Oper. Res. 187, 483–495 (2008). Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Department of Mechanical and Industrial EngineeringIndian Institute of Technology RoorkeeRoorkeeIndia
  2. 2.Department of Civil EngineeringIndian Institute of Technology RoorkeeRoorkeeIndia

Personalised recommendations