{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:21:24Z","timestamp":1742912484697,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811613531"},{"type":"electronic","value":"9789811613548"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-981-16-1354-8_42","type":"book-chapter","created":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T08:02:49Z","timestamp":1617177769000},"page":"611-623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Urban Light Rail Route Planning Based on Probe Machine"],"prefix":"10.1007","author":[{"given":"Xiang","family":"Tian","sequence":"first","affiliation":[]},{"given":"Xiyu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,1]]},"reference":[{"issue":"3","key":"42_CR1","first-page":"144","volume":"25","author":"J Bao","year":"2010","unstructured":"Bao, J., Lu, L., Ji, Z.: Tourism transportation optimization and tour route designing of north anhui province based on the kruskal algorithm of graph-theory. Hum. Geogr. 25(3), 144\u2013148 (2010)","journal-title":"Hum. Geogr."},{"issue":"18","key":"42_CR2","first-page":"4236","volume":"9","author":"Z Yang","year":"2013","unstructured":"Yang, Z., Shi, W., Peng, J.: Application of kruskal algorithm based on union-find sets in subway planning. Comput. Knowl. Technol. 9(18), 4236\u20134238 (2013)","journal-title":"Comput. Knowl. Technol."},{"issue":"08","key":"42_CR3","first-page":"132","volume":"2017","author":"M Pan","year":"2017","unstructured":"Pan, M.: Application of minimum spanning tree and kruskal algorithm in city planning. Digit. Technol. Appl. 2017(08), 132 (2017)","journal-title":"Digit. Technol. Appl."},{"issue":"3","key":"42_CR4","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1080\/13658816.2017.1384830","volume":"32","author":"B Wu","year":"2017","unstructured":"Wu, B., et al.: An extended minimum spanning tree method for characterizing local urban patterns. Int. J. Geogr. Inf. Sci. 32(3), 450\u2013475 (2017)","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"42_CR5","unstructured":"Benvenuti, C.: Bridging: spanning tree protocol. In: Understanding Linux Network Internals. O\u2019Reilly Media, Inc. (2006)"},{"issue":"7","key":"42_CR6","doi-asserted-by":"publisher","first-page":"948","DOI":"10.3390\/en10070948","volume":"10","author":"C Li","year":"2017","unstructured":"Li, C., He, J., Zhang, P., Xu, Y.: A novel sectionalizing method for power system parallel restoration based on minimum spanning tree. Energies 10(7), 948 (2017)","journal-title":"Energies"},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/rsa.20831","volume":"55","author":"M Graaf","year":"2019","unstructured":"Graaf, M., Boucherie, R.J., Hurink, J.L., van Ommeren, J.-K.: An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Random Struct. Algorithms 55(1), 89\u2013103 (2019)","journal-title":"Random Struct. Algorithms"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"71585","DOI":"10.1109\/ACCESS.2019.2917601","volume":"7","author":"Z Ren","year":"2019","unstructured":"Ren, Z., Li, H., Liu, Y., Xu, Y., Jin, L., Li, W., et al.: Alterable weight minimum spanning tree method for electrical collector system planning. IEEE Access 7, 71585\u201371592 (2019)","journal-title":"IEEE Access"},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"639","DOI":"10.3389\/fnins.2017.00639","volume":"11","author":"H Guo","year":"2017","unstructured":"Guo, H., Liu, L., Chen, J., Xu, Y., Jie, X.: Alzheimer classification using a minimum spanning tree of high-order functional network on fmri dataset. Front. Neurosci. 11, 639 (2017)","journal-title":"Front. Neurosci."},{"issue":"5","key":"42_CR10","doi-asserted-by":"publisher","first-page":"783","DOI":"10.3390\/rs12050783","volume":"12","author":"W Lin","year":"2020","unstructured":"Lin, W., Li, Y.: Parallel regional segmentation method of high-resolution remote sensing image based on minimum spanning tree. Remote Sens. 12(5), 783 (2020)","journal-title":"Remote Sens."},{"issue":"6","key":"42_CR11","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1587\/transinf.2017EDL8235","volume":"E101.D","author":"L Xu","year":"2018","unstructured":"Xu, L., Luo, B., Pei, Z.: Boundary-aware superpixel segmentation based on minimum spanning tree. IEICE Trans. Inf. Syst. E101.D(6), 1715\u20131719 (2018)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"43707","DOI":"10.1109\/ACCESS.2019.2904995","volume":"7","author":"J Huang","year":"2019","unstructured":"Huang, J., Xu, R., Cheng, D., Zhang, S., Shang, K.: A novel hybrid clustering algorithm based on minimum spanning tree of natural core points. IEEE Access 7, 43707\u201343720 (2019)","journal-title":"IEEE Access"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.eswa.2019.04.048","volume":"132","author":"G Mishra","year":"2019","unstructured":"Mishra, G., Mohanty, S.K.: A fast hybrid clustering technique based on local nearest neighbor using minimum spanning tree. Expert Syst. Appl. 132, 28\u201343 (2019)","journal-title":"Expert Syst. Appl."},{"key":"42_CR14","first-page":"1","volume":"2018","author":"X Lv","year":"2018","unstructured":"Lv, X., Ma, Y., He, X., Huang, H., Yang, J.: Ccimst: A clustering algorithm based on minimum spanning tree and cluster centers. Math. Prob. Eng. 2018, 1\u201314 (2018)","journal-title":"Math. Prob. Eng."},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"RJ Lipton","year":"1995","unstructured":"Lipton, R.J.: DNA solution of hard computational problems. Science 268, 542\u2013545 (1995)","journal-title":"Science"},{"issue":"4","key":"42_CR17","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1089\/cmb.1998.5.615","volume":"5","author":"S Roweis","year":"1998","unstructured":"Roweis, S., et al.: A sticker-based model for DNA computation. J. Comput. Biol. 5(4), 615\u2013629 (1998)","journal-title":"J. Comput. Biol."},{"issue":"6693","key":"42_CR18","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E Winfree","year":"1998","unstructured":"Winfree, E., Liu, F., Wenzler, L.A., Seeman, N.C.: Design and self-assembly of two-dimensional DNA crystals. Nature 394(6693), 539\u2013544 (1998)","journal-title":"Nature"},{"issue":"2","key":"42_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1089\/cmb.1998.5.255","volume":"5","author":"LM Smith","year":"1998","unstructured":"Smith, L.M., et al.: A surface-based approach to DNA computation. J. Comput. Biol. 5(2), 255\u2013267 (1998)","journal-title":"J. Comput. Biol."},{"issue":"5469","key":"42_CR20","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1126\/science.288.5469.1223","volume":"288","author":"K Sakamoto","year":"2000","unstructured":"Sakamoto, K., et al.: Molecular computation by DNA hairpin formation. Science 288(5469), 1223\u20131226 (2000)","journal-title":"Science"},{"issue":"1","key":"42_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.eng.2018.02.011","volume":"4","author":"J Xu","year":"2018","unstructured":"Xu, J., Qiang, X., Zhang, K., Zhang, C., Yang, J.: A DNA computing model for the graph vertex coloring problem based on a probe graph. Engineering 4(1), 61\u201377 (2018)","journal-title":"Engineering"},{"issue":"7","key":"42_CR22","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1109\/TNNLS.2016.2555845","volume":"27","author":"J Xu","year":"2016","unstructured":"Xu, J.: Probe machine. IEEE Trans. Neural Netw. Learn. Syst. 27(7), 1405\u20131416 (2016)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"42_CR23","first-page":"36","volume":"37","author":"S Sha","year":"2016","unstructured":"Sha, S., Chen, Y.: Probe model for solving travelling salesman problem. J. Huaibei Normal Univ. Nat. Sci. 37(2), 36\u201339 (2016)","journal-title":"J. Huaibei Normal Univ. Nat. Sci."},{"key":"42_CR24","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-981-10-3611-8_6","volume-title":"Bio-inspired Computing \u2013 Theories and Applications","author":"J Yang","year":"2016","unstructured":"Yang, J., Yin, Z.: The working operation problem based on probe machine model. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds.) BIC-TA 2016. CCIS, vol. 681, pp. 47\u201353. Springer, Singapore (2016). https:\/\/doi.org\/10.1007\/978-981-10-3611-8_6"},{"key":"42_CR25","first-page":"1","volume":"2019","author":"J Sun","year":"2019","unstructured":"Sun, J., Dong, H., Kong, Y., Fang, Y.: Solution to shortest path problem using a connective probe machine. Math. Probl. Eng. 2019, 1\u20138 (2019)","journal-title":"Math. Probl. Eng."},{"issue":"6","key":"42_CR26","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"42_CR27","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J Kruskal","year":"1956","unstructured":"Kruskal, J.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."}],"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-16-1354-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T18:05:04Z","timestamp":1617213904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-16-1354-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811613531","9789811613548"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-1354-8_42","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 April 2021","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":"Qingdao","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2020.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":"109","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":"43","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":"39% - 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":"4","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)"}}]}}