Abstract
Multiple traveling salesman issues can model and resolve specific real-life applications including multiple scheduling, multiple vehicle routes and multiple track planning issues etc. Though traveling salesman challenges concentrate on finding a minimum travel distances route to reach all communities exactly again by each salesman, the goal of a MTSP is just to find routes for m sellers with a reduced total cost, the amount of the commute times of all sellers through the various metropolises covered. They must start by a designated hub which is the place of departure and delivery of all sellers. As the MTSP is an NP-hard problem, the new effective genetic methodology with regional operators is suggested to solve MTSP and deliver high-quality solutions for real-life simulations in a reasonable period of time. The new regional operators, crossover elimination, are designed for speed up searching process consolidation and increase the consistency of the response. Results show GAL finding a decent set of directions compared with two current MTSP protocols.
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
ChetanChudasama SMS, Panchal M (2011) Comparison of parents selection methods of genetic algorithm for TSP. In: International conference on computer communication and networks (CSI- OMNET)
Dwivedi TC, Saxena S, Agrawal P (2012) Travelling salesman problem using genetic algorithm. Int J Comput Appl (IJCA), 25–30
Naveen Kumar K, Kumar R (2012) A genetic algorithm approach to study travelling salesman problem. J Glob Res Comput Sci 3(3)
Philip A, Taofiki AA, Kehinde O (2011) A genetic algorithm for solving travelling salesman problem. Int J Adv Comput Sci Appl 2(1)
Brezina Jr I, Cickova Z (2011) Solving the travelling salesman problem using the ant colony optimization. Manag Inf Syst 6(4)
Al-Dulaimi BF, Ali HA (2008) Enhanced traveling salesman problem solving by genetic algorithm technique (TSPGA). World Academy of Science, Engineering and Technology, vol 14
Yang R (1997) Solving large travelling salesman problems with small populations. IEEE
Moon C, Kim J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140:606–617. Accepted 28 February 2001
Sankar Ray S, Bandyopadhyay S, Pal SK (2004) New operators of genetic algorithms for traveling salesman problem. IEEE
Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174:38–53
Karova M, Smarkov V, Penev S (2005) Genetic operators crossover and mutation in solving the TSP problem. In: International conference on computer systems and technologies - CompSysTech
Borovska P (2006) Solving the travelling salesman problem in parallel by genetic algorithm on multicomputer cluster. In: International conference on computer systems and technologies – CompSysTech
Ding C, Cheng Y, He M (2007) Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs. Tsinghua Science and Technology 12(4):459-465. ISSN 1007-0214 15/20
Shi XH, Liang YC, Lee HP, Lu C, Wang QX (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103:169–176
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Karimullah, S., Basha, S.J., Guruvyshnavi, P., Sathish Kumar Reddy, K., Navyatha, B. (2021). A Genetic Algorithm with Fixed Open Approach for Placements and Routings. In: Kumar, A., Mozar, S. (eds) ICCCE 2020. Lecture Notes in Electrical Engineering, vol 698. Springer, Singapore. https://doi.org/10.1007/978-981-15-7961-5_58
Download citation
DOI: https://doi.org/10.1007/978-981-15-7961-5_58
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-7960-8
Online ISBN: 978-981-15-7961-5
eBook Packages: EngineeringEngineering (R0)