{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T22:06:21Z","timestamp":1749247581129,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319116792"},{"type":"electronic","value":"9783319116808"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-11680-8_29","type":"book-chapter","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T17:25:41Z","timestamp":1412011541000},"page":"367-379","source":"Crossref","is-referenced-by-count":12,"title":["New Mechanism of Combination Crossover Operators in Genetic Algorithm for Solving the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Pham","family":"Dinh Thanh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh","family":"Thi Thanh Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bui","family":"Thu Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing Natural Computing. Series, 1st edn. Springer (2003)","DOI":"10.1007\/978-3-662-05094-1_1"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"L.V. Snyder","year":"2006","unstructured":"Snyder, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research\u00a0174, 38\u201353 (2006)","journal-title":"European Journal of Operational Research"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/3-540-36970-8_34","volume-title":"Evolutionary Multi-Criterion Optimization","author":"L. Paquete","year":"2003","unstructured":"Paquete, L., St\u00fctzle, T.: A two-phase local search for the biobjective traveling salesman problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol.\u00a02632, pp. 479\u2013493. Springer, Heidelberg (2003)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Neissi, N.A., Mazloom, M.: GLS Optimization Algorithm for Solving Travelling Salesman Problem. In: Second Int. Conf. on Computer and Electrical Engineering, vol.\u00a01, pp. 291\u2013294. IEEE Press (2009)","DOI":"10.1109\/ICCEE.2009.102"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1007\/3-540-61723-X_1052","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"F. Bernd","year":"1996","unstructured":"Bernd, F., Peter, M.: New Genetic Local Search Operators Traveling Salesman Problem. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol.\u00a01141, pp. 890\u2013899. Springer, Heidelberg (1996)"},{"key":"29_CR7","unstructured":"Freisleben, B., Merz, P.: New Genetic Local Search for the TSP: New Results. In: Int. Conf. on Evolutionary Computation, pp. 159\u2013164. IEEE Press (1997)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Freisleben, B., Merz, P.: A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. In: Int. Conf. on Evolutionary Computation, pp. 616\u2013621. IEEE Press (1996)","DOI":"10.1109\/ICEC.1996.542671"},{"key":"29_CR9","unstructured":"TSPLIB, http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Renders, J.M., Bersini, H.: Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways. In: IEEE World Congress on Computational Intelligence, vol.\u00a01, pp. 312\u2013317. IEEE Press (1994)","DOI":"10.1109\/ICEC.1994.349948"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Jih, W.-R., Hsu, J.Y.-J.: Dynamic vehicle routing using hybrid genetic algorithms. In: Int. Conf. on Robotics & Automation, vol.\u00a01, pp. 453\u2013458. IEEE Press (1999)","DOI":"10.1109\/ROBOT.1999.770019"},{"key":"29_CR12","first-page":"497","volume-title":"ICPR 2004","author":"S.S. Ray","year":"2004","unstructured":"Ray, S.S., Bandyopadhyay, S., Pal, S.K.: New operators of genetic algorithms for traveling salesman problem. In: ICPR 2004, vol.\u00a02, pp. 497\u2013500. Cambridge, UK (2004)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Larranaga, P., Kuijpers, C., Murga, R., Inza, I., Dizdarevic, S.: Genetic algorithms for the traveling salesman problem: A review of representations and operators. In: Artificial Intelligence, vol.\u00a013, pp. 129\u2013170. Kluwer Academic Publishers (1999)","DOI":"10.1023\/A:1006529012972"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics\u00a010, 196\u2013210 (1962)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"29_CR15","unstructured":"Haykin, S.: Neural Networks: A Comprehensive Foundation, 2nd edn. Prentice-Hall (1999)"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)00301-7","volume":"92","author":"M. Yagiura","year":"1996","unstructured":"Yagiura, M., Ibaraki, T.: The Use of Dynamic Programming in Genetic Algorithms for Permutation Problems. European Journal of Operational Research\u00a092, 387\u2013401 (1996)","journal-title":"European Journal of Operational Research"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Murat, A., Novruz, A.: Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms. In: Expert Systems with Applications, vol.\u00a038, pp. 1313\u20131320. ScienceDirect (2011)","DOI":"10.1016\/j.eswa.2010.07.006"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-34413-8_9","volume-title":"Learning and Intelligent Optimization","author":"O. Mersmann","year":"2012","unstructured":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., Neumann, F.: Local search and the traveling salesman problem: A feature-based characterization of problem hardness. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, vol.\u00a07219, pp. 115\u2013129. Springer, Heidelberg (2012)"},{"key":"29_CR19","first-page":"6622","volume":"3","author":"S. Sourav","year":"2011","unstructured":"Sourav, S., Anwesha, D., Satrughna, S.: Solution of traveling salesman problem on scx based selection with performance analysis using Genetic Algorithm. International Journal of Engineering Science and Technology (IJEST)\u00a03, 6622\u20136629 (2011)","journal-title":"International Journal of Engineering Science and Technology (IJEST)"},{"key":"29_CR20","first-page":"2014","volume":"3","author":"M. Sehrawat","year":"2011","unstructured":"Sehrawat, M., Singh, S.: Modified Order Crossover (OX) Operator. International Journal on Computer Science & Engineering\u00a03, 2014\u20132019 (2011)","journal-title":"International Journal on Computer Science & Engineering"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/11590316_98","volume-title":"Pattern Recognition and Machine Intelligence","author":"S.S. Ray","year":"2005","unstructured":"Ray, S.S., Bandyopadhyay, S., Pal, S.K.: New genetic operators for solving TSP: Application to microarray gene ordering. In: Pal, S.K., Bandyopadhyay, S., Biswas, S. (eds.) PReMI 2005. LNCS, vol.\u00a03776, pp. 617\u2013622. Springer, Heidelberg (2005)"},{"key":"29_CR22","first-page":"530","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. Proceedings of World Academy of Science: Engineering & Technology\u00a052, 530\u2013533 (2009)","journal-title":"Proceedings of World Academy of Science: Engineering & Technology"},{"key":"29_CR23","first-page":"2","volume":"2","author":"D. Kusum","year":"2011","unstructured":"Kusum, D., Hadush, M.: New Variations of Order Crossover for Travelling Salesman Problem. Int. Journal of Combinatorial Optimization Problems and Informatics\u00a02, 2\u201313 (2011)","journal-title":"Int. Journal of Combinatorial Optimization Problems and Informatics"},{"key":"29_CR24","first-page":"96","volume":"3","author":"H.A. Zakir","year":"2010","unstructured":"Zakir, H.A.: Genetic Algorithm for the Traveling Salesman Problem using Sequential Constructive Crossover Operator. Int. Journal of Biometric and Bioinformatics\u00a03, 96\u2013106 (2010)","journal-title":"Int. Journal of Biometric and Bioinformatics"},{"key":"29_CR25","first-page":"134","volume":"12","author":"S.M. Abdel-Moetty","year":"2012","unstructured":"Abdel-Moetty, S.M., Heakil, A.O.: Enhanced Traveling Salesman Problem Solving using Genetic Algorithm Technique with modified Sequential Constructive Crossover Operator. Int. Journal of Computer Science and Network Security\u00a012, 134\u2013139 (2012)","journal-title":"Int. Journal of Computer Science and Network Security"}],"container-title":["Advances in Intelligent Systems and Computing","Knowledge and Systems Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11680-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T22:15:46Z","timestamp":1746396946000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11680-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319116792","9783319116808"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11680-8_29","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}