[1] 毛少杰,李玉萍,林剑柠,等. 网络中心化仿真概念与方法研究[J]. 系统仿真学报,2010,22(7):1660-1663. MAO Shao-jie, LI Yu-ping, LIN Jian-ning, et al. Research on concepts and technique of network-centric simulation[J]. Chinese Journal of System Simulation, 2010, 22(7): 1660-1663. (in Chinese) [2] Sun L Y, Mao S J, Liu Z, et al. Research on the runtime support platform for the net-centric simulation[C]∥IEEE International Conference on Advanced Computer Theory and Engineering Conference. New York: ASME,2010: 253-257. [3] Shalil M, Walker D W, Gray W A. A framework for automated service composition in service-oriented architectures[C]∥Proceedings of the ESWS 2004. Berlin: Springer-Verlag, 2004: 269-283. [4] Yu T K, Lin J. Service selection algorithms for composing complex services with multiple QoS constraints[C]∥Proceedings of the 3rd International Conference on Service Oriented Computing. Amsterdam: Springer, 2005: 130-143. [5] Benatallah B, Dumas M, Sheng Q Z, et al. Declarative composition and peer-to-peer provisioning of dynamic Web services[C]∥Proceedings of the 18th International Conference on Data Engineering. San Jose: IEEE, 2002: 297-308. [6] Liu Y, Ngu A H, Zeng L Z. QoS computation and policing in dynamic Web service selection[C]∥Proceedings of the 13th International Conference on World Wide Web. New York: ACM, 2004: 66-73. [7] Zeng L Z, Benatallah B, Ngu A, et al. QoS-aware middleware for Web services composition[J]. IEEE Transactions on Software Engineering, 2004,30(5): 311-327. [8] Ardagna D, Pernici B. Adaptive service composition in flexible processes[J]. IEEE Transactions on Software Engineering, 2007, 33(6): 369-384. [9] Zhang L J, Li B, Chao T, et al. On demand Web services based business process composition[C]∥International Conference on System, Man, and Cybernetics. Washington: IEEE, 2003: 4057-4064. [10] Canfora G, Penta M D, Esposito R, et al. A lightweight approach for QoS-aware service composition[C]∥ Proceedings of the 2nd International Conference on Service oriented Computing. New York: ACM, 2004: 36-47. [11] Ma Y, Zhang C W. Quick convergence of genetic algorithm for QoS-driven Web service selection[J]. Computer Networks, 2008, 52(5): 1093-1104. [12] 刘书雷,刘云翔,张帆,等. 一种服务聚合中QoS 全局最优服务动态选择算法[J]. 软件学报, 2007, 18(3): 646-656. LIU Shu-lei, LIU Yun-xiang, ZHANG Fan, et al. A dynamic Web services selection algorithm with QoS global optimal in web services composition[J]. Chinese Journal of Software, 2007,18(3): 646-656. (in Chinese) [13] WFMC . Workflow management coalition terminology & glossary, WFMC-TC-1011[R]. United Kingdom: Workflow Management Coalition, 1999. [14] Kennedy J, Eberhart R. Particle swarm optimization[C]∥International Conference on Neural Networks. Washington: IEEE, 1995: 1942-1948. [15] Zhao X C, Gao X S, Hu Z C. Evolutionary programming based on non-uniform mutation[J]. Applied Mathematics and Computation, 2007,192(1): 1-11. [16] 王文彬,孙其博,赵新超,等. 基于非均衡变异离散粒子群优化算法的QoS全局最优Web服务选择方法[J]. 电子学报, 2010,38(12): 2774-2779. WANG Wen-bin, SUN Qi-bo, ZHAO Xin-chao, et al. Web services selection approach with QoS global optimal based on discrete particle swarm optimization with non- uniform mutation algorithm[J]. Chinese Acta Electronica Sinica, 2010,38(12): 2774-2779. (in Chinese) [17] 龙文,梁昔明,董淑华,等. 动态调整惯性权重的粒子群优化算法[J]. 计算机应用, 2009, 29(8): 2240-2242. LONG Wen, LIANG Xi-ming, DONG Shu-hua, et al. Particle swarm optimization with dynamic change of inertia weights[J]. Chinese Journal of Computer Applications, 2009, 29(8): 2240-2242. (in Chinese) [18] 张长胜,孙吉贵,欧阳丹彤. 一种自适应离散粒子群优化算法及其应用研究[J]. 电子学报,2009,37(2):299-304. ZHANG Chang-sheng, SUN Ji-gui, OUYANG Dan-tong. A self-adaptive discrete particle swarm optimization algorithm[J]. Chinese Acta Electronica Sinica, 2009,37 (2): 299-304. (in Chinese) [19] Yang Q Y, Sun J G, Zhang J Y, et al. A hybrid discrete particle swarm algorithm for open2shop problems[C]∥Proceedings of the 6th International Conference on Simulated Evolution and Learning. Hefei, China: LNCS, 2006:158-165. [20] Lian Z G, Gu X S, Jiao B. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan[J]. Applied Mathematics and Computation, 2006,175(1):773-785. [21] Riget J, Vesterstorem J S. A diversity-guided particle swarm optimizer-the ARPSO[R]∥Technical Report 2002-02. Denmark: Department of Computer Science, University of Aarhus, 2002:345-350. [22] 吕振肃,侯志荣. 自适应变异的粒子群优化算法[J]. 电子学报, 2004,32(3):416-420. LV Zhen-su, HOU Zhi-rong. Paticle swarm optimization with adaptive mutation[J]. Acta Electronica Sinica, 2004,32(3): 416-420. (in Chinese) [23] 胡旺, 李志蜀. 一种更简化而高效的粒子群优化算法[J]. 软件学报, 2007, 18(4): 861-868. HU Wang, LI Zhi-shu. A simpler and more effective paticle swarm optimization algorithm[J]. Chinese Journal of Software, 2007, 18(4): 861-868. (in Chinese) [24] Shi Y, Eberhart R C. Particle swarm optimization: development, applications and resources[C]∥Proceedings of the IEEE International Conference of Evolutionary Computation. Piscataway, USA: IEEE Press,1998: 69-73. [25] Atanassov K T. Intuitionistic fuzzy sets[J]. Fuzzy Sets and Systems, 1986, 20(1): 87-96. [29] Ulungu E L, Teghem J. Multi-objective combinatorial optimization problems: a survey[J]. Journal of Multi-Criteria Decision Analysis, 1994, 3(2): 83-104. [30] Veldhuizen V. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations[D]. Ohio: Air Force Institute of Technology, 1999. |