Abstract
In this paper, seven cities that have a direct connection link by Indian railways are modeled as a travelling salesman problem. Then genetic algorithm (GA) is used to solve it by considering three different objective functions, namely: distance, cost and time. For the implementation of GA, the fourth variation of order crossover (OX4) as proposed in Deep and Mebrahtu (Int J Comb Optim Probl Inform 2(3):1–23, 2011a) with inversion mutation and inverted displacement mutations are used. These are programmed in C++ and implemented on the distance, cost and time data obtained from the Indian railways. The minimum and maximum distances of travel, costs of travel and time taken to cover the stations are evaluated. According to the analysis of results that is based on numerical experimentations the sequence of choosing stations really matters. This is observed by the big difference between the minimum and maximum distance, cost and time of travel evaluated. Especially the difference between the minimum and maximum results of distance travelled and time taken to cover the tours is almost twice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas E, Christofides N (1981) A restricted Lagrangean approach to the travelling salesman problem. Math Program 21:19–46
Bellmore M, Nemhauser GL (1968) The traveling salesman problem: a survey. Oper Res 16:538–558
Bentley J (1992) Fast algorithms for geometric salesman problems. ORSA J Comput 4:387–411
Christofides N (1976) Worst-case analysis of a new Heuristic for the travelling salesman problem. Report 388, Graduate school of industrial administration, Carnegie Mellon University, February (1976)
Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581
Deep K, Mebrahtu H (2011a) Combined mutation operators of genetic algorithm for the travelling salesman problem. Int J Comb Optim Probl Inform 2(3):1–23
Deep K, Mebrahtu H (2011b) New variations of order crossover for travelling salesman problem. Int J Comb Optim Probl Inform 2(1):2–13
Deep K, Thakur M (2008) A real coded multi parent genetic algorithm for function optimization. J Hybrid Comput Res 1(2):67–83
Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the travelling salesman problem. IEEE Trans Evol Comput 1:53–66
Fiechter CN (1990) A parallel Tabu search algorithm for large scale travelling salesman problems. Working Paper 90/1, Département de Mathématiques, École Polytechnique, Fédérale de Lausanne
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman & co., New York
Gomez O, Banan B (2004) Reasons of ACO’s success in TSP, ant colony optimization and swarm intelligence. In: proceedings lecture notes in computer science, Vol. 3172, pp 226–237
Grötschel M, Holland O (1991) Solution of large-scale symmetric travelling salesman problems. Math Program 51:141–202
Johnson DS (1990) Local optimization and the travelling salesman problem. In: Goos G, Hartmanis J (eds) Automata, languages and programming. Lecture notes in computer science 443. New York, Springer-Verlag, pp 446–461
Johnson O, Liu J (2006) A travelling salesman approach for predicting protein functions. Source Code Biol Med 1(3):1–7
Karp RM (1977) Probabilistic analysis of partitioning algorithms for the travelling salesman problem in the plane. Math Oper Res 2:209–224
Kennedy J, Eberhart RC (2001) Swarm intelligence. Morgan Kauffman Publishers, San Francisco
Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:231–247
Lawler EL, Lenstra JK, Rinnooy AHGR, Shmoys DB (1985) The traveling salesman problem. Wiley, New York
Lo CC, Hus CC (1998) An annealing framework with learning memory. IEEE Trans Syst Man Cybern Part A 28:1–13
Michalewicz Z (1992) Genetic algorithms+data structures=evolution programs. Springer-Verlag, Berlin
Nguyen HD, Yoshihara I, Yamamori K, Yasunaga M (2007) Implementation of an effective hybrid GA for large-scale travelling salesman problems. IEEE Trans Syst Man Cybern—Part B Cybern 37:92–99
Ping Ji, William Ho (2005) The traveling salesman and the quadratic assignment problem: integration, modeling and genetic algorithm, In: International symposium on OR and its applications, pp 198–205
Ray SS, Bandyopadhyay S, Pal SK (2007) Gene ordering in partitive clustering using microarray expressions. J Biosci 32(5):1019–1025
Rosenkrantz D, Sterns RE, Lewis PM (1977) An analysis of several heuristics for the travelling salesman problem. SIAM J Comput 6:563–581
Shubhra SR, Sanghamitra B, Pal Sankar K (2004) New operators of genetic algorithms for traveling salesman problem. IEEE, 0-7695-2128-2/04
Tsai CF, Tsai CW, Tseng CC (2003) A new and efficient ant-based heuristic method for solving the travelling salesman problem. Expert Syst 20:179–186
TSPLIB: (http://www.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB95/)
Ulder NLJ, Aarts EHL, Bandelt HJ, Van Laarhoven PJM, Pesch E (1991) Genetic salesman local search algorithms for the travelling problem. In: Schwefel HP, Manner R (eds) Parallel problem-solving from nature. Lecture notes in computer science 496. Springer-Verlag, Berlin, pp 109–116
Van Laarhoven P, Aarts EHL (1987) Simulated annealing: theory and applications. Kluwer Academic, Dordrecht
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Deep, K., Mebrahtu, H. & Nagar, A.K. Novel GA for metropolitan stations of Indian railways when modelled as a TSP. Int J Syst Assur Eng Manag 9, 639–645 (2018). https://doi.org/10.1007/s13198-014-0328-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13198-014-0328-0