蜂群算法求解支持模糊QoS约束的电子采购模型

基于Web的电子物流采购是电子商务的热点.通过将模糊量化的QoS约束加入到Web电子物流采购模型,构造一种带有QoS约束的Web电子物流采购模型,并设计一种改进的人工蜂群算法进行求解.模型基于现有Web采购系统的采购模式,融合了非功能性Web服务评价理论,着重将带QoS约束的电子物流采购选择过程与人工蜂群算法求解过程相结合,从而能快速准确地获得使整体利益最大的解.经仿真计算,验证了模型的有效性.     

基于偏好关系的制造工艺资源评价与选择的模糊决策方法

制造工艺资源的评价和选择是实现资源优化配置的关键技术.本文分析了协同工艺设计中制造工艺资源选择决策研究状况,应用模糊数和模糊决策理论,建立基于偏好关系的制造工艺资源模糊评价模型,研究一种基于偏好关系的隶属度函数求解算法和基于偏序关系的多方案制造工艺资源排序决策方法,最后给出一个算例验证本文提出的资源评价方法的合理性和有效性.     

基于灰色关联聚类的协同过滤推荐算法

针对协同过滤推荐系统具有数据的高稀疏,高维度,数据量大的特点,本文将灰色关联聚类与协同过虑推荐算法相结合,构建了灰色关联聚类的协同过滤推荐算法,将其应用到协同过滤推荐系统中,以解决数据具有高稀疏高维度的特性情况下的个性化推荐质量问题。首先,定义了推荐系统中的用户项目评分矩阵,用户灰色绝对关联度,用户灰色相似度,用户灰色关联聚类。然后,给出了灰色关联聚类的协同过滤推荐算法的计算方法和步骤,同时给出了评价推荐质量方法。最后,将本文算法与基于余弦,相关分析及修正的余弦等协同过滤推荐算法在大小不同的数据集下进行了实验,实验表明灰色关联聚类的协同过滤推荐算法相较于传统的协同过滤推荐方法具有推荐质量高,计算量小,对数据大小要求不高等优点,同时在推荐系统的冷启动,稳定性和计算效率方面也具有一定的优势。     

基于改进NSGA-II算法的云制造服务组合优化研究

云制造任务日趋复杂,与基于云制造的云服务组合优化问题相关的指标日益增多,需要综合考虑各个评价指标,从海量备选云服务中筛选出最优服务组合。本文针对云制造的特点,从线上、线下两方面构建了云制造服务评价指标体系;为了更好地处理高维多目标优化问题并消除实际问题中的量纲影响,本文利用改进的α支配策略代替帕累托支配改进NSGA-II算法,提出了基于nα支配的NSGA-II算法。最后,本文通过一个电机制造案例验证了提出算法的可行性,并通过与标准NSGA-II算法、r-NSGA-II算法和基于模糊支配的NSGA-II算法对比,证明了提出算法得到的解集更优、更小,能够大大减小后续组合优选的计算量。     

应急物流LRP鲁棒双层优化模型研究

考虑到突发事件下受灾点对救灾物资需求的不确定性,针对应急物流设施的定位和车辆运输救灾物资路线进行协同研究,建立了应急物流设施定位-车辆路线选择问题(LRP)鲁棒双层优化模型.运用分散式决策方式下的转化定理,将所建立的含有不确定系数的层次关联协同优化模型进行确定性转化,并设计一种混合遗传算法对转化后的确定性双层规划模型进行求解,最后,通过实例验证了模型的合理性及算法的可行性.     

带客户协同分仓的动态车辆路径问题研究

随着互联网商业迭代的不断深化,越来越多的企业倾向于从商品前置视角解决配送距离与配送时效性的矛盾。为此,本文研究基于客户协同分仓备货的动态车辆调度问题(Dynamic Vehicle Routing Problem with Inventory Synergetic Customer, DVRP-ISC),设计考虑区域分异特征的协同分仓客户选择方法,建立多阶段动态配送网络优化模型。鉴于研究问题的特殊性,设计多阶段两级网络协同配送路径优化算法;最后,以仿真算例、自定义算例集和基准算例,验证所提模型和算法性能及其拓展性。     

Web服务环境下基于信息协商的组合服务多属性选择方法

Web服务环境下,通过对QoS感知服务选择问题及信息协商流程的形式化描述分析,从信息协商的重复考虑用户需求特点出发,提出了基于信息协商的组合服务选择方法及具体实现途径。该方法能综合体现动态协商和犹豫度特点,并且有效避免了评价信息的丢失。最后,通过实例分析表明该方法对于Web服务环境下组合服务选择应用的可行性和有效性。     

智能制造环境下的备件生产与运输协同调度问题研究

