高铁站功能区布局优化模型研究

为使高铁站功能区的布局更加科学合理,论文以旅客在高铁站房内的平均走行时间最少和高铁站建造成本最低为目标,综合考虑功能区的面积、长宽比例、功能区禁止重叠、流线等约束条件,构建基于多目标混合规划的高铁站功能区布局优化模型,通过算例验证了模型的有效性。该方法得出的结论可以为高铁站功能区布局的规划设计提供参考。     

遗传算法在船舶动力机械混合隔振系统优化设计中的应用

阐明了混合隔振问题的实质就是综合被动隔振系统和主动控制系统的多目标联合优化设计.运用子结构导纳综合法分析了应用混合隔振技术的双层隔振系统的功率流传递特性.采用遗传算法对混合隔振系统进行了优化设计,并作了数值仿真.     

基于黄金比例遗传算法的动车组列车节能优化研究

为研究注重最小化能耗的动车组列车运行控制,针对列车单质点模型受力分析不准确问题,提出一种对附加阻力进行处理的多质点方法,进而以多质点模型为基础进行2次优化。为解决遗传算法寻优时容易陷入局部最优的问题,提出一种基于黄金比例遗传算法的优化方法,1次优化通过该算法为列车运行寻求一组满足约束条件的目标速度集合,获得列车节能运行速度曲线。考虑过电分相对列车运行的影响,进行2次优化,将运行区间划分为操纵固定段和操纵可优化段,并通过黄金比例遗传算法搜索出一组操纵可优化段内满意的工况转换点,结合1次优化得到列车最终运行曲线。以兰考南-开封北线路CRH3型动车组为仿真实例,列车运行能耗降低了10.83%,表明所提方法是可行的。     

土石方调配问题双层规划模型及算法研究

研究目的:针对铁路土石方工程中较少考虑对生态环境影响的现状,研究如何构建合理的土石方调配问题模型,实现铁路土石方工程与生态环境的有效协调,减少对生态环境的影响的同时,从而实现土石方工程系统最优的目标。研究结论:根据土石方工程具体特点,系统地描述土石方调配问题,在此基础上兼顾政府监管部门与施工企业双方不同的利益目标,建立土石方调配问题双层规划模型。在双层规划模型中,上层模型为土石方工程系统最优模型,下层模型为土石方调配费用最低模型。计算结果表明:土石方调配问题双层规划模型在减少对保护生态环境影响同时,降低工程建设成本。     

遗传算法在区段站到发线的应用研究

为解决车站到发线的合理运用问题，采用遗传算建立了到发线运用的染色体结构和适应度函数，对这种复杂的非线性组合优化问题进行了仿真。     

基于自适应遗传算法的路堤边坡稳定性分析方法

基于圆弧滑动面假定,提出了一种用自适应遗传算法搜索最危险滑动面及其对应的最小安全系数的新方法。该方法是一种改进的遗传算法,采用自适应求取适值、动态调整交叉率和变异率、自适应区间收缩。自适应遗传算法有效克服了传统方法易陷入局部极小的缺陷,提高了算法的搜索效率、精度和稳定性。     

Optimization of terminal airspace operation with environmental considerations

The rapid growth in air traffic has resulted in increased emission and noise levels in terminal areas, which brings negative environmental impact to surrounding areas. This study aims to optimize terminal area operations by taking into account environmental constraints pertaining to emission and noise. A multi-objective terminal area resource allocation problem is formulated by employing the arrival fix allocation (AFA) problem, while minimizing aircraft holding time, emission, and noise. The NSGA-II algorithm is employed to find the optimal assignment of terminal fixes with given demand input and environmental considerations, by incorporating the continuous descent approach (CDA). A case study of the Shanghai terminal area yields the following results: (1) Compared with existing arrival fix locations and the first-come-first-serve (FCFS) strategy, the AFA reduces emissions by 19.6%, and the areas impacted by noise by 16.4%. AFA and CDA combined reduce the emissions by 28% and noise by 38.1%; (2) Flight delays caused by the imbalance of demand and supply can be reduced by 72% (AFA) and 81% (AFA and CDA) respectively, compared with the FCFS strategy. The study demonstrates the feasibility of the proposed optimization framework to reduce the environmental impact in terminal areas while improving the operational efficiency, as well as its potential to underpin sustainable air traffic management.     

基于BP网络的球鼻首参数化优化

本文以某集装箱船为研究对象,对降速航行后的球鼻首进行优化。采用Catia建立船体三维模型,为了产生不同形状的球鼻首,选取球鼻特征参数来描述其基本结构;采用拉丁超立方试验抽样方法得到12组不同形状的球鼻首,提出运用非线性拟合能力较强的BP网络构建球鼻首参数和阻力系数之间的关系模型;采用遗传算法对训练后的网络进行极值寻优。结果显示,优化船型的阻力系数显著降低,说明该方法对球鼻首的优化有一定的借鉴意义。     

Methods to reduce dimensionality and identify candidate solutions in multi-objective signal timing problems

Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.     

Liner shipping network design with emission control areas: A genetic algorithm-based approach

To curb emissions, containerized shipping lines face the traditional trade-off between cost and emissions (CO₂ and SO_x) reduction. This paper considers this element in the context of liner service design and proposes a mixed integer linear programming (MILP) model based on a multi-commodity pickup and delivery arc-flow formulation. The objective is to maximize the profit by selecting the ports to be visited, the sequence of port visit, the cargo flows between ports, as well as the number/operating speeds of vessels on each arc of the selected route. The problem also considers that Emission Control Areas (ECAs) exist in the liner network and accounts for the vessel carrying capacity. In addition to using the MILP solver of CPLEX, we develop in the paper a specific genetic algorithm (GA) based heuristic and show that it gives the possibility to reach an optimal solution when solving large size instances.