A Reference Vector-Assisted Many-Objective Optimization Algorithm with Adaptive Niche Dominance Relation

It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive.

A Line Complex-Based Evolutionary Algorithm for Many-Objective Optimization

In solving many-objective optimization problems(MaO Ps),existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure.Most candidate solutions become nondominated during the evolutionary process,thus leading to the failure of producing offspring toward Pareto-optimal front with diversity.Can we find a more effective way to select nondominated solutions and resolve this issue?To answer this critical question,this work proposes to evolve solutions through line complex rather than solution points in Euclidean space.First,Plücker coordinates are used to project solution points to line complex composed of position vectors and momentum ones.Besides position vectors of the solution points,momentum vectors are used to extend the comparability of nondominated solutions and enhance selection pressure.Then,a new distance function designed for high-dimensional space is proposed to replace Euclidean distance as a more effective distancebased estimator.Based on them,a novel many-objective evolutionary algorithm(MaOEA)is proposed by integrating a line complex-based environmental selection strategy into the NSGAⅢframework.The proposed algorithm is compared with the state of the art on widely used benchmark problems with up to 15 objectives.Experimental results demonstrate its superior competitiveness in solving MaOPs.

Many-Objective Optimization-Based Task Scheduling in Hybrid Cloud Environments

Due to the security and scalability features of hybrid cloud architecture,it can bettermeet the diverse requirements of users for cloud services.And a reasonable resource allocation solution is the key to adequately utilize the hybrid cloud.However,most previous studies have not comprehensively optimized the performance of hybrid cloud task scheduling,even ignoring the conflicts between its security privacy features and other requirements.Based on the above problems,a many-objective hybrid cloud task scheduling optimization model(HCTSO)is constructed combining risk rate,resource utilization,total cost,and task completion time.Meanwhile,an opposition-based learning knee point-driven many-objective evolutionary algorithm(OBL-KnEA)is proposed to improve the performance of model solving.The algorithm uses opposition-based learning to generate initial populations for faster convergence.Furthermore,a perturbation-based multipoint crossover operator and a dynamic range mutation operator are designed to extend the search range.By comparing the experiments with other excellent algorithms on HCTSO,OBL-KnEA achieves excellent results in terms of evaluation metrics,initial populations,and model optimization effects.

An ε-domination based two-archive 2 algorithm for many-objective optimization

The two-archive 2 algorithm(Two_Arch2) is a manyobjective evolutionary algorithm for balancing the convergence,diversity,and complexity using diversity archive(DA) and convergence archive(CA).However,the individuals in DA are selected based on the traditional Pareto dominance which decreases the selection pressure in the high-dimensional problems.The traditional algorithm even cannot converge due to the weak selection pressure.Meanwhile,Two_Arch2 adopts DA as the output of the algorithm which is hard to maintain diversity and coverage of the final solutions synchronously and increase the complexity of the algorithm.To increase the evolutionary pressure of the algorithm and improve distribution and convergence of the final solutions,an ε-domination based Two_Arch2 algorithm(ε-Two_Arch2) for many-objective problems(MaOPs) is proposed in this paper.In ε-Two_Arch2,to decrease the computational complexity and speed up the convergence,a novel evolutionary framework with a fast update strategy is proposed;to increase the selection pressure,ε-domination is assigned to update the individuals in DA;to guarantee the uniform distribution of the solution,a boundary protection strategy based on I_(ε+) indicator is designated as two steps selection strategies to update individuals in CA.To evaluate the performance of the proposed algorithm,a series of benchmark functions with different numbers of objectives is solved.The results demonstrate that the proposed method is competitive with the state-of-the-art multi-objective evolutionary algorithms and the efficiency of the algorithm is significantly improved compared with Two_Arch2.

A Bi-population Cooperative Optimization Algorithm Assisted by an Autoencoder for Medium-scale Expensive Problems

This study presents an autoencoder-embedded optimization(AEO)algorithm which involves a bi-population cooperative strategy for medium-scale expensive problems(MEPs).A huge search space can be compressed to an informative lowdimensional space by using an autoencoder as a dimension reduction tool.The search operation conducted in this low space facilitates the population with fast convergence towards the optima.To strike the balance between exploration and exploitation during optimization,two phases of a tailored teaching-learning-based optimization(TTLBO)are adopted to coevolve solutions in a distributed fashion,wherein one is assisted by an autoencoder and the other undergoes a regular evolutionary process.Also,a dynamic size adjustment scheme according to problem dimension and evolutionary progress is proposed to promote information exchange between these two phases and accelerate evolutionary convergence speed.The proposed algorithm is validated by testing benchmark functions with dimensions varying from 50 to 200.As indicated in our experiments,TTLBO is suitable for dealing with medium-scale problems and thus incorporated into the AEO framework as a base optimizer.Compared with the state-of-the-art algorithms for MEPs,AEO shows extraordinarily high efficiency for these challenging problems,t hus opening new directions for various evolutionary algorithms under AEO to tackle MEPs and greatly advancing the field of medium-scale computationally expensive optimization.

