汽车车身复杂钣金件的拓扑优化设计

利用有限元方法，结合零件的造型、约束、受力和模态等特点，对汽车车身复杂钣金件进行了拓扑分析和设计。利用激光模态分析仪对实物进行了模态测量，分析结果和测量结果基本一致。从而验证了拓扑优化方法可以用于复杂钣金件的设计，并可以获得最佳的结构和力学特性。     

设计-施工总承包在武汉阳逻长江大桥南锚碇工程中的应用

介绍武汉阳逻长江公路大桥南锚碇工程采用设计-施工总承包模式的经验,对相关的招标和项目管理工作进行总结.针对我国的实际情况,分析该模式在工程建设中的适用范围.     

尼铁现代化项目中矩形空心桥台的优化设计

当前常用的时速200 km的铁路矩形空心桥台参考图中的桥台截面尺寸偏厚,安全富余量很大。为节约混凝土圬工量,希望在保证安全的前提下减少桥台截面尺寸。首先提出专门针对铁路矩形空心桥台台身截面计算的荷载图示,然后利用这一新的图示对拉伊铁路项目中使用的常规矩形空心桥台进行有限元分析,经过不断试算提出最优的截面尺寸。在钢筋用量基本不变的情况下,新尺寸桥台较原参考图中桥台的混凝土用量减少10%以上。对于项目所在地尼日利亚国水泥价格高昂的情况而言,桥台尺寸的这一优化将产生较大的经济效益。     

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.