An optimization framework for workplace charging strategies

The workplace charging (WPC) has been recently recognized as the most important secondary charging point next to residential charging for plug-in electric vehicles (PEVs). The current WPC practice is spontaneous and grants every PEV a designated charger, which may not be practical or economic when there are a large number of PEVs present at workplace. This study is the first research undertaken that develops an optimization framework for WPC strategies to satisfy all charging demand while explicitly addressing different eligible levels of charging technology and employees’ demographic distributions. The optimization model is to minimize the lifetime cost of equipment, installations, and operations, and is formulated as an integer program. We demonstrate the applicability of the model using numerical examples based on national average data. The results indicate that the proposed optimization model can reduce the total cost of running a WPC system by up to 70% compared to the current practice. The WPC strategies are sensitive to the time windows and installation costs, and dominated by the PEV population size. The WPC has also been identified as an alternative sustainable transportation program to the public transit subsidy programs for both economic and environmental advantages.     

An optimization model for integrated planning of railway traffic and network maintenance

Railway transportation systems are important for society and have many challenging and important planning problems. Train services as well as maintenance of a railway network need to be scheduled efficiently, but have mostly been treated as two separate planning problems. Since these activities are mutually exclusive they must be coordinated and should ideally be planned together. In this paper we present a mixed integer programming model for solving an integrated railway traffic and network maintenance problem. The aim is to find a long term tactical plan that optimally schedules train free windows sufficient for a given volume of regular maintenance together with the wanted train traffic. A spatial and temporal aggregation is used for controlling the available network capacity. The properties of the proposed model are analyzed and computational experiments on various synthetic problem instances are reported. Model extensions and possible modifications are discussed as well as future research directions.     

Solving the gate assignment problem through the Fuzzy Bee Colony Optimization

In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers’ total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.     

Macroscopic multiple-station short-turning model in case of complete railway blockages

In case of railway disruptions, traffic controllers are responsible for dealing with disrupted traffic and reduce the negative impact for the rest of the network. In case of a complete blockage when no train can use an entire track, a common practice is to short-turn trains. Trains approaching the blockage cannot proceed according to their original plans and have to short-turn at a station close to the disruption on both sides. This paper presents a Mixed Integer Linear Program that computes the optimal station and times for short-turning the affected train services during the three phases of a disruption. The proposed solution approach takes into account the interaction of the traffic between both sides of the blockage before and after the disruption. The model is applied to a busy corridor of the Dutch railway network. The computation time meets the real-time solution requirement. The case study gives insight into the importance of the disruption period in computing the optimal solution. It is concluded that different optimal short-turning solutions may exist depending on the start time of the disruption and the disruption length. For periodic timetables, the optimal short-turning choices repeat due to the periodicity of the timetable. In addition, it is observed that a minor extension of the disruption length may result in less delay propagation at the cost of more cancellations.     

视讯会议系统“一键点名”功能硏究

以铁路视讯会议网工程建设标准和视讯会议系统网管的标准配置文件为基础,通过反复试验和结果分析,确定广铁集团视讯会议操作繁琐的原因,并提出相应的优化方案,提高了广铁集团视讯会议系统会议控制的效率。     

Dynamic traffic metering in urban street networks: Formulation and solution algorithm

Traffic metering offers great potential to reduce congestion and enhance network performance in oversaturated urban street networks. This paper presents an optimization program for dynamic traffic metering in urban street networks based on the Cell Transmission Model (CTM). We have formulated the problem as a Mixed-Integer Linear Program (MILP) capable of metering traffic at network gates with given signal timing parameters at signalized intersections. Due to the complexities of the MILP model, we have developed a novel and efficient solution approach that solves the problem by converting the MILP to a linear program and several CTM simulation runs. The solution algorithm is applied to two case studies under different conditions. The proposed solution technique finds solutions that have a maximum gap of 1% of the true optimal solution and guarantee the maximum throughput by keeping some vehicles at network gates and only allowing enough vehicles to enter the network to prevent gridlocks. This is confirmed by comparing the case studies with and without traffic metering. The results in an adapted real-world case study network show that traffic metering can increase network throughput by 4.9–38.9% and enhance network performance.     

Optimal design of electric vehicle public charging system in an urban network for Greenhouse Gas Emission and cost minimization

In this paper, we address the optimization problem of allocation of Electric Vehicle (EV) public fast charging stations over an urban grid network. The objective is to minimize Greenhouse Gas Emissions (GHG) under multiple constraints including a limited agency budget, accessibility of charging stations in every possible charging request and charging demands during peak hours. Additionally, we address bi-criteria problems to consider user costs as the second objective. A convex parsimonious model that depends on relatively few assumptions and input parameters is proposed and it is shown to be useful for obtaining conceptual insights for high-level planning. In a parametric study using a hypothetical urban network model generated based on realistic parameters, we show that GHG emissions decrease with agency budget, and that the reductions vary depending on multiple factors related to EV market and EV technologies. The optimal solutions found from the bi-criteria problems are shown to be close to the solution minimizing GHG emissions only, meaning that the emission minimizing policy can also minimize user costs.     

钩形外锁闭装置锁闭框组优化的探讨

钩形外锁闭装置在实践中逐步暴露出一些诸如转换不畅、卡阻,磨耗严重,适应尖轨窜动性不良等问题.为此研究探讨对既有的外锁闭装置锁闭框组（包括锁闭框、锁闭铁、耐磨板等）进行优化,提高道岔转换的可靠性.     

Optimal placement of omnidirectional sensors in a transportation network for effective emergency response and crash characterization

Rapid motor vehicle crash detection and characterization is possible through the use of Intelligent Transportation Systems (ITS) and sensors are an integral part of any ITS system. The major focus of this paper is on developing optimal placement of accident detecting omnidirectional sensors to maximize incident detection capabilities and provide ample opportunities for data fusion and crash characterization. Both omnidirectional sensors (placed in suitable infrastructure locations) and mobile sensors are part of our analysis. The surrogates used are acoustic sensors (omnidirectional) and Advanced Automated Crash Notification (AACN) sensors (mobile). This data fusion rich placement is achieved through a hybrid optimization model comprising of an explicit–implicit coverage model followed by an evaluation and local search optimization using simulation. The compound explicit–implicit model delivers good initial solutions and improves the detection and data fusion capabilities compared to the explicit model alone. The results of the studies conducted quantify the use of a data fusion capable environment in crash detection scenarios, and the simulation tool developed helps a decision maker evaluate sensor placement strategy.     

NT4-Ant-Shepherdin[79-87]融合基因重组载体的构建

目的设计构建携带NT4-Ant-Shepherdin[79-87]的cDNA融合基因的重组载体,为针对Survivin的靶向治疗奠定基础。方法应用非对称引物/模板法、PCR技术制备NT4-Ant-Shepherdin[79-87]cDNA片断,连接于pGEM-T-Easy载体,经克隆测序、酶切后与PBV220/NT4质粒连接;转化感受态细胞E.coliDH5α,亚克隆获得NT4-Ant-Shepherdin[79-87]融合基因。结果克隆出Ant-Shepherdin[79-87]基因,经酶切及测序证实结果正确;连接PBV220/NT4,经克隆、酶切,琼脂糖凝胶电泳证实获得321bp的NT4-Ant-Shepherdin[79-87]目的基因片断。结论通过分子生物学技术成功构建了携带NT4-Ant-Shepherdin[79-87]融合基因的重组载体,为进一步研究针对Survivin的靶向抗肿瘤作用奠定了基础。