{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T18:02:44Z","timestamp":1751652164229,"version":"3.40.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076911"},{"type":"electronic","value":"9783319076928"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07692-8_9","type":"book-chapter","created":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T16:19:57Z","timestamp":1401380397000},"page":"89-97","source":"Crossref","is-referenced-by-count":14,"title":["A Performance Comparison of Genetic Algorithm\u2019s Mutation Operators in n-Cities Open Loop Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Hock Hung","family":"Chieng","sequence":"first","affiliation":[]},{"given":"Noorhaniza","family":"Wahid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Matai, R., Singh, S., Mittal, M.L.: Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches. Traveling Salesman Problem, Theory and Applications. InTech (2010)","DOI":"10.5772\/12909"},{"key":"9_CR2","unstructured":"Maredia, A.: History, Analysis, and Implementation of Traveling Salesman Problem (TSP) and Related Problems. Doctoral dissertation, University of Houston (2010)"},{"key":"9_CR3","unstructured":"Vashisht, V.: Open Loop Travelling Salesman Problem using Genetic Algorithm. International Journal of Innovative Research in Computer and Communication Engineering\u00a01(1) (2013)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Wang, X., Liu, D., Hou, M.: A novel method for multiple depot and open paths, Multiple Traveling Salesmen Problem. In: IEEE 11th International Symposium on Applied Machine Intelligence and Informatics (SAMI), pp. 187\u2013192 (2013)","DOI":"10.1109\/SAMI.2013.6480972"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.4236\/ajor.2012.22019","volume":"2","author":"S. Basu","year":"2012","unstructured":"Basu, S.: Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey. American Journal of Operations Research\u00a02(2), 163\u2013173 (2012)","journal-title":"American Journal of Operations Research"},{"key":"9_CR6","unstructured":"Yan, X., Zhang, C., Luo, W., Li, W., Chen, W., Liu, H.: Solve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm. International Journal of Computer Science, 264\u2013271 (2012)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Junjie, P., Dingwei, W.: An ant colony optimization algorithm for multiple travelling salesman problems. In: First International Conference on Innovative Computing, Information and Control, vol.\u00a01, pp. 210\u2013213. IEEE (2006)","DOI":"10.1109\/ICICIC.2006.40"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1016\/j.asoc.2012.04.008","volume":"13","author":"J. Bai","year":"2013","unstructured":"Bai, J., Yang, G.K., Chen, Y.W., Hu, L.S., Pan, C.C.: A model induced max-min ant colony optimization for asymmetric traveling salesman problem. Applied Soft Computing\u00a013(3), 1365\u20131375 (2013)","journal-title":"Applied Soft Computing"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F. Liu","year":"2009","unstructured":"Liu, F., Zeng, G.: Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Systems with Applications\u00a036(3), 6995\u20137001 (2009)","journal-title":"Expert Systems with Applications"},{"key":"9_CR10","series-title":"LNEE","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-34522-7_56","volume-title":"Proceedings of the 2012 International Conference on Information Technology and Software Engineering","author":"Y. Wang","year":"2013","unstructured":"Wang, Y., Tian, D., Li, Y.H.: An Improved Simulated Annealing Algorithm for Travelling Salesman Problem. In: Lu, W., Cai, G., Liu, W., Xing, W. (eds.) Proceedings of the 2012 International Conference on Information Technology and Software Engineering. LNEE, vol.\u00a0211, pp. 525\u2013532. Springer, Heidelberg (2013)"},{"issue":"4","key":"9_CR11","first-page":"607","volume":"2","author":"M.R. Bahaabadi","year":"2012","unstructured":"Bahaabadi, M.R., Mohaymany, A.S., Babaei, M.: An Efficient crossover operator for travelling salesman. International Journal of Optimization in Civil Engineering\u00a02(4), 607\u2013619 (2012)","journal-title":"International Journal of Optimization in Civil Engineering"},{"key":"9_CR12","unstructured":"Abdoun, O., Abouchabaka, J.: A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem.\u00a0arXiv preprint arXiv:1203.3097 (2012)"},{"key":"9_CR13","unstructured":"Sivanandam, S.N., Deepa, S.N.: Introduction to genetic algorithms. Springer (2007)"},{"key":"9_CR14","first-page":"471","volume":"52","author":"O.M. Sallabi","year":"2009","unstructured":"Sallabi, O.M., El-Haddad, Y.: An Improved Genetic Algorithm to Solve the Traveling Salesman Problem. World Academy of Science, Engineering and Technology\u00a052, 471\u2013474 (2009)","journal-title":"World Academy of Science, Engineering and Technology"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Geetha, R.R., Bouvanasilan, N., Seenuvasan, V.: A perspective view on Travelling Salesman Problem using genetic algorithm. In: Nature & Biologically Inspired Computing. World Congress, pp. 356\u2013361 (2009)","DOI":"10.1109\/NABIC.2009.5393321"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.5539\/cis.v4n2p39","volume":"4","author":"R. Malhotra","year":"2011","unstructured":"Malhotra, R., Singh, N., Singh, Y.: Genetic algorithms: Concepts, design for optimization of process controllers. Computer and Information Science\u00a04(2), 39\u201354 (2011)","journal-title":"Computer and Information Science"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Geetha, R.R., Bouvanasilan, N., Seenuvasan, V.: A perspective view on Travelling Salesman Problem using genetic algorithm. In: Nature & Biologically Inspired Computing. World Congress, pp. 356\u2013361. IEEE (2009)","DOI":"10.1109\/NABIC.2009.5393321"},{"issue":"5","key":"9_CR18","first-page":"3792","volume":"3","author":"R. Sivaraj","year":"2011","unstructured":"Sivaraj, R., Ravichandran, T.: A review of selection methods in genetic algorithm. International Journal of Engineering Science and Technology (IJEST)\u00a03(5), 3792\u20133797 (2011)","journal-title":"International Journal of Engineering Science and Technology (IJEST)"},{"key":"9_CR19","unstructured":"Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial intelligence through simulated evolution (1966)"},{"key":"9_CR20","unstructured":"Fogel, D.B.: Empirical estimation of the computation required to reach approximate solutions to the travelling salesman problem using evolutionary programming, vol.\u00a0685, pp. 56\u201361 (1993)"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF00203032","volume":"63","author":"D.B. Fogel","year":"1990","unstructured":"Fogel, D.B., Atmar, J.W.: Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems. Biological Cybernetics\u00a063(2), 111\u2013114 (1990)","journal-title":"Biological Cybernetics"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Fogel, D.B.: Evolutionary computation: toward a new philosophy of machine intelligence, vol.\u00a01. John Wiley & Sons (2006)","DOI":"10.1002\/0471749214"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Yong, S., Zenglu, L., Wenwei, L., Zhongkai, Y., Guangyun, L., Jirong, X.: The research and application on improved intelligence optimization algorithm based on knowledge base. In: 2012 International Conference on Computer Science and Electronics Engineering (ICCSEE), vol.\u00a03, pp. 661\u2013665. IEEE (2012)","DOI":"10.1109\/ICCSEE.2012.434"},{"key":"9_CR24","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The traveling salesman problem: a computational study. Princeton University Press (2011)"},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M. Albayrak","year":"2011","unstructured":"Albayrak, M., Allahverdi, N.: Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms. Expert Systems with Applications\u00a038(3), 1313\u20131320 (2011)","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"9_CR26","first-page":"4391","volume":"8","author":"Y. Chung","year":"2012","unstructured":"Chung, Y., Bae, C., Wahid, N., Liu, Y., Yeh, W.C.: A New Simplified Swarm Optimization (SSO) Using Exchange Local Search Scheme. International Journal of Innovative Computing, Information and Control\u00a08(6), 4391\u20134406 (2012)","journal-title":"International Journal of Innovative Computing, Information and Control"}],"container-title":["Advances in Intelligent Systems and Computing","Recent Advances on Soft Computing and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07692-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:57:23Z","timestamp":1746248243000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07692-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076911","9783319076928"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07692-8_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}