{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T04:24:21Z","timestamp":1744431861454,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60873162"],"award-info":[{"award-number":["60873162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"crossref","award":["S2012010009634"],"award-info":[{"award-number":["S2012010009634"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Research Foundation of Science and Technology Major Project in Guangdong Province","award":["2012A010800012"],"award-info":[{"award-number":["2012A010800012"]}]},{"name":"Cooperation Project in Industry, Education and Research of Guangdong Province and Ministry of Education of China","award":["2011B090400275"],"award-info":[{"award-number":["2011B090400275"]}]},{"name":"Research Foundation of Science and Technology Plan Project in Guangzhou City","award":["12A12051586"],"award-info":[{"award-number":["12A12051586"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Topics Comput."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/tetc.2014.2316524","type":"journal-article","created":{"date-parts":[[2014,4,14]],"date-time":"2014-04-14T18:01:33Z","timestamp":1397498493000},"page":"399-410","source":"Crossref","is-referenced-by-count":11,"title":["A Dynamic QoS-Aware Logistics Service Composition Algorithm Based on Social Network"],"prefix":"10.1109","volume":"2","author":[{"given":"Yang","family":"Yu","sequence":"first","affiliation":[]},{"given":"Jian","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Shangquan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1108\/02635570710816694"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ECOWS.2006.2"},{"year":"1998","author":"ghallab","key":"ref32"},{"key":"ref31","article-title":"Semantic web service com-position planning with OWLS-Xplan","author":"klusch","year":"2005","journal-title":"Proc AAAI Fall Symp Agents and the Semantic Web"},{"article-title":"Web service composition as AI planning—A survey","year":"2005","author":"peer","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2010.07.014"},{"key":"ref36","first-page":"1","author":"liu","year":"2003","journal-title":"An Introduction to Social Network Analysis"},{"key":"ref35","first-page":"267","article-title":"Composite web service selection system based on QoS linearization and shortest path","volume":"7","author":"hu","year":"2012","journal-title":"China Sciencepaper"},{"key":"ref34","first-page":"195","author":"wu","year":"2003","journal-title":"Automating daml-s web services composition using shop2"},{"key":"ref10","first-page":"1167","article-title":"QoS for composite web services and optimizing","volume":"29","author":"dai","year":"2006","journal-title":"Chin J Comput"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"gary","key":"ref11"},{"key":"ref12","first-page":"743","article-title":"A $^{\\ast }$ prune: An algorithm for finding K shortest paths subject to multiple constraints","volume":"2","author":"liu","year":"2001","journal-title":"Proc 20th Annu Joint Conf IEEE Comput Commun Soc"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772693"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2180861.2180864"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2011.33"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2007.12.792"},{"key":"ref17","first-page":"1","article-title":"SanGA: A self-adaptive network-aware approach to service composition","volume":"99","author":"klein","year":"2013","journal-title":"IEEE Trans Services Comput"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1360\/jos180646"},{"key":"ref19","first-page":"1659","article-title":"Web services selection algorithm with QoS global optimal","volume":"27","author":"wang","year":"2010","journal-title":"Appl Res Comput"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29360-4_14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20300"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-73798-0_20"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"key":"ref6","first-page":"3622","article-title":"Survey on web services selection algorithms based on QoS","volume":"27","author":"li","year":"2010","journal-title":"Appl Res Comput"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CTS.2006.18"},{"key":"ref5","first-page":"455","article-title":"Service selection strategy offering global optimal quality of service","volume":"32","author":"dong","year":"2011","journal-title":"J Chin Comput Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1013367.1013379"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.11"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016547000822"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10257-005-0052-z"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ECOWS.2010.16"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAW.2011.40"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2307\/2786545"},{"key":"ref21","first-page":"2617","article-title":"A dynamic web services composition algorithm based on the combination of ant colony algorithm and genetic algorithm","volume":"6","author":"yang","year":"2010","journal-title":"J Comput Inf Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/WICOM.2007.1653"},{"key":"ref41","first-page":"1711","article-title":"Three-stage algorithm for dynamic service composition","volume":"18","author":"huang","year":"2012","journal-title":"Comput Integr Manuf Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1086\/225469"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29360-4_15"},{"article-title":"The strength of churning ties: Tie portfolios, tie interdependence, and the dynamics of interorganizational relationships","year":"2007","author":"lazzarini","key":"ref25"}],"container-title":["IEEE Transactions on Emerging Topics in Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245516\/7024955\/06797876.pdf?arnumber=6797876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:03Z","timestamp":1642004943000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6797876\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":41,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tetc.2014.2316524","relation":{},"ISSN":["2168-6750"],"issn-type":[{"type":"electronic","value":"2168-6750"}],"subject":[],"published":{"date-parts":[[2014,12]]}}}