考虑Pareto最优的列车运行图与维修天窗协调优化

列车运行图与维修天窗之间的冲突始终无法避免,且维修天窗开设时间的长短显著影响列车总运行时间。针对此问题,综合考虑维修天窗对列车运行造成的限速约束、车站到发线数量约束等,建立列车总运行时间最小,以及维修天窗实际开设时长与理想时长总偏差最小的双目标混合整数规划模型;对困难约束设置中间辅助变量将模型线性化以提高求解效率,并设计约束转换算法求解双目标模型的Pareto最优;微观化处理铁路线,将站内资源和站间资源细化为一系列行车资源单元,得到更加符合实际旅客运输需求的运行图。以某地区铁路线夜间开行列车及维修天窗开设计划为研究背景,调用商业软件求解双目标函数模型的Pareto最优,并对双目标模型的最小支配解和最优支配解进行对比分析;针对最优支配解下的列车进入、离开行车资源单元的时间、停站作业时间及维修天窗的开始时间及开设时长,绘制列车运行图。求解结果表明:模型在满足维修天窗最小开设时长的同时,能够兼顾列车运行总时间最小和维修天窗开设时长更充裕。基于最优支配解绘制的列车运行图表明:微观路网下的列车运行时刻表优化结果更符合实际旅客运输生产作业需要。研究结果可为铁路运营管理部门进一步优化列车运行图编制与维修天窗开设提供参考。

Pareto解集旋转的分类多策略预测动态多目标优化

为更有效地解决Pareto解集(Pareto set,PS)旋转的动态多目标优化问题,提出PS旋转的分类多策略预测方法(rotation-based forecasting method,RFM)。将PS的旋转类型分为PS中心点旋转、PS原点旋转和非标准旋转;针对以上不同的PS旋转类型,自适应地选择合适的预测模型,建立不同点集的时间序列,为后续进化提供初始种群。引入拉丁超立方策略(Latin hypercube strategy,LHS)生成的随机种群与上述预测种群共同构建新种群,保证种群的多样性。为验证算法的有效性,将RFM算法与DNSGA-II、PPS、SPPS和MMP算法在8个标准的动态测试函数上进行实验对比。实验结果表明,RFM算法取得了6个最优IGD值、7个最优SP值、3个最优MS值,证明了RFM算法可以更有效地解决基于PS旋转的动态多目标优化问题。同时验证了RFM算法的普适性,在FDA系列函数上进行实验对比,实验结果表明,该算法在处理非旋转的动态多目标优化问题中仍具有较优性能。

基于Pareto蚁群算法的双目标路径规划研究

针对复杂建筑环境人员应急疏散单一路径不能满足火灾环境变化需求的问题,基于改进蚁群算法,结合Pareto双目标解集思想,提出一种组合优化解集的双目标蚁群算法,通过排序优化的思想,实现人员多路径动态疏散规划。在构造Pareto解集的阶段协同考虑疏散路径长度以及火灾风险程度2个优化目标,计算各个解之间的支配关系。利用排序优化蚁群算法的正反馈机制将各组解的信息素按一定比例作为最优路径信息素的积累,加快解集的寻找。最后将其与传统双目标蚁群算法相比较,结果表明:优化后的双目标算法更加适合复杂建筑人员疏散路径规划问题,在寻找多组满足要求解的同时展示目标之间的利弊关系,供决策者选择合适的路径,提高疏散效率。

基于Pareto-GA多目标的企业管理系统优化研究——以某造纸厂为例

传统造纸厂管理优化通常只针对单一目标,忽略了质量和安全等重要方面。因此,提出了一种面向造纸厂的多个目标优化方法,并结合Pareto排序以及遗传算法搜索机制改进的Pareto-遗传算法作为求解方法,以实现对造纸厂监管系统的优化设计。研究结果显示,使用Schaffer's F6 Function进行测试时,改进的Pareto-遗传算法在72次迭代后达到最大适应度值0.93,优于其他两种算法。进一步将工期、成本、质量和安全多目标问题分解为两个子问题,成功获得3组Pareto最优解,为管理者提供不同需求下的优化方案。同时,提出的造纸厂管理系统优化设计方案能够提升造纸厂管理的效率和安全性,具有重要的理论价值和实际应用前景。