智能制造和即时配送环境下的备件生产与运输协同调度问题是目前国内研究的一大热点,这是因为备件供应链响应速度已成为当前备件制造企业赢得客户的关键因素。为了提高客户满意度,尽可能缩短从客户下达定制化生产订单到订单配送完成的时间,本文建立了以所有客户总等待时间最短为目标的混合整数规划模型和集合覆盖模型,推导了最优解性质,并设计改进的分支定价算法求得最优解。通过将小规模算例结果与CPLEX进行对比,验证了模型和算法的有效性。多组算例测试结果表明,所提出的模型和算法可以有效提升智能制造环境下的备件供应链运作效率。     

一种基于用户识别特征模型的中医药健康养老信息推送算法

通过分析传统协同过滤算法的优缺点,设计构建用户识别特征模型,并提出基于用户识别特征模型的协同过滤算法,将经典协同过滤算法与基于用户识别特征模型的协同过滤算法进行比较试验,分析基于用户识别特征模型的协同过滤算法相对于经典协同算法的优势,进而证明其能够在中医药健康养老信息的推送过程中提高效率。     

出库量急增情景下仓储出入库排队协作模型及线性化算法

针对事件驱动的制造企业或商业企业的仓储出库量急增压力,分析仓储出入库协同排队过程,从优化仓储服务效率的维度提高企业运营响应能力。通过引入排队溢出和工作车分流串联过程,建立两级出入库排队服务系统,实时将等待时间大于控制阈值的出库需求溢流到后方服务台完成协同服务。模型全面分析了多种情景下的出入库服务人员优化配置方案;开发了将马尔可夫状态转移函数进行线性化的算法,使得该模型及其类似问题可以在更加广泛的软件环境下进行求解。数值计算结果表明,两级排队协同服务模型利用原有可用资源,有效地缓解出库量急增时的订单积压问题,对提升企业仓储物流管理的实时情报分析和智能化水平具有重要价值。     

QoS and energy consumption aware service composition and optimal-selection based on Pareto group leader algorithm in cloud manufacturing system

Service composition and optimal selection (SCOS) is one of the key issues for implementing a cloud manufacturing system. Exiting works on SCOS are primarily based on quality of service (QoS) to provide high-quality service for user. Few works have been delivered on providing both high-quality and low-energy consumption service. Therefore, this article studies the problem of SCOS based on QoS and energy consumption (QoS-EnCon). First, the model of multi-objective service composition was established; the evaluation of QoS and energy consumption (EnCon) were investigated, as well as a dimensionless QoS objective function. In order to solve the multi-objective SCOS problem effectively, then a novel globe optimization algorithm, named group leader algorithm (GLA), was introduced. In GLA, the influence of the leaders in social groups is used as an inspiration for the evolutionary technology which is design into group architecture. Then, the mapping from the solution (i.e., a composed service execute path) of SCOS problem to a GLA solution is investigated, and a new multi-objective optimization algorithm (i.e., GLA-Pareto) based on the combination of the idea of Pareto solution and GLA is proposed for addressing the SCOS problem. The key operators for implementing the Pareto-GA are designed. The results of the case study illustrated that compared with enumeration method, genetic algorithm (GA), and particle swarm optimization, the proposed GLA-Pareto has better performance for addressing the SCOS problem in cloud manufacturing system.     

A traffic control algorithm for Clos network type ATM switches

This paper presents a new traffic control algorithm for asynchronous transfer mode (ATM) switches composed of Clos network type switch fabric. In most traffic control algorithms previously proposed, an ATM switch has been considered as a single node, although the switch fabric of an ATM switch is usually of a network type. In this paper, we suggest a new control algorithm that is designed not only for the ATM network but also for the switch fabric and that can maintain high speed even in cases where buffer capacity of the switch fabric is limited. Main modules of the suggested algorithm are a traffic status detection mechanism based on non-parametric statistical tests, a cell-loss detection mechanism, and a cluster-based fair share computation procedure. Results of simulation experiments show that the suggested algorithm satisfactorily adjusts traffic rate of available bit rate services according to changes in traffic rate used by quality of service (QoS) guaranteed services. The results also show that the algorithm prevents cell losses relatively well and keeps the delay time of QoS guaranteed services short enough.     

Resource allocation for end-to-end QoS provisioning in a hybrid wireless WCDMA and wireline IP-based DiffServ network

