基于多旅行商问题的应急设施服务区划分模型

基于多旅行商问题，增设集散中心需求及应急服务设施资源容量约束条件，以最小化遍历区域内全部集散中心的综合旅行时间成本为优化目标，构建一种应急设施服务区划分模型，确定各应急设施的服务区范围.设计一种复合算法求解模型，首先基于P-中值选址模型的优化理念，形成初始方案；继而加入禁忌搜索算法，结合LKH求解器对模型进行迭代优化求得最优解.基于宁波市北仑区实际拓扑网络进行案例分析，验证了模型和求解方法的有效性.     

基于信令数据的出行强度影响因素分析模型

为探究城市交通出行强度影响因素及不同因素的影响程度，本文从土地利用与交通基础设施建设两方面出发，分析包括土地利用混合指数，职住混合率熵指数，公共交通站点 500 m覆盖率，路网可达性等17个指标与出行强度的相关关系；基于相关系数和拟合优度分析，提取7个与出行强度强相关指标，基于所识别指标构建北京市中心城区出行强度多元回归模型.模型结果表明，职住混合率熵指数对出行强度的影响最为显著，公共交通站点覆盖率对出行强度的影响比道路网密度和可达性更为明显.此外，给出单一土地利用/交通基础设施指标对出行强度拟合结果的离群特征分析方法，用于评估不同区域基础设施供给与交通出行需求之间的平衡关系.     

The load-dependent vehicle routing problem and its pick-up and delivery extension

The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet.     

A driver advisory system with dynamic losses for passenger electric multiple units

Driver advisory systems, instructing the driver how to control the train in an energy efficient manner, is one the main tools for minimizing energy consumption in the railway sector. There are many driver advisory systems already available in the market, together with significant literature on the mathematical formulation of the problem. However, much less is published on the development of such mathematical formulations, their implementation in real systems, and on the empirical data from their deployment. Moreover, nearly all the designed driver advisory systems are designed as an additional hardware to be added in drivers’ cabin. This paper discusses the design of a mathematical formulation and optimization approach for such a system, together with its implementation into an Android-based prototype, the results from on-board practical experiments, and experiences from the implementation. The system is based on a more realistic train model where energy calculations take into account dynamic losses in different components of the propulsion system, contrary to previous approaches. The experimental evaluation shows a significant increase in accuracy, as compared to a previous approach. Tests on a double-track section of the Mälaren line in Sweden demonstrates a significant potential for energy saving.     

Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem

In this paper, we study two closely related airline planning problems: the robust weekly aircraft maintenance routing problem (RWAMRP) and the tail assignment problem (TAP). In real life operations, the RWAMRP solution is used in tactical planning whereas the TAP solution is implemented in operational planning. The main objective of these two problems is to minimize the total expected propagated delay (EPD) of the aircraft routes. To formulate the RWAMRP, we propose a novel weekly line-of-flights (LOF) network model that can handle complex and nonlinear cost functions of EPD. Because the number of LOFs grows exponentially with the number of flights to be scheduled, we propose a two-stage column generation approach to efficiently solve large-scale real-life RWAMRPs. Because the EPD of an LOF is highly nonlinear and can be very time-consuming to accurately compute, we propose three lower bounds on the EPD to solve the pricing subproblem of the column generation. Our approach is tested on eight real-life test instances. The computational results show that the proposed approach provides very tight LP relaxation (within 0.6% of optimal solutions) and solves the test case with more than 6000 flights per week in less than three hours. We also investigate the solutions obtained by our approach over 500 simulated realizations. The simulation results demonstrate that, in all eight test instances, our solutions result in less EPDs than those obtained from traditional methods. We then extend our model and solution approach to solve realistically simulated TAP instances.     

Generalized Maximum Benefit Multiple Chinese Postman Problem

This research is focused on a generalization on the Max Benefit Chinese Postman Problem and the multiple vehicle variant of the Chinese Postman Problem. We call this generalization, the Generalized Maximum Benefit k-Chinese Postman Problem (GB k-CPP). We present a novel Mixed Integer Programming (MIP) formulation for the GB k-CPP. Four different cases of the model are discussed. The first case, performs arc-routing with profits and assumes that the origin and destination for each vehicle is the same for each cycle and is given by the user. The next case relaxes the assumption that the origin and destination for each vehicle should be the same and allows the users to select possible origins/destinations for vehicles. Case three gets the origin for each vehicle as input and produces a solution based on finding the best destination for each vehicle. The last case, that is very general, allows the optimization model to select possibly different locations for vehicle origin and destination, during each cycle. The different cases are applied to a security patrolling case conducted on the network of University of Maryland at College Park campus and the results are compared.     

基于名义应力法的动车组车体净水箱吊装部件疲劳强度分析

针对高速运行动车组车体悬挂设备振动疲劳损伤问题,以某型动车组车顶净水箱吊装结构为研究对象,采用名义应力法对吊装结构的焊缝部位进行疲劳强度评估.根据EN 12663标准确定净水箱的工作载荷工况,采用有限元法计算了各工况下结构的振动响应,并基于BS标准计算了焊缝疲劳评估点的寿命.假定各载荷工况出现频率相同的情况下,构造了工作载荷历程,采用Fe-safe软件对焊缝的疲劳寿命进行了仿真分析.两种方法分析结果均表明:焊缝1与焊缝2寿命最低,是结构最易发生疲劳破坏的位置;焊缝位于筋板表面的焊趾寿命低于位于主支撑板表面的焊趾寿命.     

铁路枢纽小运转列车径路优化

以枢纽小运转列车运营成本和货运站装卸费用最小为目标,考虑载重量、列车数和运行时间约束,建立了枢纽小运转列车路径优化模型.并以某铁路枢纽地区为例,运用ILOG CPLEX优化软件仿真求解,得出枢纽小运转列车的最优路径方案.实例证明模型是有效可行的,与实际运行比较,优化后的费用降低近5%,运输距离缩短近8.31%.     

基于动态聚簇结构的无线传感网络在海上通信中的应用

无线传感网络在海上无线通信系统中的应用越来越广泛,而受到海上环境的影响,网络的能量消耗及生命周期是衡量海上无线传感网络最重要的性能参数。传统无线传感网络的数据传输在单个节点之间进行传递,效率较低,而现有的基于簇结构的无线传感网络,把传感网络中的所有传感器节点按照一定的逻辑结构进行划分,增加了系统的传输效率。本文在研究现有的无线传感网络基础上,提出一种基于动态聚簇结构的无线传感网络,并进行仿真。     

A novel wireless personal area network technology： ultra wide band technology

1 Introduction1 Ultra Wideband (UWB) technology is currently being investigated as a promising solution for the bandwidth, cost, power consumption, and physical size requirements of next-generation short range wireless communication systems [1,2,5,6,7,9,1…