Optimal setting and placement of FACTS devices using strength Pareto multi-objective evolutionary algorithm

This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.

A genetic algorithm for the pareto optimal solution set of multi-objective shortest path problem

Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.

基于Pareto控制的多目标PSO算法在铣削参数优化中的应用

工艺参数是影响零件加工质量和效率的关键因素,工艺参数的优化和调节是改善加工工艺的最有效方法。针对铣削加工参数优化问题,提出了一种基于应用实例的多目标切削参数优化方法。首先,以材料去除率、切削力和刀具寿命为目标函数,建立了统一的切削工艺参数多目标优化数学模型。随后,使用切削数据对目标函数进行组合,建立了该问题的数学模型,研究了适用的求解方法以获得最优解,并通过实验验证了参数优化的有效性。该方法可为加工参数的选择提供指导和依据。

A FLEXIBLE OBJECTIVE-CONSTRAINT APPROACH AND A NEW ALGORITHM FOR CONSTRUCTING THE PARETO FRONT OF MULTIOBJECTIVE OPTIMIZATION PROBLEMS

In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.

Multi-Objective Optimization Algorithm for Grouping Decision Variables Based on Extreme Point Pareto Frontier

The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.

Buckling Optimization of Curved Grid Stiffeners through the Level Set Based Density Method

Stiffened structures have great potential for improvingmechanical performance,and the study of their stability is of great interest.In this paper,the optimization of the critical buckling load factor for curved grid stiffeners is solved by using the level set based density method,where the shape and cross section(including thickness and width)of the stiffeners can be optimized simultaneously.The grid stiffeners are a combination ofmany single stiffenerswhich are projected by the corresponding level set functions.The thickness and width of each stiffener are designed to be independent variables in the projection applied to each level set function.Besides,the path of each single stiffener is described by the zero iso-contour of the level set function.All the single stiffeners are combined together by using the p-norm method to obtain the stiffener grid.The proposed method is validated by several numerical examples to optimize the critical buckling load factor.

A Hybrid Level Set Optimization Design Method of Functionally Graded Cellular Structures Considering Connectivity

With the continuous advancement in topology optimization and additive manufacturing(AM)technology,the capability to fabricate functionally graded materials and intricate cellular structures with spatially varying microstructures has grown significantly.However,a critical challenge is encountered in the design of these structures–the absence of robust interface connections between adjacent microstructures,potentially resulting in diminished efficiency or macroscopic failure.A Hybrid Level Set Method(HLSM)is proposed,specifically designed to enhance connectivity among non-uniform microstructures,contributing to the design of functionally graded cellular structures.The HLSM introduces a pioneering algorithm for effectively blending heterogeneous microstructure interfaces.Initially,an interpolation algorithm is presented to construct transition microstructures seamlessly connected on both sides.Subsequently,the algorithm enables the morphing of non-uniform unit cells to seamlessly adapt to interconnected adjacent microstructures.The method,seamlessly integrated into a multi-scale topology optimization framework using the level set method,exhibits its efficacy through numerical examples,showcasing its prowess in optimizing 2D and 3D functionally graded materials(FGM)and multi-scale topology optimization.In essence,the pressing issue of interface connections in complex structure design is not only addressed but also a robust methodology is introduced,substantiated by numerical evidence,advancing optimization capabilities in the realm of functionally graded materials and cellular structures.

Concurrent Two-Scale Topology Optimization of Thermoelastic Structures Using a M-VCUT Level Set Based Model of Microstructures