A ε-indicator-based shuffled frog leaping algorithm for many-objective optimization problems

Many-objective optimization problems take challenges to multi-objective evolutionary algorithms.A number of nondominated solutions in population cause a difficult selection towards the Pareto front.To tackle this issue,a series of indicatorbased multi-objective evolutionary algorithms(MOEAs)have been proposed to guide the evolution progress and shown promising performance.This paper proposes an indicator-based manyobjective evolutionary algorithm calledε-indicator-based shuffled frog leaping algorithm(ε-MaOSFLA),which adopts the shuffled frog leaping algorithm as an evolutionary strategy and a simple and effectiveε-indicator as a fitness assignment scheme to press the population towards the Pareto front.Compared with four stateof-the-art MOEAs on several standard test problems with up to 50 objectives,the experimental results show thatε-MaOSFLA outperforms the competitors.

The Optimization of Manufacturing Resources Allocation Considering the Geographical Distribution

From the perspective of the geographical distribution, considering production fare, supply chain information and quality rating of the manufacturing resource(MR), a manufacturing resource allocation(MRA) model considering the geographical distribution in cloud manufacturing(CM) environment is built. The model includes two stages, preliminary selection stage and optimal selection stage. The membership function is used to select MRs from cloud resource pool(CRP) in the first stage, and then the candidate resource pool is built. In the optimal selection stage, a multi-objective optimization algorithm, particle swarm optimization(PSO) based on the method of relative entropy of fuzzy sets(REFS_PSO), is used to select optimal MRs from the candidate resource pool, and an optimal manufacturing resource supply chain is obtained at last. To verify the performance of REFS_PSO, NSGA-Ⅱ and PSO based on random weighting(RW_PSO) are selected as the comparison algorithms. They all are used to select optimal MRs at the second stage. The experimental results show solution obtained by REFS_PSO is the best. The model and the method proposed are appropriate for MRA in CM.

Many-objective Optimization Method Based on Dimension Reduction for Operation of Large-scale Cooling Energy Systems

Large-scale cooling energy system has developed well in the past decade.However,its optimization is still a problem to be tackled due to the nonlinearity and large scale of existing systems.Reducing the scale of problems without oversimplifying the actual system model is a big challenge nowadays.This paper proposes a dimension reduction-based many-objective optimization(DRMO)method to solve an accurate nonlinear model of a practical large-scale cooling energy system.In the first stage,many-objective and many-variable of the large system are pre-processed to reduce the overall scale of the optimization problem.The relationships between many objectives are analyzed to find a few representative objectives.Key control variables are extracted to reduce the dimension of variables and the number of equality constraints.In the second stage,the manyobjective group search optimization(GSO)method is used to solve the low-dimensional nonlinear model,and a Pareto-front is obtained.In the final stage,candidate solutions along the Paretofront are graded on many-objective levels of system operators.The candidate solution with the highest average utility value is selected as the best running mode.Simulations are carried out on a 619-node-614-branch cooling system,and results show the ability of the proposed method in solving large-scale system operation problems.

An Adaptive Many-objective Robust Optimization Model of Dynamic Reactive Power Sources for Voltage Stability Enhancement

The deployment of dynamic reactive power sourcecan effectively improve the voltage performance after a disturbance for a power system with increasing wind power penetration level and ubiquitous induction loads.To improve the voltage stability of the power system,this paper proposes an adaptive many-objective robust optimization model to deal with thedeployment issue of dynamic reactive power sources.Firstly,two metrics are adopted to assess the voltage stability of the system at two different stages,and one metric is proposed to assess the tie-line reactive power flow.Then,a robustness index isdeveloped to assess the sensitivity of a solution when subjectedto operational uncertainties,using the estimation of acceptablesensitivity region(ASR)and D-vine Copula.Five objectives areoptimized simultaneously:①total equipment investment;②adaptive short-term voltage stability evaluation;③tie-line power flow evaluation;④prioritized steady-state voltage stabilityevaluation;and⑤robustness evaluation.Finally,an anglebased adaptive many-objective evolutionary algorithm(MaOEA)is developed with two improvements designed for the application in a practical engineering problem:①adaptive mutationrate;and②elimination procedure without a requirement for athreshold value.The proposed model is verified on a modifiedNordic 74-bus system and a real-world power system.Numerical results demonstrate the effectiveness and efficiency of theproposed model.

A Coevolutionary Algorithm for Many-Objective Optimization Problems with Independent and Harmonious Objectives

