{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T09:16:09Z","timestamp":1778836569734,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T00:00:00Z","timestamp":1517529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61640020"],"award-info":[{"award-number":["61640020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11036-018-1023-1","type":"journal-article","created":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T03:49:27Z","timestamp":1517543367000},"page":"382-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Model Design of Mobile Resource Scheduling in Large Scale Activities"],"prefix":"10.1007","volume":"23","author":[{"given":"Cai-Qiu","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Wang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bei","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng-Kun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren-Qiang","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,2]]},"reference":[{"issue":"9","key":"1023_CR1","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1016\/j.cor.2009.11.017","volume":"37","author":"A Berrichi","year":"2010","unstructured":"Berrichi A, Yalaoui F, Amodeo L, Mezghiche M (2010) Bi-objective ant colony optimization approach to optimize production and maintenance scheduling. Comput Oper Res 37(9):1584\u20131596","journal-title":"Comput Oper Res"},{"issue":"1","key":"1023_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TSMCC.2009.2027335","volume":"40","author":"WN Chen","year":"2010","unstructured":"Chen WN, Zhang J, Chung HSH, Huang RZ, Liu O (2010) Optimizing discounted cash flows in project scheduling\u2014an ant colony optimization approach. IEEE Trans Syst Man Cybern Part C (Appl Rev) 40 (1):64\u201377","journal-title":"IEEE Trans Syst Man Cybern Part C (Appl Rev)"},{"issue":"2","key":"1023_CR3","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1109\/TII.2017.2665665","volume":"13","author":"YF Chen","year":"2017","unstructured":"Chen YF, Crespi N, Siano P (2017) Erouting: an eco-friendly navigation algorithm for traffic information industry. IEEE Trans Ind Inf 13(2):562\u2013571","journal-title":"IEEE Trans Ind Inf"},{"key":"1023_CR4","unstructured":"Chen YF, Guizani M, Zhang Y, Wang L, Crespi N, Lee GM (2017) When traffic flow prediction meets wireless big data analytics. arXiv:\n                    1709.08024"},{"issue":"3-4","key":"1023_CR5","first-page":"219","volume":"21","author":"YF Chen","year":"2014","unstructured":"Chen YF, Li MC, Tang SJ, Sun WF (2014) Impact of duty cycle and radio range irregularity on localization algorithms for wireless sensor networks. Ad Hoc & Sensor Wireless Networks 21(3-4):219\u2013235","journal-title":"Ad Hoc & Sensor Wireless Networks"},{"key":"1023_CR6","unstructured":"Dai G, Qingli DA (2000) The study of combinatorial scheduling problem in emergency systems[J]. Syst Eng Theory Pract"},{"issue":"3","key":"1023_CR7","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1111\/j.1365-2966.2012.21131.x","volume":"424","author":"M Dijkstra","year":"2012","unstructured":"Dijkstra M, Kramer R (2012) Line transfer through clumpy, large-scale outflows: Ly \u03b1 absorption and haloes around star-forming galaxies. Mon Not R Astron Soc 424(3):1672\u20131693","journal-title":"Mon Not R Astron Soc"},{"issue":"1","key":"1023_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0925-7535(00)00021-7","volume":"35","author":"F Fiedrich","year":"2000","unstructured":"Fiedrich F, Gehbauer F, Rickers U (2000) Optimized resource allocation for emergency response after earthquake disasters. Saf Sci 35(1):41\u201357","journal-title":"Saf Sci"},{"key":"1023_CR9","first-page":"017","volume":"6","author":"SP Gao","year":"2003","unstructured":"Gao SP, Liu SY (2003) Scheduling problem in multi-resource emergency systems based on the connection number. Syst Eng Theory Pract 6:017","journal-title":"Syst Eng Theory Pract"},{"issue":"2","key":"1023_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S Ichoua","year":"2003","unstructured":"Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144(2):379\u2013396","journal-title":"Eur J Oper Res"},{"issue":"9","key":"1023_CR11","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00170-010-3140-2","volume":"55","author":"JQ Li","year":"2011","unstructured":"Li JQ, Pan QK, Gao KZ (2011) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55(9):1159\u20131169","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"1023_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10845-010-0407-2","volume":"24","author":"XJ Liu","year":"2013","unstructured":"Liu XJ, Yi H, Ni ZH (2013) Application of ant colony optimization algorithm in process planning optimization. J Intell Manuf 24(1):1\u201313","journal-title":"J Intell Manuf"},{"issue":"3","key":"1023_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C Malandraki","year":"1992","unstructured":"Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp Sci 26(3):185\u2013200","journal-title":"Transp Sci"},{"issue":"1","key":"1023_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ijpe.2010.08.004","volume":"129","author":"G Moslehi","year":"2011","unstructured":"Moslehi G, Mahnam M (2011) A pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int J Prod Econ 129(1):14\u201322","journal-title":"Int J Prod Econ"},{"issue":"2","key":"1023_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jda.2009.03.001","volume":"8","author":"JB Orlin","year":"2010","unstructured":"Orlin JB, Madduri K, Subramani K, Williamson M (2010) A faster algorithm for the single source shortest path problem with few distinct positive lengths. J Discrete Algoritms 8(2):189\u2013 198","journal-title":"J Discrete Algoritms"},{"issue":"12","key":"1023_CR16","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan QK, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inform Sci 181(12):2455\u20132468","journal-title":"Inform Sci"},{"issue":"3","key":"1023_CR17","doi-asserted-by":"publisher","first-page":"2817","DOI":"10.1016\/j.eswa.2010.08.073","volume":"38","author":"H Panahi","year":"2011","unstructured":"Panahi H, Tavakkoli-Moghaddam R (2011) Solving a multi-objective open shop scheduling problem by a novel hybrid ant colony optimization. Expert Syst Appl 38(3):2817\u20132822","journal-title":"Expert Syst Appl"},{"issue":"8","key":"1023_CR18","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34 (8):2403\u20132435","journal-title":"Comput Oper Res"},{"issue":"4","key":"1023_CR19","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/00207540802538021","volume":"48","author":"M Seo","year":"2010","unstructured":"Seo M, Kim D (2010) Ant colony optimisation with parameterised search space for the job shop scheduling problem. Int J Prod Res 48(4):1143\u20131154","journal-title":"Int J Prod Res"},{"issue":"1","key":"1023_CR20","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ijpe.2012.06.011","volume":"141","author":"CJ Ting","year":"2013","unstructured":"Ting CJ, Chen CH (2013) A multiple ant colony optimization algorithm for the capacitated location routing problem. Int J Prod Econ 141(1):34\u201344","journal-title":"Int J Prod Econ"},{"key":"1023_CR21","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1038\/srep01001","volume":"2","author":"P Wang","year":"2012","unstructured":"Wang P, Hunter T, Bayen AM, Schechtner K, Gonz\u00e1lez MC (2012) Understanding road usage patterns in urban areas. Sci Rep 2:1001","journal-title":"Sci Rep"},{"issue":"3","key":"1023_CR22","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"LN Xing","year":"2010","unstructured":"Xing LN, Chen YW, Wang P, Zhao QS, Xiong J (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10(3):888\u2013896","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1023_CR23","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.asoc.2009.08.040","volume":"10","author":"J Yang","year":"2010","unstructured":"Yang J, Zhuang Y (2010) An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem. Appl Soft Comput 10(2):653\u2013660","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1023_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1057\/jors.2009.161","volume":"62","author":"B Yu","year":"2011","unstructured":"Yu B, Yang Z, Xie J (2011) A parallel improved ant colony optimization for multi-depot vehicle routing problem. J Oper Res Soc 62(1):183\u2013188","journal-title":"J Oper Res Soc"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-018-1023-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-018-1023-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-018-1023-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T20:34:09Z","timestamp":1549053249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-018-1023-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,2]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["1023"],"URL":"https:\/\/doi.org\/10.1007\/s11036-018-1023-1","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,2]]},"assertion":[{"value":"2 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}