{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:41:23Z","timestamp":1767984083211,"version":"3.49.0"},"reference-count":24,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"name":"Ministry of education of Humanities and Social Science project","award":["15YJC630145, 15YJC630059"],"award-info":[{"award-number":["15YJC630145, 15YJC630059"]}]},{"name":"Natural Science Foundation supported by Shanghai Science and Technology Committee","award":["15ZR1420200"],"award-info":[{"award-number":["15ZR1420200"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51579143"],"award-info":[{"award-number":["51579143"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2018,4]]},"abstract":"<jats:p> To realize higher coverage rate, lower reading interference, and cost efficiency of radio-frequency identification network in logistics under uncertainties, a novel robust radio-frequency identification network planning model is built and a robust particle swarm optimization is proposed. In radio-frequency identification network planning model, coverage is established by referring the probabilistic sensing model of sensor with uncertain sensing range; reading interference is calculated by concentric map\u2013based Monte Carlo method; cost efficiency is described with the quantity of readers. In robust particle swarm optimization, a sampling method, the sampling size of which varies with iterations, is put forward to improve the robustness of robust particle swarm optimization within limited sampling size. In particular, the exploitation speed in the prophase of robust particle swarm optimization is quickened by smaller expected sampling size; the exploitation precision in the anaphase of robust particle swarm optimization is ensured by larger expected sampling size. Simulation results show that, compared with the other three methods, the planning solution obtained by this work is more conducive to enhance the coverage rate and reduce interference and cost. <\/jats:p>","DOI":"10.1177\/1550147718769781","type":"journal-article","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T13:15:18Z","timestamp":1523452518000},"page":"155014771876978","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":6,"title":["Robust modeling and planning of radio-frequency identification network in logistics under uncertainties"],"prefix":"10.1177","volume":"14","author":[{"given":"Bowei","family":"Xu","sequence":"first","affiliation":[{"name":"Institute of Logistics Science & Engineering, Shanghai Maritime University, Shanghai, P.R. China"}]},{"given":"Junjun","family":"Li","sequence":"additional","affiliation":[{"name":"Merchant Marine College, Shanghai Maritime University, Shanghai, P.R. China"}]},{"given":"Yongsheng","family":"Yang","sequence":"additional","affiliation":[{"name":"Institute of Logistics Science & Engineering, Shanghai Maritime University, Shanghai, P.R. China"}]},{"given":"Octavian","family":"Postolache","sequence":"additional","affiliation":[{"name":"Instituto de Telecomunicacoes, ISCTE-IUL, Lisbon, Portugal"}]},{"given":"Huafeng","family":"Wu","sequence":"additional","affiliation":[{"name":"Merchant Marine College, Shanghai Maritime University, Shanghai, P.R. China"}]}],"member":"179","published-online":{"date-parts":[[2018,4,11]]},"reference":[{"key":"bibr1-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2005.05.006"},{"key":"bibr2-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2012.10.007"},{"key":"bibr3-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.08.046"},{"key":"bibr4-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2013.07.015"},{"key":"bibr5-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2205390"},{"issue":"4","key":"bibr6-1550147718769781","first-page":"1326","volume":"29","author":"Liu K","year":"2012","journal-title":"Appl Res Comput"},{"key":"bibr7-1550147718769781","volume-title":"Proceedings of the international conference on networks security, wireless communications and trusted computing","author":"Yang YH"},{"key":"bibr8-1550147718769781","volume-title":"Proceedings of the 4th European conference on antennas and propagation","author":"Di Giampaolo E"},{"key":"bibr9-1550147718769781","first-page":"900","volume":"42","author":"Liu K","year":"2011","journal-title":"J Cent South Univ: Sci Technol"},{"key":"bibr10-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.02.011"},{"key":"bibr11-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2014.02.012"},{"key":"bibr12-1550147718769781","volume-title":"Proceedings of the 7th international conference on information fusion","author":"Li SJ"},{"key":"bibr13-1550147718769781","doi-asserted-by":"publisher","DOI":"10.3390\/s110606056"},{"key":"bibr14-1550147718769781","volume-title":"Proceedings of the international conference on computer communications","author":"Vu K"},{"key":"bibr15-1550147718769781","volume-title":"Proceedings of the international conference on computer communications","author":"Vu K"},{"key":"bibr16-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846356"},{"key":"bibr17-1550147718769781","volume-title":"Proceedings of the IEEE congress on evolutionary computation","author":"Yu X"},{"issue":"2","key":"bibr18-1550147718769781","first-page":"201","volume":"24","author":"Zhu YF","year":"2011","journal-title":"Pattern Recogn Artif Intell"},{"key":"bibr19-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-012-0090-2"},{"key":"bibr20-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.01.033"},{"key":"bibr21-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2010.04.004"},{"key":"bibr22-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.1997.10487479"},{"key":"bibr23-1550147718769781","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2007.01.005"},{"key":"bibr24-1550147718769781","volume-title":"Proceedings of the IEEE international conference on evolutionary computation","author":"Shi YH"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1550147718769781","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1550147718769781","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1550147718769781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T20:48:36Z","timestamp":1607460516000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1177\/1550147718769781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["10.1177\/1550147718769781"],"URL":"https:\/\/doi.org\/10.1177\/1550147718769781","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"value":"1550-1477","type":"print"},{"value":"1550-1477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}