{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:32:14Z","timestamp":1774269134906,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T00:00:00Z","timestamp":1521590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the humanities and social science research project of Shandong Universities","award":["J17RB103"],"award-info":[{"award-number":["J17RB103"]}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["18CX04004B"],"award-info":[{"award-number":["18CX04004B"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s12652-018-0749-8","type":"journal-article","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T06:39:12Z","timestamp":1521614352000},"page":"409-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Route optimization model in collaborative logistics network for mixed transportation problem considered cost discount based on GATS"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2934-7385","authenticated-orcid":false,"given":"Yirui","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"749_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.cie.2015.12.028","volume":"93","author":"R Abyazi-Sani","year":"2016","unstructured":"Abyazi-Sani R, Ghanbari R (2016) An efficient tabu search for solving the uncapacitated single allocation hub location problem. Comput Industr Eng 93:99\u2013109","journal-title":"Comput Industr Eng"},{"issue":"1\u20132","key":"749_CR2","first-page":"1","volume":"246","author":"SA Alumur","year":"2015","unstructured":"Alumur SA, Nickel S, Saldanha-da-Gama F, Se\u00e7erdin Y (2015) Multi-period hub network design problems with modular capacities. Annu Oper Res 246(1\u20132):1\u201324","journal-title":"Annu Oper Res"},{"issue":"4","key":"749_CR3","first-page":"421","volume":"41","author":"RS Camargo","year":"2009","unstructured":"Camargo RS, Miranda JR, Luna HPL (2009) Benders decomposition for hub problems with economies of scale. Ann Oper Res 41(4):421\u2013451","journal-title":"Ann Oper Res"},{"issue":"12","key":"749_CR4","doi-asserted-by":"publisher","first-page":"3107","DOI":"10.1016\/j.cor.2009.01.009","volume":"36","author":"JF Campbell","year":"2009","unstructured":"Campbell JF (2009) Hub location for time definite transportation. Comput Oper Res 36(12):3107\u20133116","journal-title":"Comput Oper Res"},{"issue":"61","key":"749_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tre.2013.11.005","volume":"61","author":"YC Chou","year":"2014","unstructured":"Chou YC, Chen YH, Chen HM (2014) Pickup and delivery routing with hub transshipment across flexible time periods for improving dual objectives on workload and waiting time. Transp Res Part E 61(61):98\u2013114","journal-title":"Transp Res Part E"},{"issue":"8","key":"749_CR6","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.trb.2009.12.016","volume":"44","author":"I Correia","year":"2010","unstructured":"Correia I, Nickel S, Saldanha-da- F (2010) Single-assignment hub location problems with multiple capacity levels. Transp Res Part B 44(8):1047\u20131066","journal-title":"Transp Res Part B"},{"issue":"2","key":"749_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.ejor.2012.12.015","volume":"227","author":"M Drexl","year":"2013","unstructured":"Drexl M (2013) Applications of the vehicle routing problem with trailers and transshipments. Eur J Oper Res 227(2):275\u2013283","journal-title":"Eur J Oper Res"},{"issue":"c","key":"749_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.ins.2017.02.011","volume":"399","author":"J Du","year":"2017","unstructured":"Du J, Li X, Yu L, Dan R, Zhou J (2017) Multi-deport vehicle routing problem for hazardous materials transportation. Infor Sci 399(c):201\u2013218","journal-title":"Infor Sci"},{"issue":"3","key":"749_CR9","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0377-2217(98)00395-6","volume":"120","author":"J Ebery","year":"2000","unstructured":"Ebery J, Krishnamoorthy M, Ernst A, Boland A (2000) The capacitated multiple allocation hub location problem: formulations and algorithms. Eur J Oper Res 120(3):614\u2013631","journal-title":"Eur J Oper Res"},{"issue":"3","key":"749_CR10","first-page":"296","volume":"12","author":"W El-Ashmawi","year":"2015","unstructured":"El-Ashmawi W, Jun H, Renfa L (2015) Stability coalition formation with cost sharing in multi-agent systems based on volume discount. Intern Arab J Inf Tech 12(3):296\u2013303","journal-title":"Intern Arab J Inf Tech"},{"issue":"2","key":"749_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/net.20245","volume":"51","author":"M Gendreau","year":"2008","unstructured":"Gendreau M, Laporte G, S\u00e9guin R (2008) A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Net 51(2):153\u2013153","journal-title":"Net"},{"issue":"5","key":"749_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533\u2013549","journal-title":"Comput Oper Res"},{"issue":"7","key":"749_CR13","first-page":"997","volume":"28","author":"M Huang","year":"2013","unstructured":"Huang M, Cui Y, Lin WT, Ren L (2013) Multi-tasks fourth party logistics routing problem with cost discount. Contr Decis 28(7):997\u20131001","journal-title":"Contr Decis"},{"issue":"C","key":"749_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.knosys.2015.12.001","volume":"95","author":"S Jalali","year":"2016","unstructured":"Jalali S, Seifbarghy M, Sadeghi J, Ahmadi S (2016) Optimizing a bi-objective reliable facility location problem with adapted stochastic measures using tuned-parameter multi-objective algorithms. Knowl Based Syst 95(C):45\u201357","journal-title":"Knowl Based Syst"},{"issue":"1","key":"749_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137(1):50\u201371","journal-title":"Eur J Oper Res"},{"key":"749_CR16","first-page":"1414","volume":"11","author":"K Jeyaraman","year":"2008","unstructured":"Jeyaraman K, Sugapriya C (2008) Transportation cost using deterministic inventory model with deteriorating items receives price discount. J Appl Sci Res 11:1414\u20131419","journal-title":"J Appl Sci Res"},{"issue":"3","key":"749_CR17","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.apm.2013.07.033","volume":"38","author":"O Karimi","year":"2014","unstructured":"Karimi O, Setak M (2014) Proprietor and customer costs in the incomplete hub location-routing network topology. Appl Math Model 38(3):1011\u20131023","journal-title":"Appl Math Model"},{"key":"749_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tre.2015.12.001","volume":"86","author":"DSW Lai","year":"2016","unstructured":"Lai DSW, Demirag OC, Leung JMY (2016) A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transp Res Part E Logist Transp Rev 86:32\u201352","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"749_CR19","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.trb.2016.05.013","volume":"91","author":"X Li","year":"2016","unstructured":"Li X, Zhou JD, Zhao XD (2016) Travel itinerary problem. Transp Res Part B 91:332\u2013343","journal-title":"Transp Res Part B"},{"issue":"5","key":"749_CR20","first-page":"1035","volume":"8","author":"CY Liu","year":"2013","unstructured":"Liu CY (2013) An improved adaptive genetic algorithm for the multi-depot vehicle routing problem with time window. J Net 8(5):1035\u20131042","journal-title":"J Net"},{"issue":"4","key":"749_CR21","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(4):421\u2013451","journal-title":"Ann Oper Res"},{"issue":"4","key":"749_CR22","first-page":"386","volume":"16","author":"J Razmi","year":"2013","unstructured":"Razmi J, Rahmanniya F (2013) Design of distribution network using hub location model with regard to capacity constraint and service level. Intern J Logis Syst Manag 16(4):386\u2013398","journal-title":"Intern J Logis Syst Manag"},{"key":"749_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2015.07.020","volume":"249","author":"MS Roni","year":"2016","unstructured":"Roni MS, Eksioglu SD, Cafferty KG, Jacobson JJ (2016) A multi-objective, hub-and-spoke model to design and manage biofuel supply chains. Ann Oper Res 249:1\u201330","journal-title":"Ann Oper Res"},{"issue":"2","key":"749_CR24","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/nav.20274","volume":"55","author":"DP Song","year":"2010","unstructured":"Song DP, Carter J (2010) Optimal empty vehicle redistribution for hub-and-spoke transportation systems. Nav Res Logis 55(2):156\u2013171","journal-title":"Nav Res Logis"},{"issue":"2","key":"749_CR25","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1080\/00207543.2015.1018453","volume":"54","author":"YC Tsao","year":"2016","unstructured":"Tsao YC, Zhang Q, Chen TH (2016) Multi-item distribution network design problems under volume discount on transportation cost. Intern J Prod Res 54(2):426\u2013443","journal-title":"Intern J Prod Res"},{"issue":"3","key":"749_CR26","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1080\/00207543.2014.942010","volume":"53","author":"G Weckman","year":"2015","unstructured":"Weckman G (2015) Applying genetic algorithm to a new location and routing model of hazardous materials. Intern J Prod Res 53(3):916\u2013928","journal-title":"Intern J Prod Res"},{"issue":"1","key":"749_CR27","first-page":"38","volume":"24","author":"KR Weng","year":"2015","unstructured":"Weng KR, Zhu KJ, Liu G (2015) Collaborative transportation route optimization with lower bound flows. J Syst Manag 24(1):38\u201342","journal-title":"J Syst Manag"},{"key":"749_CR28","doi-asserted-by":"publisher","first-page":"3873","DOI":"10.1016\/j.jfranklin.2015.01.021","volume":"352","author":"XF Xu","year":"2015","unstructured":"Xu XF, Zhang W, Li N (2015) A bilevel programming model of resource matching for collaborative logistics network in supply uncertainty environment. J Frankl Instit 352:3873\u20133884","journal-title":"J Frankl Instit"},{"issue":"7","key":"749_CR29","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.asoc.2016.07.036","volume":"560","author":"XF Xu","year":"2017","unstructured":"Xu XF, Hao J, Deng YR, Wang Y (2017) Design optimization of resource combination for collaborative logistics network under uncertainty. Appl Soft Comput 560(7):684\u2013691","journal-title":"Appl Soft Comput"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-018-0749-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0749-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0749-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T13:36:57Z","timestamp":1572010617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-018-0749-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,21]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["749"],"URL":"https:\/\/doi.org\/10.1007\/s12652-018-0749-8","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,21]]},"assertion":[{"value":"31 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}