{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:41:52Z","timestamp":1742974912337,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"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_52","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"662-672","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Adaptive Brain Storm Optimization Algorithm Based on Heuristic Operators for TSP"],"prefix":"10.1007","author":[{"given":"Yali","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaopeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjin","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liting","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"1","key":"52_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9(1), 61\u201363 (1962)","journal-title":"J. ACM"},{"issue":"2","key":"52_CR2","first-page":"22","volume":"5","author":"Q Sun","year":"2014","unstructured":"Sun, Q., Zhang, J., Wang, Y.: Ant colony algorithm optimization strategy review. Inf. Secur. Technol. 5(2), 22\u201323 (2014)","journal-title":"Inf. Secur. Technol."},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Xu, Y., Wu, Y., Fu, Y.: Discrete brain storm optimization algorithm based on prior knowledge for traveling salesman problems. In: 2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA), pp. 2740\u20132745. IEEE (2018)","DOI":"10.1109\/ICIEA.2018.8398175"},{"issue":"11","key":"52_CR4","first-page":"218","volume":"26","author":"F Bian","year":"2009","unstructured":"Bian, F.: An improved quantum particle swarm optimization for solving travelling salesman prom. Comput. Appl. Softw. 26(11), 218\u2013220 (2009)","journal-title":"Comput. Appl. Softw."},{"issue":"4","key":"52_CR5","first-page":"52","volume":"46","author":"J Su","year":"2010","unstructured":"Su, J., Wang, J.: Improved particle swarm optimization for traveling salesman problem. Comput. Eng. Appl. 46(4), 52\u201353 (2010)","journal-title":"Comput. Eng. Appl."},{"issue":"33","key":"52_CR6","first-page":"45","volume":"45","author":"L Tao","year":"2009","unstructured":"Tao, L., Guo, J.: Application of solving TSP based on improved genetic algorithm. Comput. Eng. Appl. 45(33), 45\u201347 (2009)","journal-title":"Comput. Eng. Appl."},{"key":"52_CR7","unstructured":"Gu, W.: Parallel performance of an ant colony optimization algorithm for TSP. In: International Conference on Intelligent Computation Technology & Automation. IEEE (2015)"},{"key":"52_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-21515-5_36","volume-title":"Advances in Swarm Intelligence","author":"Y Shi","year":"2011","unstructured":"Shi, Y.: Brain storm optimization algorithm. In: Tan, Y., Shi, Y., Chai, Y., Wang, G. (eds.) ICSI 2011. LNCS, vol. 6728, pp. 303\u2013309. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21515-5_36"},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-35380-2_56","volume-title":"Swarm, Evolutionary, and Memetic Computing","author":"KR Ramanand","year":"2012","unstructured":"Ramanand, K.R., Krishnanand, K.R., Panigrahi, B.K., Mallick, M.K.: Brain storming incorporated teaching\u2013learning\u2013based algorithm with application to electric power dispatch. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Nanda, P.K. (eds.) SEMCCO 2012. LNCS, vol. 7677, pp. 476\u2013483. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35380-2_56"},{"issue":"9","key":"52_CR10","first-page":"1583","volume":"32","author":"X Wu","year":"2017","unstructured":"Wu, X., Zhang, Z.: A brain storm optimization algorithm integrating diversity and discussion mechanism for solving discrete production scheduling problem. Control Decis. 32(9), 1583\u20131590 (2017)","journal-title":"Control Decis."},{"issue":"3","key":"52_CR11","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1007\/s11071-014-1579-7","volume":"78","author":"H Qiu","year":"2014","unstructured":"Qiu, H., Duan, H.: Receding horizon control for multiple UAV formation flight based on modified brain storm optimization. Nonlinear Dyn. 78(3), 1973\u20131988 (2014)","journal-title":"Nonlinear Dyn."},{"issue":"10","key":"52_CR12","doi-asserted-by":"publisher","first-page":"5336","DOI":"10.1109\/TMAG.2013.2262296","volume":"49","author":"H Duan","year":"2013","unstructured":"Duan, H., Li, S., Shi, Y.: Predator-prey brain storm optimization for DC brushless motor. IEEE Trans. Magn. 49(10), 5336\u20135340 (2013)","journal-title":"IEEE Trans. Magn."},{"key":"52_CR13","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-11680-8_29","volume-title":"Knowledge and Systems Engineering","author":"P Dinh Thanh","year":"2015","unstructured":"Dinh Thanh, P., Thi Thanh Binh, H., Thu Lam, B.: New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem. In: Nguyen, V.-H., Le, A.-C., Huynh, V.-N. (eds.) Knowledge and Systems Engineering. AISC, vol. 326, pp. 367\u2013379. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11680-8_29"},{"key":"52_CR14","unstructured":"Wu, Y., Jiao, S.: Theory and Application of Brainstorming Optimization Algorithm, pp. 1\u2013185. Science Press, Beijing (2017)"},{"key":"52_CR15","unstructured":"Manyawu, A.: An improved genetic algorithm using the convex hull for traveling salesman problem. In: IEEE International Conference on Systems (1998)"},{"issue":"8","key":"52_CR16","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/S0957-4158(97)00033-0","volume":"7","author":"S Meeran","year":"1997","unstructured":"Meeran, S.: Optimum path planning using convex hull and local search heuristic algorithms. Mechatronics 7(8), 737\u2013756 (1997)","journal-title":"Mechatronics"},{"issue":"6","key":"52_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(96)00125-1","volume":"59","author":"V De\u012dneko","year":"2012","unstructured":"De\u012dneko, V.: The convex-hull-and-k-line travelling salesman problem. Inf. Process. Lett. 59(6), 295\u2013301 (2012)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"52_CR18","first-page":"58","volume":"28","author":"J Chen","year":"2009","unstructured":"Chen, J.: Hybrid genetic algorithm based on strategy of greedy for TSP. J. Lanzhou Jiaotong Univ. 28(3), 58\u201361 (2009)","journal-title":"J. Lanzhou Jiaotong Univ."},{"issue":"3","key":"52_CR19","first-page":"37","volume":"23","author":"L Yang","year":"2012","unstructured":"Yang, L., Kong, F.: Self-adaptive selection strategy for artificial bee colony algorithm. J. Guangxi Univ. Technol. 23(3), 37\u201344 (2012)","journal-title":"J. Guangxi Univ. Technol."},{"key":"52_CR20","doi-asserted-by":"crossref","unstructured":"Li, K., Xu, F., Ping, H.: A new best-worst ant system with heuristic crossover operator for solving TSP. In: International Conference on Natural Computation. IEEE Computer Society (2009)","DOI":"10.1109\/ICNC.2009.109"}],"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_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:35:18Z","timestamp":1585791318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_52","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)"}}]}}