By analyzing the results of compliance minimization of thermoelastic structures,we observed that microstructures play an important role in this optimization problem.Then,we propose to use a multiple variable cutting(M-VCUT)level set-based model of microstructures to solve the concurrent two-scale topology optimization of thermoelastic structures.A microstructure is obtained by combining multiple virtual microstructures that are derived respectively from multiple microstructure prototypes,thus giving more diversity of microstructure and more flexibility in design optimization.The effective mechanical properties of microstructures are computed in an off-line phase by using the homogenization method,and then a mapping relationship between the design variables and the effective properties is established,which gives a data-driven model of microstructure.In the online phase,the data-driven model is used in the finite element analysis to improve the computational efficiency.The compliance minimization problem is considered,and the results of numerical examples prove that the proposed method is effective.

基于Pareto解集的工业园区微网优化配置研究

工业园区各类能源耦合性较差,不同能源系统独立运行,能源利用率较低,需从多类能源互联集成和互补融合入手,提高能源的综合利用效率和可再生能源的利用率。提出了一种工业园区综合能源微网方案,以总成本、污染治理费、电网可靠性、风光互补性为目标函数和约束条件,建立了多能微电网优化模型。设计了一种基于Pareto最优解集的多目标差分算法并采用熵权法确定每个评价指标的权重,将多目标运算转化为单目标运算。仿真结果表明,该算法在微电网端可有效降低传统能源的消耗,加强清洁能源的有效利用,减少碳排放量并降低系统运行成本。

Accelerated Primal-Dual Projection Neurodynamic Approach With Time Scaling for Linear and Set Constrained Convex Optimization Problems

The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on unconstrained smooth con-vex optimization problems.In this paper,on the basis of primal-dual dynamical approach,Nesterov accelerated dynamical approach,projection operator and directional gradient,we present two accelerated primal-dual projection neurodynamic approaches with time scaling to address convex optimization problems with smooth and nonsmooth objective functions subject to linear and set constraints,which consist of a second-order ODE(ordinary differential equation)or differential conclusion system for the primal variables and a first-order ODE for the dual vari-ables.By satisfying specific conditions for time scaling,we demonstrate that the proposed approaches have a faster conver-gence rate.This only requires assuming convexity of the objective function.We validate the effectiveness of our proposed two accel-erated primal-dual projection neurodynamic approaches through numerical experiments.

Maintaining an Optimal Flow of Forest Products under a Carbon Market: Approximating a Pareto Set of Optimal Silvicultural Regimes for Eucalyptus fastigata

A competitive co-evolutionary Multi-Objective Genetic Algorithm (cc-MOGA) was used to approximate a Pareto front of efficient silvicultural regimes for Eucalyptus fastigata. The three objectives to be maximised included, sawlog, pulpwood and carbon sequestration payment. Three carbon price scenarios (3CPS), i.e. NZ $25, NZ $50 and NZ $100 for a tonne of CO2 sequestered, were used to assess the impact on silvicultural regimes, against a fourth non-carbon Pareto set of efficient regimes (nonCPS), determined from a cc-MOGA with two objectives, i.e. competing sawlog and pulpwood productions. Carbon prices included in stand valuation were found to influence the silvicultural regimes by increasing the rotation length and lowering the final crop number before clearfell. However, there were no significant changes in the frequency, timing, and intensity of thinning operations amongst all the four Pareto sets of solutions. However, the 3CPS were not significantly different from each other, which meant that these silvicultural regimes were insensitive to the price of carbon. This was because maximising carbon sequestration was directly related to the biological growth rate. As such an optimal mix of frequency, intensity, and timing of thinning maintained maximum growth rate for as long as possible for any one rotation.

Pareto-Optimal Reinsurance Based on TVaR Premium Principle and Vajda Condition