Evolutionary algorithm is an effective strategy for solving many-objective optimization problems.At present,most evolutionary many-objective algorithms are designed for solving many-objective optimization problems where the objectives conflict with each other.In some cases,however,the objectives are not always in conflict.It consists of multiple independent objective subsets and the relationship between objectives is unknown in advance.The classical evolutionary many-objective algorithms may not be able to effectively solve such problems.Accordingly,we propose an objective set decomposition strategy based on the partial set covering model.It decomposes the objectives into a collection of objective subsets to preserve the nondominance relationship as much as possible.An optimization subproblem is defined on each objective subset.A coevolutionary algorithm is presented to optimize all subproblems simultaneously,in which a nondominance ranking is presented to interact information among these sub-populations.The proposed algorithm is compared with five popular many-objective evolutionary algorithms and four objective set decomposition based evolutionary algorithms on a series of test problems.Numerical experiments demonstrate that the proposed algorithm can achieve promising results for the many-objective optimization problems with independent and harmonious objectives.

基于代理模型估值不确定度的昂贵多目标优化问题研究

针对代理模型辅助的多目标优化算法中个体不确定度之间相互冲突的问题,本文提出个体每个目标估值不确定的填充准则,同时,为了减少训练模型消耗的计算资源,提出基于非支配排序的样本选择算法。为了验证该算法的可行性,采用DTLZ和WFG测试函数进行测试,得出结果与近些年发表5种具有代表性的同类型算法进行对比,结果说明该算法可以有效的解决昂贵高维高目标优化问题。

三阶段自适应采样和增量克里金辅助的昂贵高维优化算法

代理辅助进化算法已广泛应用于求解代价高昂的多目标优化问题,但大多数由于代理模型的局限性而仅限于解决决策变量低维的问题。为了解决高维的昂贵多目标优化问题,提出了一种基于三阶段自适应采样策略的改进增量克里金辅助的进化算法。该算法使用改进的增量克里金模型来近似每个目标函数,此模型的超参数根据预测的不确定性进行自适应更新,降低计算复杂度的同时保证模型在高维上的准确性;此外,在模型管理方面提出一种三阶段自适应采样的策略,将采样过程分为不同的优化阶段以更有针对性的选择个体,能够首先保证收敛性,提高算法的收敛速度。为了验证算法的有效性,在包含各种特征的两组测试问题DTLZ(deb-thiele-laumanns-zitzler)、MaF(many-objective function)和路径规划实际工程问题上与最新的同类型算法进行实验对比,结果表明该算法在解决决策变量高维的昂贵多目标优化问题上具有较强的竞争力。

带隐藏约束昂贵黑箱问题的自适应代理优化方法

针对带隐藏约束的昂贵黑箱全局优化问题,提出采用自适应转换搜索策略的代理优化方法。在转换搜索子步中采用与已估值点个数相关的标准差在当前最优点附近通过随机扰动生成候选点,以更好地平衡局部搜索和全局搜索。为更好地近似真实黑箱目标函数,采用了自适应组合目标代理模型。在50个测试问题上进行了数值实验,计算结果说明了所提算法的有效性。

基于繁殖策略的求解昂贵约束单目标进化算法

实际工程优化中存在大量约束优化问题,且有一些优化问题目标函数和约束函数的评价非常耗时,导致该类问题无法直接使用传统优化算法求解。为此,为了在评价次数有限的情况下获得较好的可行解,针对昂贵单目标约束优化问题,为评价费时的目标函数和约束函数建立径向基函数(Radial Basis Function,RBF)预测模型,以及根据估值自适应选择个体的繁殖策略,以期能产生较好的可行解。在7个标准测试函数及3个工业测试函数上的测试结果表明,相比于其它现有针对昂贵约束问题的优化方法,本方法无需确保初始种群中必须有可行解,且能在优化目标和约束函数评价次数有限的情况下找到更好的解。

Y公司财务共享服务中心费用报销流程优化研究

随着财务共享服务中心不断发展,如何将区块链技术、大数据技术等新的信息技术应用于业务流程优化,以提高整体运行效率,逐渐成为研究的重点课题。文章以Y公司财务共享服务中心为例,对其费用报销业务流程进行优化。采用OCR光学字符识别技术提取发票中的信息,并自动填充到费用报销单据、触发预算控制,替代原人工填写报销单操作;嵌入智能催批指令,增加超时短信催批功能,对原有费用报销流程进行精简。模拟人工判断,将对费用报销单的审批控制活动嵌入系统,实现费用报销单据的智能自动审批。希望能够为正在实施财务共享服务中心的其他企业提供参考。

自适应模型选用辅助的多种群进化算法

