{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:00:47Z","timestamp":1760608847661},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,12]],"date-time":"2014-12-12T00:00:00Z","timestamp":1418342400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J  Syst  Assur  Eng  Manag"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s13198-014-0328-0","type":"journal-article","created":{"date-parts":[[2014,12,11]],"date-time":"2014-12-11T08:59:47Z","timestamp":1418288387000},"page":"639-645","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Novel GA for metropolitan stations of Indian railways when modelled as a TSP"],"prefix":"10.1007","volume":"9","author":[{"given":"Kusum","family":"Deep","sequence":"first","affiliation":[]},{"given":"Hadush","family":"Mebrahtu","sequence":"additional","affiliation":[]},{"given":"Atulya K.","family":"Nagar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,12]]},"reference":[{"key":"328_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","volume":"21","author":"E Balas","year":"1981","unstructured":"Balas E, Christofides N (1981) A restricted Lagrangean approach to the travelling salesman problem. Math Program 21:19\u201346","journal-title":"Math Program"},{"key":"328_CR2","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore M, Nemhauser GL (1968) The traveling salesman problem: a survey. Oper Res 16:538\u2013558","journal-title":"Oper Res"},{"key":"328_CR3","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J Bentley","year":"1992","unstructured":"Bentley J (1992) Fast algorithms for geometric salesman problems. ORSA J Comput 4:387\u2013411","journal-title":"ORSA J Comput"},{"key":"328_CR4","unstructured":"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)"},{"key":"328_CR5","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568\u2013581","journal-title":"Oper Res"},{"issue":"3","key":"328_CR6","first-page":"1","volume":"2","author":"K Deep","year":"2011","unstructured":"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\u201323","journal-title":"Int J Comb Optim Probl Inform"},{"issue":"1","key":"328_CR7","first-page":"2","volume":"2","author":"K Deep","year":"2011","unstructured":"Deep K, Mebrahtu H (2011b) New variations of order crossover for travelling salesman problem. Int J Comb Optim Probl Inform 2(1):2\u201313","journal-title":"Int J Comb Optim Probl Inform"},{"issue":"2","key":"328_CR8","first-page":"67","volume":"1","author":"K Deep","year":"2008","unstructured":"Deep K, Thakur M (2008) A real coded multi parent genetic algorithm for function optimization. J Hybrid Comput Res 1(2):67\u201383","journal-title":"J Hybrid Comput Res"},{"key":"328_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the travelling salesman problem. IEEE Trans Evol Comput 1:53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"328_CR10","unstructured":"Fiechter CN (1990) A parallel Tabu search algorithm for large scale travelling salesman problems. Working Paper 90\/1, D\u00e9partement de Math\u00e9matiques, \u00c9cole Polytechnique, F\u00e9d\u00e9rale de Lausanne"},{"key":"328_CR11","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman & co., New York"},{"key":"328_CR12","unstructured":"Gomez O, Banan B (2004) Reasons of ACO\u2019s success in TSP, ant colony optimization and swarm intelligence. In: proceedings lecture notes in computer science, Vol. 3172, pp 226\u2013237"},{"key":"328_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel M, Holland O (1991) Solution of large-scale symmetric travelling salesman problems. Math Program 51:141\u2013202","journal-title":"Math Program"},{"key":"328_CR14","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Automata, languages and programming. Lecture notes in computer science 443","author":"DS Johnson","year":"1990","unstructured":"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\u2013461"},{"issue":"3","key":"328_CR15","first-page":"1","volume":"1","author":"O Johnson","year":"2006","unstructured":"Johnson O, Liu J (2006) A travelling salesman approach for predicting protein functions. Source Code Biol Med 1(3):1\u20137","journal-title":"Source Code Biol Med"},{"key":"328_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"RM Karp","year":"1977","unstructured":"Karp RM (1977) Probabilistic analysis of partitioning algorithms for the travelling salesman problem in the plane. Math Oper Res 2:209\u2013224","journal-title":"Math Oper Res"},{"key":"328_CR17","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart RC (2001) Swarm intelligence. Morgan Kauffman Publishers, San Francisco"},{"key":"328_CR18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:231\u2013247","journal-title":"Eur J Oper Res"},{"key":"328_CR19","volume-title":"The traveling salesman problem","author":"EL Lawler","year":"1985","unstructured":"Lawler EL, Lenstra JK, Rinnooy AHGR, Shmoys DB (1985) The traveling salesman problem. Wiley, New York"},{"key":"328_CR20","first-page":"1","volume":"28","author":"CC Lo","year":"1998","unstructured":"Lo CC, Hus CC (1998) An annealing framework with learning memory. IEEE Trans Syst Man Cybern Part A 28:1\u201313","journal-title":"IEEE Trans Syst Man Cybern Part A"},{"key":"328_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic algorithms+data structures=evolution programs","author":"Z Michalewicz","year":"1992","unstructured":"Michalewicz Z (1992) Genetic algorithms+data structures=evolution programs. Springer-Verlag, Berlin"},{"key":"328_CR22","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TSMCB.2006.880136","volume":"37","author":"HD Nguyen","year":"2007","unstructured":"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\u2014Part B Cybern 37:92\u201399","journal-title":"IEEE Trans Syst Man Cybern\u2014Part B Cybern"},{"key":"328_CR23","unstructured":"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\u2013205"},{"issue":"5","key":"328_CR24","first-page":"1019","volume":"32","author":"SS Ray","year":"2007","unstructured":"Ray SS, Bandyopadhyay S, Pal SK (2007) Gene ordering in partitive clustering using microarray expressions. J Biosci 32(5):1019\u20131025","journal-title":"J Biosci"},{"key":"328_CR25","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D Rosenkrantz","year":"1977","unstructured":"Rosenkrantz D, Sterns RE, Lewis PM (1977) An analysis of several heuristics for the travelling salesman problem. SIAM J Comput 6:563\u2013581","journal-title":"SIAM J Comput"},{"key":"328_CR26","unstructured":"Shubhra SR, Sanghamitra B, Pal Sankar K (2004) New operators of genetic algorithms for traveling salesman problem. IEEE, 0-7695-2128-2\/04"},{"key":"328_CR27","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/1468-0394.00242","volume":"20","author":"CF Tsai","year":"2003","unstructured":"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\u2013186","journal-title":"Expert Syst"},{"key":"328_CR30","unstructured":"TSPLIB: (\n                        http:\/\/www.iwr.uniheidelberg.de\/groups\/comopt\/software\/TSPLIB95\/\n                        \n                    )"},{"key":"328_CR28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BFb0029740","volume-title":"Parallel problem-solving from nature. Lecture notes in computer science 496","author":"NLJ Ulder","year":"1991","unstructured":"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\u2013116"},{"key":"328_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing: theory and applications","author":"P Laarhoven Van","year":"1987","unstructured":"Van Laarhoven P, Aarts EHL (1987) Simulated annealing: theory and applications. Kluwer Academic, Dordrecht"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-014-0328-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13198-014-0328-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-014-0328-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-014-0328-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T14:48:47Z","timestamp":1559486927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13198-014-0328-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["328"],"URL":"https:\/\/doi.org\/10.1007\/s13198-014-0328-0","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"value":"0975-6809","type":"print"},{"value":"0976-4348","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,12]]}}}