• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (9): 51-56.

• 论文 • 上一篇    下一篇

情景感知的物流Web服务动态优化组合研究

刘志中,宋成,薛霄,徐秀珍   

  1. (河南理工大学计算机科学与技术学院,河南 焦作 454000)
  • 收稿日期:2013-05-08 修回日期:2013-07-26 出版日期:2013-09-25 发布日期:2013-09-25
  • 基金资助:

    国家自然科学基金面上基金资助项目(61175066);国家自然科学基金青年基金资助项目(60905041,61202136,61300124);中国博士后科学基金资助项目(20110490396);河南省高校科技创新人才资助计划资助项目(2011GGJS056);河南理工大学校博士基金资助项目(132300410332);河南省科技厅基础与前沿技术研究(T20133);河南理工大学创新型科研团队支持计划资助项目;河南省教育厅科学技术研究重点项目(13B630034)

Research on dynamic optimal composition
of contextaware logistics Web service       

LIU Zhizhong,SONG Cheng,XUE Xiao,XU Xiuzhen   

  1. (College of Computer Science and Technology,Henan Polytechnic University,Jiaozuo 454000,China)
  • Received:2013-05-08 Revised:2013-07-26 Online:2013-09-25 Published:2013-09-25

摘要:

第四方物流服务通过大规模的资源整合,可以将领域内优秀的物流服务组合起来,为用户提供技术、仓储、运输服务等最佳结合的物流服务方案,实现物流服务的低成本、高效率、实时运作。然而,如何高效、动态地构建满足用户服务质量需求的可靠物流服务组合,是第四方物流服务商亟需解决的关键问题。针对这一问题,提出了一种情景感知的物流Web服务动态组合方法,该方法首先基于改进的遗传算法,将用户提出的全局QoS约束分解成局部QoS约束,从而将QoS感知的物流Web服务组合这一全局优化问题转化成局部最优服务选择问题;然后,在物流服务流程执行的过程中,依据当前关键的情景信息,选出可用并且能够满足局部QoS约束的最优物流服务;最后,通过实验验证了所设计方法的可行性和有效性。

关键词: 情景感知, 物流Web服务, 约束分解, 遗传算法

Abstract:

The fourth party logistics services are able to combine excellent logistics services through largescale integration of resources, and provide the best logistics services scheme for the user through combination of technology, warehousing, transportation service, thus realizing the logistics service with high efficiency, low cost and realtime operation. However, how to dynamically construct reliable composite logistics service that can satisfy users’ quality requirements is the critical issue for the fourth party logistics service provider to solve. To address this issue, the paper proposes a dynamic composition method of contextaware logistics Web service. Firstly, this method decomposes the global QoS constraints into local QoS constraints based on the improved genetic algorithm, and transforms the global optimization problem into a local optimal service selection problem. Secondly, during the execution of the service process, the best logistic Web service that is available and can satisfy the local QoS constraints is selected. Finally, the effectiveness and feasibility of the method are validated by experiments.

Key words: contextaware;logistics web services;constraint decomposition;genetic algorithm