代理模型辅助的进化算法是求解目标函数评价昂贵优化问题的有效方法.在这类算法中,算法的搜索策略和填充采样策略是在有限评价次数下获得优化问题较好解的重要因素.为此,本文使用多种群搜索策略用于平衡种群搜索的多样性和收敛性,同时基于个体和训练样本之间目标函数值的距离自适应选择模型进行个体的目标函数值估计,以提高估值的准确度.为了验证算法的有效性,在CEC2005测试函数以及扩频雷达Polly编码优化设计问题上进行测试,并和现有求解昂贵优化问题的算法进行了结果对比.实验结果表明本文提出的算法在目标函数评价次数有限的情况下能够获得昂贵优化问题的较好解.

基于模糊聚类分析的高速公路全寿命周期成本预测研究

推行全生命周期成本管理与建管养一体化有利于提升高速公路投资效益和社会效益,成本预测是设计与养护方案优化的基础。在大中修样本数量有限的情形下,应用模糊聚类分析法,结合高速公路专项项目特征指标预测高速公路路基、路面及结构物大中修费用;建立寿命周期成本模型,根据建设成本、养护成本、用户成本、环境成本等寿命周期成本对设计方案进行比选,并进行实例分析,避免根据单纯建设成本最低和定性分析进行方案选择带来的后期维护及运营成本偏高的缺陷,研究成果对设计方案优化和建管养一体化有指导作用。

Study on the Changes of Medical Income Structure in Governmentrun Hospitals of Traditional Chinese Medicine from 2012 to 2021

Objective To study the changing characteristics and trend of medical income structure in the government-run hospitals of traditional Chinese medicine(TCM),evaluate the effects of relevant reform measures,and to put forward corresponding suggestions for further optimizing their income structure.Methods The data related to the average medical income of government-run hospitals of TCM from 2012 to 2021 were sorted out.Then,descriptive analysis method was used to analyze the changes of related indicators.Besides,structural change method was applied to investigate the changes of outpatient income and inpatient income.Results and Conclusion From 2012 to 2021,the growth of medical income in government-run hospitals of TCM tended to be stable,and the proportion of medical service income increased from 22.62%(2012)to 29.38%(2021),but the average annual growth rate was only 0.68%.The main items that caused the change of outpatient income structure were medicine revenue,laboratory tests,diagnosis and treatment,and the cumulative contribution rate was 89.15%.The main items that caused the change of inpatient income structure were medicine revenue,sanitary materials,and auxiliary examinations income,with a cumulative contribution rate of 80.04%.However,the contribution rate of registration,diagnosis,treatment,surgery and nursing income reflecting the value of medical personnel’s technical labor was relatively small.The medical income structure of government-run hospitals of TCM underwent great changes and gradually became reasonable,but the medical service income increased slowly,and not all indicators achieved the expectations.To promote the sustainable development of public hospitals of TCM and enable them to provide high-quality and efficient TCM medical and health services,it is necessary to further improve the relevant policy mechanism.

基于财务智能化的高校财务报销流程优化研究

目前,我国高等教育发展极为迅速,各高校也在积极地扩大教学规模。在此过程中,高校财务部门的业务量有了显著的增加,由此也出现了财务报销时间长、财务人员供给不足等问题。究其原因,报销难主要是由于现有财务报销流程无法满足与日俱增的业务需求。为了解决这一问题,高校必须就现行财务报销流程进行升级优化,尝试运用互联网技术以实现财务报销智能化发展,从而切实提高财务管理水平。基于此,笔者就高校财务报销流程优化展开深入的探讨分析,在高校财务报销流程现状及存在问题的基础上,借助互联网技术构建账前预审、报销过程智能化的财务报销机制,以期为提高财务报销工作效率提供参考。

四川某三甲医院DRG支付下脑梗死患者的住院费用控制

目的:探索在医保支付改革的大背景下,研究某三甲医院脑梗死患者住院费用的影响因素,以期对脑梗死病组实行更精细化管理。方法:选择2020年-2023年“脑缺血性疾患”病组的病例,利用描述性统计分析、卡方检验以及二元logistic回归模型进行影响因素分析。结果:纳入研究病例3981份,2020年-2023年患者次均费用10779.19元,其中药品费、检查费、治疗费是住院费用的主要组成部分,占比分别为18.53%、25.20%、35.57%;该病组每年医保都为超支状态,每年例均超支分别为644.85元、369.43元、1545.51元、1767.84元;患者的性别、入院途径、有无并发症、是否危重、住院天数和出院科室是影响住院费用的主要因素。结论:为适应医保支付方式改革,各医疗机构应加强病种成本核算,合理控制医疗费用,降低住院天数以减少医保超支,助推医院精细化管理;医保部门应根据当地实际情况,动态调整病组权重及分组方案,实现医、保、患三方共赢。