Abstract
Vehicle Routing Problem being a combinatorial class of problems has implications in various areas and applications where traditional methods to find a search space either fail or slow down especially in case of real time systems. Using the most popular heuristic searching approach, Genetic Algorithm, there have been solutions in the state of the art to the problems like Vehicle Routing, Traveling Sales Person, etc. In this paper, a parallelized version of genetic algorithm has been proposed for vehicle routing problem over OpenMP programming model. The problem has been solved taking into consideration the constraint that congested cities of the network have been pushed behind after obtaining a fit set of chromosomes in every iteration so that as the time pass by the load sheds on the cities and we optimize in terms of time as well. The concept can very well be mapped to the network routing problem as well. Experimental results show that the efficiency of the proposed model is high in comparison to the serial version where the machine certainly meets the restrictions in terms of execution and processing power to get the intensive computations done as the number of cities or nodes in the network increases. Finally, the paper sums up with the future endeavors of the problem with more complex constraints getting involved to fetch the best possible route and how parallel processing must deliver such solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27.6:17–26
Lin Y, Li W, Qiu F, Xu H (2012) Research on optimization of vehicle routing problem for ride-sharing taxi. Procedia-Soc Behav Sci 43:494–502
Nazif H, Lee LS (2012) Optimized crossover genetic algorithm for capacitated vehicle routing problem. Appl Math Model 36(5):2110–2117
Masum AKM, Shah Jalal M, Faruque F, Sarker IH (2011) Solving the vehicle routing problem using genetic algorithm. Int J Advanc Comput Sci Appl 2(7):126–131
Chand P, Mohanty JR (2013) A multi-objective vehicle routing problem using dominant rank method. Int J Comput Appl 29–34
Cooray PLNU, Rupasinghe TD (2017) Machine learning-based parameter tuned genetic algorithm for energy minimizing vehicle routing problem. J Indust Eng
Nazif H, Lee LS (2010) Optimized crossover genetic algorithm for vehicle routing problem with time windows. Am J Appl Sci 7(1):95
Alba E, Dorronsoro B (2004) Solving the vehicle routing problem by using cellular genetic algorithms. In: EvoCOP vol 3004, pp 11–20
Saxena R, Jain M, Bhadri S, Khemka S (2017) Parallelizing GA based heuristic approach for TSP over CUDA and OPENMP. In: Advances in computing, communications and informatics (ICACCI), pp 1934–1940. IEEE
Roberge V, Tarbouchi M, Labonté G (2018) Fast genetic algorithm path planner for fixed-wing military UAV using GPU. IEEE Trans Aerospace Electron Syst
Rey A, Prieto M, Gómez JI, Tenllado C, Hidalgo JI (2018) A CPU-GPU parallel ant colony optimization solver for the vehicle routing problem. In: International conference on the applications of evolutionary computation. Springer, Cham, pp 653–667
Mustafa B, Ahmed W Parallel algorithm performance analysis using OpenMP for multicore machines. Int J Advanc Comput Technol (IJACT), ISSN 2319–7900
Saxena R, Jain M, Singh D, Kushwah A (2017) An enhanced parallel version of RSA public key crypto based algorithm using OpenMP. In: 10th international conference on security of information and networks (SIN). ACM, pp 37–42
Jain M, Saxena R Parallelization of video summarization over multi-core processors. Int J Pure Appl Math 118(9):571–584. ISSN 1311-8080
Jean-Yves et al (1996) Genetic algorithms for the traveling salesman problem. Ann Operat Res 63:339–370
Jain M, Saxena R (2017) Overview of VANET: requirements and its routing protocols. In: 2017 International conference on communication and signal processing (ICCSP). IEEE, pp 1957–1961
Saxena R, Jain M, Yaqub SM (2018) Sudoku Game Solving Approach Through Parallel Processing. In: Proceedings of the Second International Conference on Computational Intelligence and Informatics. Springer, Singapore, pp 447–455
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Saxena, R., Jain, M., Kumar, A., Jain, V., Sadana, T., Jaidka, S. (2019). An Improved Genetic Algorithm Based Solution to Vehicle Routing Problem over OpenMP with Load Consideration. In: Bera, R., Sarkar, S., Singh, O., Saikia, H. (eds) Advances in Communication, Devices and Networking. Lecture Notes in Electrical Engineering, vol 537. Springer, Singapore. https://doi.org/10.1007/978-981-13-3450-4_32
Download citation
DOI: https://doi.org/10.1007/978-981-13-3450-4_32
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-3449-8
Online ISBN: 978-981-13-3450-4
eBook Packages: EngineeringEngineering (R0)