Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
Balakrishnan, N.: Simple heuristics for the vehicle routeing problem with soft time windows. J. Oper. Res. Soc. 44, 279–287 (1993). https://doi.org/10.2307/2584198
Ceselli, A., Righini, G., Salani, M.: A column generation algorithm for a rich vehicle-routing problem. Transp. Sci. 43, 56–69 (2009). https://doi.org/10.1287/trsc.1080.0256
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). https://doi.org/10.1057/palgrave.jors.2601791
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). https://doi.org/10.1016/j.procs.2014.05.076
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). https://doi.org/10.1016/S0166-218X(00)00283-3
Golden, B.L., Raghavan, S., Wasil, E.A.: The vehicle routing problem: latest advances and new challenges. Springer, Boston, MA, USA (2008)
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). https://doi.org/10.1007/s00170-003-2005-3
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). https://doi.org/10.1016/j.asoc.2013.01.007
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). https://doi.org/10.1016/j.eswa.2016.07.022
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). https://doi.org/10.1016/j.ejor.2008.03.023
Ö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)
Shen, Y.M., Chen, R.M.: Optimal multi-depot location decision using particle swarm optimization. Adv. Mech. Eng. 9, 1–15 (2017). https://doi.org/10.1177/1687814017717663
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). https://doi.org/10.1287/trsc.31.2.170
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). https://doi.org/10.1016/j.ejor.2013.05.024
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). https://doi.org/10.1016/j.cie.2011.11.025
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)
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). https://doi.org/10.1016/j.ejor.2007.03.017
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Rathore, N., Jain, P.K., Parida, M. (2020). A MATLAB-Based Application to Solve Vehicle Routing Problem Using GA. In: Shunmugam, M., Kanthababu, M. (eds) Advances in Simulation, Product Design and Development. Lecture Notes on Multidisciplinary Industrial Engineering. Springer, Singapore. https://doi.org/10.1007/978-981-32-9487-5_22
Download citation
DOI: https://doi.org/10.1007/978-981-32-9487-5_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-32-9486-8
Online ISBN: 978-981-32-9487-5
eBook Packages: EngineeringEngineering (R0)