{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T16:10:08Z","timestamp":1751731808810,"version":"3.41.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959320"},{"type":"electronic","value":"9783319959337"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-95933-7_83","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:48:38Z","timestamp":1530773318000},"page":"754-762","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Research on Vehicle Routing Problem and Its Optimization Algorithm Based on Assembled Building"],"prefix":"10.1007","author":[{"given":"Kun","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Jun-qing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Yongqin","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Xiaoping","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Pei-yong","family":"Duan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"83_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.K.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"83_CR2","unstructured":"Bi, G.-t.: Business School, Henan University, Kaifeng 475000, China"},{"key":"83_CR3","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker, B.M., Ayechew, M.A.: A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30, 787\u2013800 (2003)","journal-title":"Comput. Oper. Res."},{"key":"83_CR4","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31, 1985\u20132002 (2004)","journal-title":"Comput. Oper. Res."},{"key":"83_CR5","unstructured":"Zhang, Q., Yan, R.: School of Economics and Management, University of Science & Technology Beijing, Beijing 100083, China"},{"key":"83_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0360-8352(02)00033-5","volume":"42","author":"HS Hwang","year":"2002","unstructured":"Hwang, H.S.: An improved model for vehicle routing problem with time constraint based on genetic algorithm. Comput. Ind. Eng. 42, 361\u2013369 (2002)","journal-title":"Comput. Ind. Eng."},{"key":"83_CR7","unstructured":"Pei, X.-b., Jia, D.-f.: School of Management, Tianjin University of Technology, Tianjin 300384, China"},{"key":"83_CR8","unstructured":"Wang, B., Shang, X.-c., Li, H.-f.: Applied Institute, University of Science and Technology Beijing, Beijing 100083, China; Transport Planning and Research Institute Ministry of Communications, Beijing 100028, China"},{"key":"83_CR9","unstructured":"Mu, D., Wang, C., Wang, S.-c., Zhou, S.-c.: .School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China; School of Economics and Management, Beijing University of Technology, Beijing 100124; School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China; Qingdao Geotechnical Investigation and Surveying Research Institute, Qingdao 266032, China"},{"key":"83_CR10","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.rcim.2010.06.023","volume":"26","author":"M Mirabi","year":"2010","unstructured":"Mirabi, M., Ghomi, S.F., Jolai, F.: Efficent stochastic hybrid heuristics for the multi-depot vehicle routing problem. Rob. Cim.-Int. Manufac. 26, 564\u2013569 (2010)","journal-title":"Rob. Cim.-Int. Manufac."},{"key":"83_CR11","unstructured":"Chen, Y.-x.: School of Economics & Management, Harbin Engineering University, Harbin 150001, China"},{"key":"83_CR12","unstructured":"Zhang, W.-z., Lin, J.-b., Wu, H.-s., Tong, R.-f., Dong, J.-x.: Institute of Artificial Intelligence, Zhejiang University, Hangzhou 310027, China; Zhejiang Jinji Electronic Co. Ltd. Hangzhou 310013, China; Basic Study, Zhejiang Police College, Hangzhou 310053, China"},{"key":"83_CR13","unstructured":"Yue, Y.-x., Zhhou, L.-s., Yue, q.-x., Sun, Q.: Sch. of Traffic & Transportation, Beijing Jiaotong Univ., Beijing 100044, China; Sch. of Economics & Management, Beihang Univ., Beijing 100083, China"},{"key":"83_CR14","first-page":"016","volume":"5","author":"Z Liu","year":"2002","unstructured":"Liu, Z., Shen, J.: An adaptive ant colony algorithm for vehicle routing problem based on the evenness of solution. Acta Simulata Systematica Sinica. 5, 016 (2002)","journal-title":"Acta Simulata Systematica Sinica."},{"key":"83_CR15","doi-asserted-by":"crossref","unstructured":"Qin, Y.Q., Sun, D.B., Li, N., et al.: Path planning for mobile robot using the particle swarm optimization with mutation operator. In: Proceedings of 2004 IEEE International Conference on Machine Learning and Cybernetics 2004, vol. 4, pp. 2473\u20132478 (2004)","DOI":"10.1109\/ICMLC.2004.1382219"},{"key":"83_CR16","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","volume":"8","author":"AW Mohemmed","year":"2008","unstructured":"Mohemmed, A.W., Sahoo, N.C., Geok, T.K.: Solving shortest path problem using particle swarm optimization. Appl. Soft Comput. 8, 1643\u20131653 (2008)","journal-title":"Appl. Soft Comput."},{"issue":"15","key":"83_CR17","first-page":"230","volume":"46","author":"Y-H Wu","year":"2010","unstructured":"Wu, Y.-H., Zhang, N.-Z.: Modified particle swarm optimization algorithm for vehicle routing problem with time windows. Comput. Eng. Appl. 46(15), 230\u2013234 (2010)","journal-title":"Comput. Eng. Appl."},{"key":"83_CR18","unstructured":"Wei, Z.U., Gang, L.I., Zhengxia, Q.I.: Study on a path planning method based on improved particle swarm optimization. J. Projectiles Rockets Missiles Guidance (2008)"},{"key":"83_CR19","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Gonz\u00e1lez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in Computational Intelligence, vol. 65. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6"},{"key":"83_CR20","unstructured":"Ma, X.-I., Zhang, H.-z., Ma, L.: School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China"},{"key":"83_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ast.2015.11.040","volume":"49","author":"GG Wang","year":"2008","unstructured":"Wang, G.G., Chu, H.C.E., Mirjalili, S.: Three-dimensional path planning for UCAV using an improved bat algorithm. Aerosp. Sci. Technol. 49, 231\u2013238 (2008)","journal-title":"Aerosp. Sci. Technol."},{"key":"83_CR22","unstructured":"Sun, Q., Zhang, H.: Business School, University of Shanghai for Science and Technology, Shanghai 200093, China"},{"key":"83_CR23","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1016\/j.asoc.2011.11.011","volume":"12","author":"Y Deng","year":"2012","unstructured":"Deng, Y., Chen, Y., Zhang, Y., et al.: Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Appl. Soft Comput. 12, 1231\u20131237 (2012)","journal-title":"Appl. Soft Comput."},{"key":"83_CR24","doi-asserted-by":"crossref","unstructured":"Noto, M., Sato, H.: A method for the shortest path search by extended Dijkstra algorithm. In: 2000 IEEE International Conference on Systems, Man, and Cybernetics.vol. 3, pp. 2316\u20132320. IEEE (2000)","DOI":"10.1109\/ICSMC.2000.886462"},{"key":"83_CR25","unstructured":"Yuan, B., Liu, J.-s., Qian, D., Luo, D.-h.: School of Institute of mechanical and electrical engineering, Nanchang University, Nanchang 330031, China"},{"key":"83_CR26","unstructured":"Wang, J., Zhang, X., Chen, B., Chen, H.: Information Engineering School, University of Science and Technology Beijing, Beijing 100083, China; Informat ion Engineering School, Wuhan University of S cience and Technology, Wuhan 430081, China"},{"key":"83_CR27","series-title":"Modeling and Optimization in Science and Technologies","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-26245-1_12","volume-title":"Metaheuristics and Optimization in Civil Engineering","author":"Y Zhou","year":"2016","unstructured":"Zhou, Y., Luo, Q., Xie, J., Zheng, H.: A hybrid bat algorithm with path relinking for the capacitated vehicle routing problem. In: Yang, X.-S., Bekda\u015f, G., Nigdeli, S.M. (eds.) Metaheuristics and Optimization in Civil Engineering. MOST, vol. 7, pp. 255\u2013276. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-26245-1_12"},{"key":"83_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"83_CR29","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artif. Life. 5, 137\u2013172 (1999)","journal-title":"Artif. Life."},{"key":"83_CR30","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/TII.2012.2198665","volume":"9","author":"V Roberge","year":"2012","unstructured":"Roberge, V., Tarbouchi, M., Labont\u00e9, G.: Comparison of parallel genetic algorithm and particle swarm optimization for real-time UAV path planning. IEEE Trans. Ind. Inform. 9, 132\u2013141 (2012)","journal-title":"IEEE Trans. Ind. Inform."},{"key":"83_CR31","unstructured":"Li, G., Shi, H.: Path planning for mobile robot based on particle swarm optimization. Robotica, 3290\u20133294(2004)"},{"key":"83_CR32","first-page":"15","volume":"2012","author":"G Wang","year":"2012","unstructured":"Wang, G., Guo, L., Duan, H., et al.: A bat algorithm with mutation for UCAV path planning. Sci. World J. 2012, 15 (2012)","journal-title":"Sci. World J."},{"key":"83_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.cor.2012.03.019","volume":"42","author":"F Liberatore","year":"2014","unstructured":"Liberatore, F., Ortu\u00f1o, M.T., Tirado, G., et al.: A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian Logistics. Comput. Oper. Res. 42, 3\u201313 (2014)","journal-title":"Comput. Oper. Res."},{"key":"83_CR34","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1016\/j.apm.2006.03.024","volume":"31","author":"JB Sheu","year":"2007","unstructured":"Sheu, J.B.: A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations. Appl. Math. Model. 31, 1048\u20131066 (2007)","journal-title":"Appl. Math. Model."},{"key":"83_CR35","first-page":"120","volume":"4","author":"QIN Gu","year":"2006","unstructured":"Gu, Q.I.N.: Logistics distribution center allocation based on ant colony optimization. Syst. Eng. Theor. Pract. 4, 120\u2013124 (2006)","journal-title":"Syst. Eng. Theor. Pract."},{"key":"83_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-382-8","volume-title":"Multi-Objective Management in Freight Logistics: Increasing Capacity, Service Level and Safety with Optimization Algorithm","author":"M Caramia","year":"2008","unstructured":"Caramia, M., Dell\u2019Olmo, P.: Multi-Objective Management in Freight Logistics: Increasing Capacity, Service Level and Safety with Optimization Algorithm. Springer, London (2008). https:\/\/doi.org\/10.1007\/978-1-84800-382-8"},{"key":"83_CR37","first-page":"013","volume":"5","author":"J Zhang","year":"2004","unstructured":"Zhang, J., Zhou, Q.: Study on the optimization of logistics distribution VRP based on immune clone algorithm. J. Hunan Univ. (Natural Science) 5, 013 (2004)","journal-title":"J. Hunan Univ. (Natural Science)"},{"key":"83_CR38","first-page":"118","volume":"30","author":"Y Luo","year":"2012","unstructured":"Luo, Y., Chen, Z.Y.: Path optimization of logistics distribution based on improved genetic algorithm. Syst. Eng. 30, 118\u2013122 (2012)","journal-title":"Syst. Eng."},{"key":"83_CR39","first-page":"028","volume":"12","author":"R Li","year":"2004","unstructured":"Li, R., Yuan, J.: Research on the optimization of logistics distribution routing based on improved genetic algorithm. J. Wuhan Univ. Technol. 12, 028 (2004)","journal-title":"J. Wuhan Univ. Technol."},{"key":"83_CR40","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10852-007-9073-6","volume":"7","author":"Y Marinakis","year":"2008","unstructured":"Marinakis, Y., Marinaki, M.: A particle swarm optimization algorithm with path relinking for the location routing problem. J. Math. Model. Alg. 7, 59\u201378 (2008)","journal-title":"J. Math. Model. Alg."},{"key":"83_CR41","first-page":"202","volume":"33","author":"X Wang","year":"2007","unstructured":"Wang, X., Li, Y.: Research on optimization of logistics distribution routing under electronic commerce. Jisuanji Gongcheng\/ Comput. Eng. 33, 202\u2013204 (2007)","journal-title":"Jisuanji Gongcheng\/ Comput. Eng."},{"key":"83_CR42","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., Xu, M., et al.: Two-echelon logistics distribution region partitioning problem based on a hybrid particle swarm optimization\u2013genetic algorithm. Exper. Syst. Appl. 42, 5019\u20135031 (2015)","journal-title":"Exper. Syst. Appl."},{"key":"83_CR43","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/j.2158-1592.2010.tb00146.x","volume":"31","author":"JE Bell","year":"2010","unstructured":"Bell, J.E., Griffis, S.E.: Swarm intelligence: application of the ant colony optimization algorithm to logistics-oriented vehicle routing problems. J. Bus. Logistics 31, 157\u2013175 (2010)","journal-title":"J. Bus. Logistics"},{"key":"83_CR44","first-page":"243","volume":"5","author":"H Wang","year":"2012","unstructured":"Wang, H., Li, W.: Study on logistics distribution route optimization by improved particle swarm optimization. ACM Trans. Model Comput. Simul. 5, 243\u2013246 (2012)","journal-title":"ACM Trans. Model Comput. Simul."},{"key":"83_CR45","first-page":"1125","volume":"20","author":"Z Jiang","year":"2005","unstructured":"Jiang, Z., Wang, D.: Model and algorithm of location optimization of distribution centers for B2C E-commerce. Control Decis. 20, 1125 (2005)","journal-title":"Control Decis."},{"key":"83_CR46","first-page":"357","volume":"7","author":"WU Jie-ming","year":"2011","unstructured":"Jie-ming, W.U.: Vehicle routing optimization problem of logistics distribution. ACM Trans. Model Comput. Simul. 7, 357\u2013360 (2011)","journal-title":"ACM Trans. Model Comput. Simul."},{"key":"83_CR47","first-page":"481","volume":"34","author":"Z Jiang","year":"2005","unstructured":"Jiang, Z., Wang, D.: Model and algorithm for logistics distribution routing of B2C e-commerce. Inf. Control-Shenyang 34, 481 (2005)","journal-title":"Inf. Control-Shenyang"},{"issue":"3","key":"83_CR48","first-page":"208","volume":"24","author":"YYG Jianya","year":"1999","unstructured":"Jianya, Y.Y.G.: An efficient implementation of shortest path algorithm based on dijkstra algorithm. J. Wuhan Tech. Univ. Surv. Mapping. 24(3), 208\u2013212 (1999)","journal-title":"J. Wuhan Tech. Univ. Surv. Mapping."},{"key":"83_CR49","doi-asserted-by":"crossref","unstructured":"Kang, H.I., Lee, B., Kim, K.: Path planning algorithm using the particle swarm optimization and the improved Dijkstra algorithm. In: 2008 Pacific-Asia Workshop on Computational Intelligence and Industrial Application, PACIIA 2008, vol. 2, pp. 1002\u20131004. IEEE (2008)","DOI":"10.1109\/PACIIA.2008.376"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95933-7_83","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T15:43:31Z","timestamp":1751730211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95933-7_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959320","9783319959337"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95933-7_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","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":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","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":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","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":"275","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":"72","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":"44% - 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.46","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":"0","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)"}}]}}