{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:16:33Z","timestamp":1767093393931,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534249"},{"type":"electronic","value":"9789811534256"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3425-6_49","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"622-633","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Meta-heuristic Hybrid Algorithmic Approach for Solving Combinatorial Optimization Problem (TSP)"],"prefix":"10.1007","author":[{"given":"Usman","family":"Ashraf","sequence":"first","affiliation":[]},{"given":"Jing","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Aleena","family":"Akhtar","sequence":"additional","affiliation":[]},{"given":"Kunjie","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Caitong","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Abdul Mannan","family":"Masood","sequence":"additional","affiliation":[]},{"given":"Muhammad","family":"Kashif","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ilavarasi, K., Joseph, K.: Variants of travelling salesman problem: a survey. In: International Conference on Information Communication and Embedded Systems, ICICES 2014 (2014)","key":"49_CR1","DOI":"10.1109\/ICICES.2014.7033850"},{"unstructured":"David, A., William, C.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics, pp. 1\u20135, 12\u201317. Princeton University Press, Princeton (2007)","key":"49_CR2"},{"issue":"2","key":"49_CR3","doi-asserted-by":"crossref","first-page":"390","DOI":"10.11591\/tijee.v15i2.1554","volume":"15","author":"M Malik","year":"2015","unstructured":"Malik, M., Iqbal, A.: Heuristic approaches to solve traveling salesman. TELKOMNIKA Indones. J. Electr. Eng. 15(2), 390\u2013396 (2015)","journal-title":"TELKOMNIKA Indones. J. Electr. Eng."},{"unstructured":"CO@W: History of the TSP. The Traveling Salesman Problem. Georgia Tech, October 2009. http:\/\/www.tsp.gatech.edu\/index.html","key":"49_CR4"},{"unstructured":"Amanur, R.: The Traveling Salesman problem, Indiana State University USA, 11 April 2012","key":"49_CR5"},{"issue":"3","key":"49_CR6","first-page":"621","volume":"2","author":"N Sureja","year":"2012","unstructured":"Sureja, N., Chawda, B.: Random travelling salesman problem using SA. Int. J. Emerg. Technol. Adv. Eng. 2(3), 621\u2013624 (2012)","journal-title":"Int. J. Emerg. Technol. Adv. Eng."},{"doi-asserted-by":"crossref","unstructured":"Wang, S., Zhao, A.: An improved hybrid genetic algorithm for traveling salesman problem. In: IEEE Proceedings of the International Conference on Computational Intelligence and Software Engineering (2009)","key":"49_CR7","DOI":"10.1109\/CISE.2009.5363568"},{"issue":"2","key":"49_CR8","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"49_CR9","first-page":"241","volume":"14","author":"P Tian","year":"2013","unstructured":"Tian, P., Yang, Z.: An improved simulated annealing algorithm with genetic characteristics and the traveling salesman problem. J. Inf. Optimiz. Sci. 14(3), 241\u2013255 (2013)","journal-title":"J. Inf. Optimiz. Sci."},{"issue":"6","key":"49_CR10","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/TEVC.2007.892762","volume":"11","author":"M Birattari","year":"2008","unstructured":"Birattari, M., Pellegrini, P., Dorigo, M.: On the invariance of ant colony optimization. IEEE Trans. Evol. Comput. 11(6), 732\u2013742 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"49_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-642-33021-6_19","volume":"451","author":"E Liz\u00e1rraga","year":"2013","unstructured":"Liz\u00e1rraga, E., Castillo, O., Soria, J.: A method to solve the traveling salesman problem using ant colony optimization variants with ant set partitioning. Stud. Comput. Intell. 451(1), 237\u2013246 (2013)","journal-title":"Stud. Comput. Intell."},{"issue":"6","key":"49_CR12","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ins.2011.03.013","volume":"192","author":"J Ho","year":"2012","unstructured":"Ho, J., Shih, H., Liao, B., Chu, S.: A ladder diffusion algorithm using ant colony optimization for wireless sensor networks. Inf. Sci. 192(6), 204\u2013212 (2012)","journal-title":"Inf. Sci."},{"issue":"1","key":"49_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cor.2012.05.007","volume":"40","author":"J Xiao","year":"2013","unstructured":"Xiao, J., Ao, X., Tang, Y.: Solving software project scheduling problems with ant colony optimization. Comput. Oper. Res. 40(1), 33\u201346 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"49_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-012-1078-5","volume":"194","author":"C Nothegger","year":"2012","unstructured":"Nothegger, C., Mayer, A., Chwatal, A., Raidl, G.: Solving the post enrolment course timetabling problem by ant colony optimization. Ann. Oper. Res. 194(1), 325\u2013339 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"49_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.compstruc.2013.04.012","volume":"123","author":"K Yoo","year":"2013","unstructured":"Yoo, K., Han, S.: A modified ant colony optimization algorithm for dynamic topology optimization. Comput. Struct. 123(4), 68\u201378 (2013)","journal-title":"Comput. Struct."},{"doi-asserted-by":"crossref","unstructured":"Yang, X., Wang, J.: Application of improved ant colony optimization algorithm on traveling salesman problem. In: IEEE 2017 International Conference on Robotics and Automation Sciences (ICRAS) (2017)","key":"49_CR16","DOI":"10.1109\/CCDC.2016.7531342"},{"doi-asserted-by":"crossref","unstructured":"Muhammad, K., Gao, S.: Comparative analysis of meta-heuristic algorithms for solving optimization problems. In: Advances in Intelligent Systems Research, volume 163, Proceedings of the 2018 8th International on Management, Education and Information, MEICI 2018 (2018)","key":"49_CR17","DOI":"10.2991\/meici-18.2018.121"},{"issue":"3","key":"49_CR18","first-page":"1","volume":"2015","author":"Y Deng","year":"2015","unstructured":"Deng, Y., Liu, Y., Zhou, D.: An improved genetic algorithm with initial population strategy for symmetric TSP. Math. Probl. Eng. 2015(3), 1\u20136 (2015)","journal-title":"Math. Probl. Eng."},{"issue":"11","key":"49_CR19","first-page":"1311","volume":"32","author":"Y Luo","year":"2009","unstructured":"Luo, Y., Lu, B., Liu, F.: Neighbor field method for population initialization of TSP. J. Chongqing Univ. 32(11), 1311\u20131315 (2009)","journal-title":"J. Chongqing Univ."},{"issue":"3","key":"49_CR20","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1504\/IJCAT.2017.084774","volume":"55","author":"A Hassanat","year":"2017","unstructured":"Hassanat, A., Alkafaween, E.: On enhancing genetic algorithms using new crossovers. Int. J. Comput. Appl. Technol. 55(3), 202\u2013212 (2017)","journal-title":"Int. J. Comput. Appl. Technol."},{"unstructured":"Noraini, M., John, G.: Genetic algorithm performance with different selection strategies in solving TSP. In: Proceedings of the World Congress on Engineering, WCE 2011, vol. 2, pp. 1134\u20131139 (2011)","key":"49_CR21"},{"issue":"3","key":"49_CR22","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1162\/EVCO_a_00006","volume":"18","author":"M Serpell","year":"2010","unstructured":"Serpell, M., Smith, J.: Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms. Evol. Comput. 18(3), 491\u2013514 (2010)","journal-title":"Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"Liu, J., Li, W.: Greedy permuting method for genetic algorithm on travelling salesman problem. In: IEEE 8th International Conference on Electronics Information and Emergency Communication (ICEIEC) (2018)","key":"49_CR23","DOI":"10.1109\/ICEIEC.2018.8473531"}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3425-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T07:21:07Z","timestamp":1666250467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_49","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"197","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"121","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}