典型楼控系统的比较及选型研究

本文针对主流楼控技术的网络架构、协议及某网站实验室的国内外楼控系统的排名进行了相应的分析研究，并重点比较了国内外典型楼控系统的各项数据，为楼控的产品选型提供了有力依据。     

A note on the time travel approach for handling time windows in vehicle routing problems

In this paper, we identify two cases in which the proposition for calculating time window penalties presented in Nagata, Y., Bräysy, O. and Dullaert, W. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Computers & Operations Research 2010;37(4): 724–37 yields incorrect results. We derive the corrected proposition and use numerical studies to show that a significant proportion of the evaluations performed by a Tabu Search for VRPTW falls under the two incorrect cases. Moreover, we demonstrate that the incorrect time window handling has a significant negative impact on the solution quality of the Tabu Search.     

A heuristic to solve the synchronized log-truck scheduling problem

We present a synchronized routing and scheduling problem that arises in the forest industry, as a variation of the log-truck scheduling problem. It combines routing and scheduling of trucks with specific constraints related to the Canadian forestry context. This problem includes aspects such as pick-up and delivery, multiple products, inventory stock, multiple supply points and multiple demand points. We developed a decomposition approach to solve the weekly problem in two phases. In the first phase we use a MIP solver to solve a tactical model that determines the destinations of full truckloads from forest areas to woodmills. In the second phase, we make use of two different methods to route and schedule the daily transportation of logs: the first one consists in using a constraint-based local search approach while the second one is a hybrid approach involving a constraint programming based model and a constraint-based local search model. These approaches have been implemented using COMET2.0. The method, was tested on two industrial cases from forest companies in Canada.     

基于第三方物流的家具配送开放式车辆路径问题

为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本.     

高速率通信网络下时变系统的有限时域H∞控制

针对高速率通信网络和Round-Robin（RR）协议影响下网络化时变系统的有限时域[H∞]控制问题，考虑到系统中存在乘性噪声、随机时滞和量化效应，提出了一种基于观测器的有限时域[H∞]控制器的设计方法。利用李雅普诺夫稳定性理论和线性矩阵不等式（Linear Matrix Inequality，LMI）技术得到有限时域[H∞]控制器存在的充分条件。基于锥补线性化（Cone Complementarity Linearization，CCL）方法通过求解一组递归矩阵不等式得到观测器和控制器参数。所设计的控制器保证闭环网络化时变系统在给定的时域内稳定，且满足预定的[H∞]性能指标。数值仿真验证了所提方法的有效性。     

Providing reliable and link stability‐based geocasting model in underwater environment

This paper presents a geocast technique for underwater sensor networks. The model named as Routing and Multicast Tree based Geocasting (RMTG) (TRACE'10, Bhopal, India, 2010; ICWET'10, Mumbai, India, 2010) has been designed for underwater sensor networks. In our previous work (TRACE'10, Bhopal, India, 2010; ICWET'10, Mumbai, India, 2010) we proposed only a theoretical model for underwater geocasting. The RMTG technique uses greedy forwarding and previous hop handshaking to route the packets towards the geocast region and further disseminates the data within the geocast region by creating a multicast shortest path tree. We also presented various link broken scenarios along with their solutions. The proposed model does not use the flooding technique to deliver the packets inside the geocast region that is used in most of the geocasting techniques. In this paper, we present the simulated RMTG model. The simulation results show that the proposed model provides an efficient distribution of data in the geocast region in terms of node mobility handling, packet delivery ratio and a better end‐to‐end latency. Most of the work on geocasting has been done for mobile and vehicular ad hoc networks; hence we present in this paper a novel simulated model for underwater environment. Copyright © 2011 John Wiley & Sons, Ltd.     

Historical data learning based dynamic LSP routing for overlay IP/MPLS over WDM networks

Overlay IP/MPLS over WDM network is a promising network architecture starting to gain wide deployments recently. A desirable feature of such a network is to achieve efficient routing with limited information exchanges between the IP/MPLS and the WDM layers. This paper studies dynamic label switched path (LSP) routing in the overlay IP/MPLS over WDM networks. To enhance network performance while maintaining its simplicity, we propose to learn from the historical data of lightpath setup costs maintained by the IP-layer integrated service provider (ISP) when making routing decisions. Using a novel historical data learning scheme for logical link cost estimation, we develop a new dynamic LSP routing method named Existing Link First (ELF) algorithm. Simulation results show that the proposed algorithm significantly outperforms the existing ones under different traffic loads, with either limited or unlimited numbers of optical ports. Effects of the number of candidate routes, add/drop ratio and the amount of historical data are also evaluated.     

A fast IP lookup scheme for high speed routers

Abstract

One of the key design issues for the next generation of IP routers is the IP lookup mechanism. IP lookup is an important action in a router, that is, to find the next hop for each incoming packet with a longest‐prefix‐match address in the routing table. In this paper, we propose an IP lookup mechanism with the number of memory accesses for an IP lookup being one in the best case and being four in the worst case. The forwarding table needed by our mechanism is small enough to fit in the SRAM. For example, a large routing table with 40000 routing entries can be compacted to a forwarding table of 260KBytes in our scheme.     

Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems

This article presents the variable neighbourhood simulated annealing (VNSA) algorithm, a variant of the variable neighbourhood search (VNS) combined with simulated annealing (SA), for efficiently solving capacitated vehicle routing problems (CVRPs). In the new algorithm, the deterministic ‘Move or not’ criterion of the original VNS algorithm regarding the incumbent replacement is replaced by an SA probability, and the neighbourhood shifting of the original VNS (from near to far by k← k+1) is replaced by a neighbourhood shaking procedure following a specified rule. The geographical neighbourhood structure is introduced in constructing the neighbourhood structures for the CVRP of the string model. The proposed algorithm is tested against 39 well-known benchmark CVRP instances of different scales (small/middle, large, very large). The results show that the VNSA algorithm outperforms most existing algorithms in terms of computational effectiveness and efficiency, showing good performance in solving large and very large CVRPs.     

Development of a cross-section based streamflow routing package for MODFLOW

It is challenging to simulate stream-aquifer interactions for the wide channel streams with the existing stream routing packages of MODFLOW. To overcome this limitation, a Cross-Section streamflow Routing (CSR) package is developed to simulate the streamflow and the interaction between streams and aquifers for the stream with a width larger than the MODFLOW grid size. In the CSR package, streams are divided into stream segments which are formed by two consecutive cross-sections. A cross-section is described by a number of streambed points that determine the geometry and hydraulic properties of the streambed. The stream water depth and streamflow at the cross-sections are related by the Single Channel method, the Divided Channel method, a data table or a power function. A rapid algorithm is used to compute the submerged area of the MODFLOW grid. The streambed conductance of a grid cell is computed based on its submerged area, streambed hydraulic conductivity and thickness. Stream-aquifer seepage is subsequently estimated as the product of the streambed conductance and difference between the stream stage and groundwater hydraulic head. Stream-aquifer seepage is treated as lateral flow in the streamflow routing computation with the Muskingum-Cunge method or mass conservation method. A hypothetical problem is established to test the capabilities of the CSR package with steady- and transient-state models. The results compare favorably with the SFR2 package and the HEC-RAS model. However, significant difference in flood wave attenuation is observed between the CSR package and the SFR2 package. It proves that the CSR package is capable of simulating the variation of stream-aquifer interactions in both space and time efficiently. The CSR package represents a certain improvement over previous MODFLOW streamflow packages by providing the efficient cross-section based computation and the unique capability of simulating streambed heterogeneity in longitudinal and transverse directions.