{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:36:33Z","timestamp":1743035793703,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811555763"},{"type":"electronic","value":"9789811555770"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-981-15-5577-0_4","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T13:02:46Z","timestamp":1590411766000},"page":"46-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization Design of Multi-layer Logistics Network Based on Self-Adaptive Gene Expression Programming"],"prefix":"10.1007","author":[{"given":"Huazhi","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Kangshun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Runxuan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xinyao","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Zhanbiao","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.cie.2008.01.001","volume":"55","author":"Z Wang","year":"2008","unstructured":"Wang, Z., Zhang, Q., Yang, B., He, W.: 4\/R\/I\/T distribution logistics network 0-1 programming model and application. Comput. Ind. Eng. 55(2), 365\u2013378 (2008)","journal-title":"Comput. Ind. Eng."},{"issue":"11","key":"4_CR2","first-page":"1441","volume":"44","author":"Q Tian","year":"2004","unstructured":"Tian, Q., Yan, L., Li, Z.: Logistics network design based on transport planning and combined GA. J. Tsinghua Univ. (Sci. Technol. 44(11), 1441\u20131444 (2004)","journal-title":"J. Tsinghua Univ. (Sci. Technol."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"595","DOI":"10.4028\/www.scientific.net\/AMR.744.595","volume":"744","author":"D Liu","year":"2013","unstructured":"Liu, D., Zhu, C., Zhou, W.: Enterprise logistics network optimization based on genetic algorithm. Adv. Mater. Res. 744, 595\u2013600 (2013)","journal-title":"Adv. Mater. Res."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0360-8352(02)00076-1","volume":"43","author":"A Syarif","year":"2002","unstructured":"Syarif, A., Yun, Y., Gen, M.: Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach. Comput. Ind. Eng. 43, 299\u2013314 (2002)","journal-title":"Comput. Ind. Eng."},{"key":"4_CR5","first-page":"5","volume":"31","author":"H Xu Hang","year":"2005","unstructured":"Xu Hang, H., Xu, W., Ye, Q.: Study on evolutionary computation based on Pr\u00fcfer number\u2014multi-stage logistic network optimization. Comput. Eng. Appl. 31, 5\u20137 (2005)","journal-title":"Comput. Eng. Appl."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"5019","DOI":"10.1016\/j.eswa.2015.02.058","volume":"42","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Ma, X., Maozeng, X., Liu, Y., Wang, Y.: Two-echelon logistics distribution region partitioning problem based on a hybrid particle swarm optimization\u2013genetic algorithm. Expert Syst. Appl. 42, 5019\u20135031 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1057\/mel.2015.17","volume":"18","author":"SY Cho","year":"2016","unstructured":"Cho, S.Y., Lee, Y.H., Cho, D.W., Gen, M.: Logistics network optimization considering balanced allocation and vehicle routing. Mariti. Econ. Logistics 18(1), 41\u201360 (2016)","journal-title":"Mariti. Econ. Logistics"},{"issue":"9","key":"4_CR8","first-page":"2003","volume":"23","author":"B Li","year":"2017","unstructured":"Li, B., Zhao, G., Ge, Y.: Stochastic programming model of closed loop logistics network based on genetic algorithm. Comput. Integr. Manuf. Syst. 23(9), 2003\u20132011 (2017)","journal-title":"Comput. Integr. Manuf. Syst."},{"issue":"1","key":"4_CR9","first-page":"64","volume":"37","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Jiao, N., Li, J.: Optimization design of multi-level logistics network based on determined network. Yanggong Univ. Sci. 37(1), 64\u201368 (2015)","journal-title":"Yanggong Univ. Sci."},{"issue":"4","key":"4_CR10","first-page":"687","volume":"4","author":"X Wang","year":"2008","unstructured":"Wang, X., Wu, Y.: Optimal algorithm for coding and decoding Prufer codes. Small Comput. Syst. 4(4), 687\u2013690 (2008)","journal-title":"Small Comput. Syst."},{"issue":"7","key":"4_CR11","first-page":"2090","volume":"34","author":"C Ma","year":"2014","unstructured":"Ma, C., Ma, C.: Robust model and algorithms for uncertain traveling salesman problem. J. Comput. Appl. 34(7), 2090\u20132092 (2014)","journal-title":"J. Comput. Appl."},{"issue":"2","key":"4_CR12","first-page":"413","volume":"28","author":"Y Peng","year":"2011","unstructured":"Peng, Y., Yuan, C., Mai, X., Yan, X.: Survey on theoretical research of gene expression programming. J. Comput. Appl. 28(2), 413\u2013419 (2011)","journal-title":"J. Comput. Appl."},{"key":"4_CR13","volume-title":"Principle and Application of Gene Expression Programming Algorithm","author":"C Yuan","year":"2010","unstructured":"Yuan, C., Peng, Y., Yan, X., et al.: Principle and Application of Gene Expression Programming Algorithm. Science Press, Beijing (2010)"},{"issue":"8","key":"4_CR14","first-page":"84","volume":"23","author":"L Maojun","year":"2001","unstructured":"Maojun, L., Richeng, L., Tiaosheng, T.: Analysis on the genetic operators of partheno-genetic algorithm. Syst. Eng. Electron. 23(8), 84\u201387 (2001)","journal-title":"Syst. Eng. Electron."}],"container-title":["Communications in Computer and Information Science","Artificial Intelligence Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-5577-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T13:03:23Z","timestamp":1590411803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-5577-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811555763","9789811555770"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-5577-0_4","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":"26 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISICA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligence Computation and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"16 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isica2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gdstinfo.cn\/isica2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"112","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":"45","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":"20","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":"40% - 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":"2","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)"}}]}}