Reinsurance is an effective risk management tool for insurers to stabilize their profitability. In a typical reinsurance treaty, an insurer cedes part of the loss to a reinsurer. As the insurer faces an increasing number of total losses in the insurance market, the insurer might expect the reinsurer to bear an increasing proportion of the total loss, that is the insurer might expect the reinsurer to pay an increasing proportion of the total claim amount when he faces an increasing number of total claims in the insurance market. Motivated by this, we study the optimal reinsurance problem under the Vajda condition. To prevent moral hazard and reflect the spirit of reinsurance, we assume that the retained loss function is increasing and the ceded loss function satisfies the Vajda condition. We derive the explicit expression of the optimal reinsurance under the TVaR risk measure and TVaR premium principle from the perspective of both an insurer and a reinsurer. Our results show that the explicit expression of the optimal reinsurance is in the form of two or three interconnected line segments. Under an additional mild constraint, we get the optimal parameters and find the optimal reinsurance strategy is full reinsurance, no reinsurance, stop loss reinsurance, or quota-share reinsurance. Finally, we gave an example to analyze the impact of the weighting factor on optimal reinsurance.

Phase-Based Optical Flow Method with Optimized Parameter Settings for Enhancing Displacement Measurement Adaptability

To enhance the applicability and measurement accuracy of phase-based optical flow method using complex steerable pyramids in structural displacement measurement engineering applications, an improved method of optimizing parameter settings is proposed. The optimized parameters include the best measurement points of the Region of Interest (ROI) and the levels of pyramid filters. Additionally, to address the issue of updating reference frames in practical applications due to the difficulty in estimating the maximum effective measurement value, a mechanism for dynamically updating reference frames is introduced. Experimental results demonstrate that compared to representative image gradient-based displacement measurement methods, the proposed method exhibits higher measurement accuracy in engineering applications. This provides reliable data support for structural damage identification research based on vibration signals and is expected to broaden the engineering application prospects for structural health monitoring.

基于Pareto Optimality的PPP项目三大主参与方效用探讨

在PPP项目的众多参与方中,选取项目发起人、SPC和贷款银行三个最主要的参与方,通过分析项目发起人与SPC、SPC与贷款银行和贷款银行与项目发起人之间的内在联系,在Pareto Optimality理论分析的基础上,得到三者之间两两优势互补的埃奇沃思方框图,并根据瓦尔拉斯均衡理论得出PPP项目能够实现帕累托最优,实现项目效用的最大化,最后拟画出PPP项目三大主参与方的效用可能性曲线。

海上风电半潜式基础初步选型 Pareto⁃Optimal 评价

针对半潜漂浮式风电基础初步选型,采用Pareto⁃Optimal评价方法对不同吃水、平台立柱直径、立柱间距和垂荡板直径四个参数的不同组合进行分析比较。基于浮体动力学频域计算方法,采用我国阳江某海域极限波浪条件计算得到叶轮中心水平加速度,同时考虑完整稳性的计算结果。对比分析表明平台吃水和立柱直径宜选择适中的取值,较大的排水量和立柱总体积并不会显著减小叶轮中心水平加速度。垂荡板对于改善平台整体性能是较为敏感的,垂荡板与立柱的直径比存在一定的最佳范围。平台立柱间距是影响平台运动性能最大的因素,增大立柱间距可以有效地降低叶轮中心水平加速度,但立柱间距的增大对立柱间的撑杆结构强度以及平台整体的建造和下水提出了较大的挑战。

融合局部搜索与Pareto支配的多目标任务调度模型

为了解决复杂任务群调度过程中资源利用不均、任务完成时间较长等问题,以最小化资源负载均方差和最小化任务群完成时间为目标构建复杂任务群资源调度模型,提出一种融合局部搜索和Pareto支配的多目标优化算法BRLSN(multi-objective optimization based on boundary range local search and NSGA-Ⅱ,BRLSN)。该算法采用有效的编码方式与交叉变异算子进行迭代寻优,并利用基于边界区域局部搜索的精英保留策略扩大算法搜索范围,保存种群优良个体。实验结果表明,BRLSN相较于其他多目标算法在收敛性和多样性上有显著的提升,同时算法收敛速度更快,种群质量更高,明显优化了最终目标函数的结果值。