基于定位辅助按需拓扑维护的超宽带自组网路由算法

提出了一种基于定位辅助按需拓扑维护的超宽带自组网路由算法,该算法利用超宽带技术精确定位信息所获得的网络拓扑信息和路由信息进行分组转发,路由维护阶段在定位信息辅助下采用按需方式进行断链路由的修复和拓扑维护,通过基于位置信息的按需路由发现和限制路由查找范围,以及定位信息和网络拓扑信息的及时更新,在降低协议开销的同时保证了算法的有效性。仿真表明,该算法在分组丢失率、平均端到端时延和路由附加开销等方面具有良好性能,其优良的分布式控制特征能适应超宽带自组网的动态环境。     

一种基于MPLS业务量工程的选路机制

分析了诸如受限路由等传统QoS路由机制业务震荡现象出现的原因给出了呼叫级QoS路由和分组级QoS路由的概念在此基础上提出了多标签QoS路由机制(MLR)作为一种分组级QoS路由机制多标签QoS路由机制不仅能够从理论上避免业务震荡现象的出现同时由于采用了业务量工程的业务均衡的思想从而提高了全网的业务性能指标仿真的数据结果可以在同时运行实时业务和非实时业务下得到     

以太网光桥的研究

根据有关网络技术和具体的实验,提出一种以太网光桥的实现方案,并对光桥的几个性能参数进行了分析讨论。     

Inapproximability and approximability of maximal tree routing and coloring

Let G be a undirected connected graph. Given g groups each being a subset of V(G) and a number of colors, we consider how to find a subgroup of subsets such that there exists a tree interconnecting all vertices in each subset and all trees can be colored properly with given colors (no two trees sharing a common edge receive the same color); the objective is to maximize the number of subsets in the subgroup. This problem arises from the application of multicast communication in all optical networks. In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Ω(g^1−ε)-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O√|E(G)|, which matches the theoretical bounds. Supported in part by the NSF of China under Grant No. 70221001 and 60373012.     

动态车辆路径问题排队模型分析

分析了一类动态车辆路径问题,其中顾客需求以泊松流形式出现,现场服务时间服从一般分布.提出解决该问题的两种策略:顺序服务策略和中点改进策略,利用排队论、几何概率论等领域的知识分别求出了这两种策略的系统时间,并通过仿真数据实验验证了这两种策略的有效性.     

基于自组网技术的燃气无线抄表系统研究

为解决现阶段燃气无线抄表系统数据采集中无线网络不稳定、路由协议复杂、自修复能力薄弱等问题，提出并设计了一种基于cc1101无线传送模块的树形拓扑结构无线自组网系统。系统中主要对数据采集层路由协议和硬件实现进行了研究和设计，分析了该燃气无线抄表系统与传统燃气无线抄表系统的不同之处，设计了该系统数据采集层网络传输协议和总体结构。无线节点建在穿透力强的433 MHz的频率下进行通信，保证了系统自组网的稳定快速。     

Flexible work planning of service agents with load balancing

This work emerged from the need to better plan the daily work of 29 travelling service agents, who provide 1090 services to 412 customers in 283 sites, on daily average. A handy and flexible tool was developed and is presented herein. A major contribution of this study is an explicit consideration of the multi-dimensional nature of the problem by the inclusion of workload balancing, which may stand in conflict to cost minimisation. Further, the geographical distribution of the demand is highly irregular. Therefore, two load measures are required and balanced. This required to fitting a proper planning scheme. The planning tool has been applied successfully by the commercial service provider. Improvements in the order of 20% and more were obtained in key performance measures. Moreover, cost reductions, service improvement and load balance were obtained simultaneously: the standard deviations of the service times and working day’s duration were reduced by 18 and 58%, respectively. This enables to reduce the number of agents with no significant harm in performance. Additional practical advantages of the proposed tool are also discussed and demonstrated, for example, the ability to cope with geographical distributions and the flexibility to respond to daily variations in demand.     

An oracle-based algorithm for robust planning of production routing problems in closed-loop supply chains of beverage glass bottles

The demand for glass bottles is exhibiting an upward trend over time. The manufacturing of glass bottles is costlier in terms of time and resources and is associated with a higher level of heat generation and environmental pollution compared to recycling processes. In response to the aforementioned challenges, companies that use glass bottles need to implement strategies to manage their reverse supply chains in conjunction with their traditional supply chains, as the economic and environmental benefits of returned products are unquestionable. Closed-loop supply chains (CLSCs) integrate forward and reverse flows of products and information. This integration helps companies to have a broader view of the whole chain. Despite these advantages, managing CLSCs can be challenging as they are exposed to many uncertainties regarding supply and demand processes, travel times, and quantity/quality of returned products.In this study, we consider the production planning, inventory management, and vehicle routing decisions of a CLSC of beverage glass bottles. We propose an MILP model and rely on a multi-stage adjustable robust optimization (ARO) formulation to deal with the randomness in both the demand for filled bottles and the requests for pickups of empty bottles. We develop an exact oracle-based algorithm to solve the ARO problem and propose a heuristic search algorithm to reduce the solution time. Our numerical experiments not only show the incompetency of the customary method, namely the affine decision rule approach, but also illustrate how our algorithms can solve the small-size problems and significantly improve the quality of the obtained solution for large problems. Furthermore, our numerical results show that robust plans tend to be sparse, meaning the routes are chosen so that empty bottles are transported to production sites in such a way that fewer new bottles need to be ordered. Thus, robust planning makes the CLSCs more environmentally friendly.     

河北省金融资源充分利用的路径选择

在开放的市场条件下,金融作为现代经济的核心,其资源的优化配置对区域经济发展有着及其重要的作用,本文根据河北省金融资源配置现状,分析了河北省金融资源利用中存在的问题,指出要充分利用河北省金融资源,必须从调整经济产业结构、改善金融生态环境、抑制金融资源外流和提高金融业自身水平做起。只有这样才能提高河北金融的竞争能力,促进河北经济的整体发展。     

Adaptive agent-based manufacturing control and its application to flow shop routing control

The manufacturing industry is currently facing unprecedented challenges from changes and disturbances. The sources of these changes and disturbances are of different scope and magnitude. They can be of a commercial nature, or linked to fast product development and design, or purely operational (e.g. rush order, machine breakdown, material shortage etc.). In order to meet these requirements it is increasingly important that a production operation be flexible and is able to adapt to new and more suitable ways of operating. This paper focuses on a new strategy for enabling manufacturing control systems to adapt to changing conditions both in terms of product variation and production system upgrades. The approach proposed is based on two key concepts: (1) An autonomous and distributed approach to manufacturing control based on multi-agent methods in which so called operational agents represent the key physical and logical elements in the production environment to be controlled – for example, products and machines and the control strategies that drive them and (2) An adaptation mechanism based around the evolutionary concept of replicator dynamics which updates the behaviour of newly formed operational agents based on historical performance records in order to be better suited to the production environment. An application of this approach for route selection of similar products in manufacturing flow shops is developed and is illustrated in this paper using an example based on the control of an automobile paint shop.