In the future UMTS network, the heterogeneous traffics of multimedia services demand various QoS provisioning. At the same time, the seamlessly conveying of information between mobile users and a hybrid network requires the networking from wireless to wireline domains. However, in both academia and industries, the end-to-end QoS provisioning in the integration of wireline and wireless networks remains a challenge. In this paper, a modeling of a hybrid wireless WCDMA and wireline IP-based DiffServ network is presented to investigate the resource allocation for end-to-end QoS provisioning for multimedia services. In the wireless domain, the mathematical modeling of the cross-layer model including the physical layer, the link layer and the network layer is built. The connection admission control scheme is implemented based on the cross-layer model to determine the amount of resource for different services. In the wireline domain, we define the mapping of QoS classes between UMTS and DiffServ networks according to different QoS requirements. We propose a bandwidth allocation scheme to provide satisfactory packet loss and delay guarantee in DiffServ networks. The final end-to-end admission control scheme combines the resource allocation and admission control in both wireless and wireline domains. The analytical and simulation results show that the proposed resource allocation and admission control schemes work cooperatively in the presented hybrid wireless and wireline networks to guarantee the end-to-end QoS requirements for multimedia services.     

Simulation and Analysis of a New Mobility Model for Mobile Communication Networks

The traffic generation models, which describe how the clients use the network services, as well as the mobility models, which describe how clients move within the service area covered by the network, are essential tools for QoS analysis in these environments. In this paper we present the simulation of a new mobility model implemented for the analysis of QoS parameters of a mobile network, such as channel occupation time, handoff and new call blocking probabilities.     

面向可选服务的产品服务系统配置研究

可选服务是制造企业继必选服务后获取差异化服务竞争优势的有效手段,类似于必选服务,可选服务模块的设计与选择对产品功效和企业服务成本均有影响。本文运用模糊测度研究产品模块与可选服务模块之间的相关关系,建立客户满意度最大和企业成本最小的多目标优化模型,求解不同相关关系下面向可选服务的产品服务系统配置方案;以某制造企业矿渣立磨机产品模块与可选服务模块配置为例,验证了方法的有效性。研究结果表明：产品模块与可选服务模块的相关关系会影响产品服务系统配置方案,相关关系越强,客户越在意重视度较高模块的质量和功能,市场成本报价越高,可选服务在方案配置过程中越重要。本文为企业提供面向可选服务的产品服务系统配置方案提供借鉴。     

Integrated service network design for a cross-docking supply chain network

This paper considers an integrated service network design problem for a given set of freight demands that is concerned with integration of locating cross-docking (CD) centers and allocating vehicles for the associated direct (transportation) services from origin node to a CD center or from a CD center to the destination node. For the vehicle allocation, direct services (sub-routes) should be determined for the given freight demands, and then the vehicle allocation has to be made in consideration of routing for the associated direct service fulfillment subject to vehicle capacity and service time restriction. The problem is modeled as a path-based formulation for which a tabu-search-based solution algorithm is proposed. To guarantee the performance of the proposed solution algorithm, strong valid inequalities are derived based on the polyhedral characteristics of the problem domain and an efficient separation heuristic is derived for identifying any violated valid inequalities. Computational experiments are performed to test the performance of the proposed solution algorithm and also that of a valid-inequality separation algorithm, which finds that the solution algorithm works quite well and the separation algorithm provides strengthened lower bounds. Its immediate application may be made to strategic (integrated) service network designs and to tactical service network planning for the CD network.     

Reallocation of paths of ABR services in a multistage interconnection network (MIN)-type ATM switch network

In this paper, we develop algorithms for reallocating paths of available bit rate (ABR) services in an asynchronous transfer mode (ATM) switch network. ATM traffic control for fair share bandwidth allocation is usually performed under the assumption that paths of all services in a switch network are fixed. However, each connection may have multiple paths from an ingress queue to an egress queue since most ATM switch networks have the structure of the multistage interconnection network of switch elements. Therefore, paths already established for ABR connections may have to be changed to enhance throughput of the switch, if the ATM switch has the capability of adjusting paths of ABR connections while they are being served. We present three algorithms, in which throughput for ABR connections is estimated to decide whether or not paths of the connections should be changed. These algorithms are compared with an existing traffic management algorithm through simulation experiments. Results of the experiments show that the suggested algorithms give higher throughput in terms of the number of transmitted ABR cells without increasing the delay time of ABR services as well as quality of service (QoS) guaranteed services or decreasing the number of transmitted cells of QoS guaranteed services.     

A quality of service negotiation-based vertical handoff decision scheme in heterogeneous wireless systems

This paper introduces a novel vertical handoff decision scheme. The objective is to provide users with enhanced quality of service (QoS) and maximize the network revenue. This scheme balances both-side interests via a suitably defined network merit function and a user–operator negotiation model. The merit function evaluates network performance based on user preferences and decides the most appropriate network for users. The negotiation model is defined as a semi-Markov decision process (SMDP). An optimal policy that maximizes the network revenue without violating QoS constraints is found by resolving the SMDP problem using Q-learning. Furthermore, a time-adaptive QoS monitoring mechanism is combined with the merit function in order to decrease the power consumption on terminal interface activation. The simulation results demonstrate that the proposed vertical handoff decision scheme enhances the performance in terms of power consumption, handoff call-dropping probability (HCDP) and network revenue.