期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到442篇文章
< 1 2 … 23 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Fresh views on some recent developments in the simplex algorithm 认领 引用
1
作者 胡剑峰 潘平奇 《Journal of Southeast University(English Edition)》 EI CAS 2008年第1期124-126,共3页
First, the main procedures and the distinctive features of the most-obtuse-angle（MOA）row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming. Then, two special auxilia... First, the main procedures and the distinctive features of the most-obtuse-angle（MOA）row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming. Then, two special auxiliary problems are constructed to prove that each of the rules can be actually considered as a simplex approach for solving the corresponding auxiliary problem. In addition, the nested pricing rule is also reviewed and its geometric interpretation is offered based on the heuristic characterization of an optimal solution. 展开更多
关键词 linear programming simplex algorithm pivot mostobtuse-angle nested pricing large-scale problem
暂未订购 下载PDF
New Optimal Pivot Rule for the Simplex Algorithm 认领 引用
2
作者 Jean Bosco Etoa Etoa 《Advances in Pure Mathematics》 2016年第10期647-658,共12页
The purpose of this paper is to introduce a new pivot rule of the simplex algorithm. The simplex algorithm first presented by George B. Dantzig, is a widely used method for solving a linear programming problem (LP). O... The purpose of this paper is to introduce a new pivot rule of the simplex algorithm. The simplex algorithm first presented by George B. Dantzig, is a widely used method for solving a linear programming problem (LP). One of the important steps of the simplex algorithm is applying an appropriate pivot rule to select the basis-entering variable corresponding to the maximum reduced cost. Unfortunately, this pivot rule not only can lead to a critical cycling (solved by Bland’s rules), but does not improve efficiently the objective function. Our new pivot rule 1) solves the cycling problem in the original Dantzig’s simplex pivot rule, and 2) leads to an optimal improvement of the objective function at each iteration. The new pivot rule can lead to the optimal solution of LP with a lower number of iterations. In a maximization problem, Dantzig’s pivot rule selects a basis-entering variable corresponding to the most positive reduced cost;in some problems, it is well-known that Dantzig’s pivot rule, before reaching the optimal solution, may visit a large number of extreme points. Our goal is to improve the simplex algorithm so that the number of extreme points to visit is reduced;we propose an optimal improvement in the objective value per unit step of the basis-entering variable. In this paper, we propose a pivot rule that can reduce the number of such iterations over the Dantzig’s pivot rule and prevent cycling in the simplex algorithm. The idea is to have the maximum improvement in the objective value function: from the set of basis-entering variables with positive reduced cost, the efficient basis-entering variable corresponds to an optimal improvement of the objective function. Using computational complexity arguments and some examples, we prove that our optimal pivot rule is very effective and solves the cycling problem in LP. We test and compare the efficiency of this new pivot rule with Dantzig’s original pivot rule and the simplex algorithm in MATLAB environment. 展开更多
关键词 Linear Programming Simplex Algorithm Pivot Rules Optimal Pivot Rule
暂未订购 下载PDF
PRIMAL PERTURBATION SIMPLEX ALGORITHMS FOR LINEAR PROGRAMMING 认领 引用 被引量：6
3
作者 Ping-qi Pan 《Journal of Computational Mathematics》 SCIE EI 2000年第6期587-596,共10页
In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, an... In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, and then the primal pivot rule to achieve optimality. The second algorithm, a modification of the first, is designed to handle highly degenerate problems more efficiently. Some interesting results concerning merit of the perturbation are established. Numerical results from preliminary tests are also reported. [ABSTRACT FROM AUTHOR] 展开更多
关键词 linear programming perturbation primal simplex algorithm partially revised tableau
暂未订购 下载PDF
A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING 认领 引用 被引量：4
4
作者 Pingqi Pan 《Journal of Computational Mathematics》 SCIE 2010年第6期837-847,共11页
Recently, computational results demonstrated remarkable superiority of a so-called ＂largest-distance＂ rule and ＂nested pricing＂ rule to other major rules commonly used in practice, such as Dantzig＇s original rule... Recently, computational results demonstrated remarkable superiority of a so-called ＂largest-distance＂ rule and ＂nested pricing＂ rule to other major rules commonly used in practice, such as Dantzig＇s original rule, the steepest-edge rule and Devex rule. Our computational experiments show that the simplex algorithm using a combination of these rules turned out to be even more efficient. 展开更多
关键词 Large-scale linear programming Simplex algorithm Pivot rule Nested Largestdistance Scaling.
暂未订购 下载PDF
Objective Variation Simplex Algorithm for Continuous Piecewise Linear Programming 认领 引用
5
作者 Yu Bai Zhiming Xu +1 位作者 Xiangming Xi Shuning Wang 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2017年第1期73-82,共10页
This paper works on a modified simplex algorithm for the local optimization of Continuous Piece Wise Linear（CPWL） programming with generalization of hinging hyperplane objective and linear constraints. CPWL programm... This paper works on a modified simplex algorithm for the local optimization of Continuous Piece Wise Linear（CPWL） programming with generalization of hinging hyperplane objective and linear constraints. CPWL programming is popular since it can be equivalently transformed into difference of convex functions programming or concave optimization. Inspired by the concavity of the concave CPWL functions, we propose an Objective Variation Simplex Algorithm（OVSA）, which is able to find a local optimum in a reasonable time. Computational results are presented for further insights into the performance of the OVSA compared with two other algorithms on random test problems. 展开更多
关键词 local optimization continuous piecewise linear programming modified simplex algorithm
暂未订购 下载PDF
一种基于改进Simplex噪声的虚拟地形生成方法 认领 引用
6
作者 沈博 张健钦 +1 位作者 马帅豹 文政 《系统仿真学报》 EI CAS CSCD 北大核心 2025年第10期2605-2612,共8页
针对传统虚拟地形生成方法存在的计算复杂度高、生成速度慢、真实感不足等问题,提出了一种基于改进Simplex噪声的虚拟地形生成方法。利用Simplex噪声计算效率高、硬件开销低、随机性更自然等优势,构建基础地形模板;引入分形算法,通过多... 针对传统虚拟地形生成方法存在的计算复杂度高、生成速度慢、真实感不足等问题,提出了一种基于改进Simplex噪声的虚拟地形生成方法。利用Simplex噪声计算效率高、硬件开销低、随机性更自然等优势,构建基础地形模板;引入分形算法,通过多频率、多振幅的噪声叠加增强地形细节层次;结合湍流算法,增加随机扰动和复杂性,从而进一步提高地形的自然感和多样性。仿真结果表明:该方法在地形生成效率、真实感,以及多样性方面均优于传统生成方法。 展开更多
关键词 虚拟地形 Simplex噪声 分形算法 湍流算法 改进Simplex
暂未订购 下载PDF
Genetic Nelder-Mead neural network algorithm for fault parameter inversion using GPS data 认领 引用 被引量：2
7
作者 Leyang Wang Ranran Xu Fengbin Yu 《Geodesy and Geodynamics》 EI CSCD 2022年第4期386-398,共13页
The traditional genetic algorithm(GA)has unstable inversion results and is easy to fall into the local optimum when inverting fault parameters.Therefore,this article considers the combination of GA with other non-line... The traditional genetic algorithm(GA)has unstable inversion results and is easy to fall into the local optimum when inverting fault parameters.Therefore,this article considers the combination of GA with other non-linear algorithms in order to improve the inversion precision of GA.This paper proposes a genetic Nelder-Mead neural network algorithm(GNMNNA).This algorithm uses a neural network algorithm(NNA)to optimize the global search ability of GA.At the same time,the simplex algorithm is used to optimize the local search capability of the GA.Through numerical examples,the stability of the inversion algorithm under different strategies is explored.The experimental results show that the proposed GNMNNA has stronger inversion stability and higher precision compared with the existing algorithms.The effectiveness of GNMNNA is verified by the BodrumeKos earthquake and Monte Cristo Range earthquake.The experimental results show that GNMNNA is superior to GA and NNA in both inversion precision and computational stability.Therefore,GNMNNA has greater application potential in complex earthquake environment. 展开更多
关键词 Fault parameter inversion Genetic algorithm Nelder-Mead simplex algorithm Neural network algorithm
暂未订购 下载PDF
基于NEWUOA的CRS叠加成像技术 认领 引用
8
作者 韩复兴 王源 +4 位作者 高正辉 常志邈 马飞 秦昊 尚浩 《吉林大学学报（地球科学版）》 CAS CSCD 北大核心 2026年第1期386-396,共11页
共反射面元(common reflection surface,CRS)叠加成像技术通过使用相邻共中心点道集信息提高地震数据信噪比,是处理低信噪比、低覆盖次数地震数据的关键技术。其三参数优化的搜索方法无论是经典的分步搜索还是同步的全局搜索,最终都需... 共反射面元(common reflection surface,CRS)叠加成像技术通过使用相邻共中心点道集信息提高地震数据信噪比,是处理低信噪比、低覆盖次数地震数据的关键技术。其三参数优化的搜索方法无论是经典的分步搜索还是同步的全局搜索,最终都需要局部优化算法提升精度,而传统的Nelder-Mead单纯形算法搜索方式简单,计算效率较低。本文采用一种无导数优化算法——新型无约束优化算法(new unconstrained optimization algorithm,NEWUOA)作为CRS叠加的精度提升算法。该算法通过动态构建二次插值模型,采用信赖域迭代策略,利用目标函数曲率信息提升计算效率。文中采用层状起伏模型和Marmousi2模型对该算法进行测试。结果显示,针对简单的层状起伏模型和复杂的Marmousi2模型,基于NEWUOA得到的相干值优化结果均普遍优于或等于基于Nelder-Mead单纯形算法得到的相干值优化结果,与Nelder-Mead单纯形算法相比,计算效率分别提升约48%和45%。这表明NEWUOA在保证CRS叠加优化精度的同时,能够显著提升计算效率,适合作为精度提升的计算工具。 展开更多
关键词 CRS叠加成像技术 三参数优化 NEWUOA 无导数优化 Nelder-Mead单纯形算法
暂未订购 下载PDF
A Hybrid Algorithm for Optimizing Multi-Modal Functions 认领 引用 被引量：1
9
作者 Li Qinghua Yang Shida Ruan Youlin 《Wuhan University Journal of Natural Sciences》 EI CAS 2006年第3期551-554,共4页
A new genetic algorithm is presented based on the musical performance. The novelty of this algorithm is that a new genetic algorithm, mimicking the musical process of searching for a perfect state of harmony, which in... A new genetic algorithm is presented based on the musical performance. The novelty of this algorithm is that a new genetic algorithm, mimicking the musical process of searching for a perfect state of harmony, which increases the robustness of it greatly and gives a new meaning of it in the meantime, has been developed, Combining the advantages of the new genetic algorithm, simplex algorithm and tabu search, a hybrid algorithm is proposed. In order to verify the effectiveness of the hybrid algorithm, it is applied to solving some typical numerical function optimization problems which are poorly solved by traditional genetic algorithms. The experimental results show that the hybrid algorithm is fast and reliable. 展开更多
关键词 harmony genetic allgorithm simplex algorithm Tabu search
暂未订购 下载PDF
基于Simplex算法的VSC-HVDC控制参数优化 认领 引用 被引量：15
10
作者 郭春义 赵成勇 +2 位作者 李广凯 饶宏 黎小林 《电力自动化设备》 EI 北大核心 2010年第9期13-17,共5页
以电压源换流器高压直流输电(VSC-HVDC)的稳态模型为基础,根据VSC功率传输方程的直角坐标形式,采用逆系统方法和PI控制相结合的方法设计了VSC的有功功率和无功功率独立调节的VSC-HVDC控制系统。基于非线性单纯形Simplex算法,对PI控制参... 以电压源换流器高压直流输电(VSC-HVDC)的稳态模型为基础,根据VSC功率传输方程的直角坐标形式,采用逆系统方法和PI控制相结合的方法设计了VSC的有功功率和无功功率独立调节的VSC-HVDC控制系统。基于非线性单纯形Simplex算法,对PI控制参数进行优化。PSCAD/EMTDC下的仿真结果表明,通过参数优化,VSC-HVDC控制目标的最大误差百分比低于1.5%;同时也证明所设计的控制系统能独立控制有功功率和无功功率。 展开更多
关键词 电压源换流器 高压直流输电 控制系统 Simplex算法 PI参数优化
暂未订购 下载PDF
基于Simplex算法的高压直流输电分段变速率VDCOL研究 认领 引用 被引量：9
11
作者 冯明 李兴源 +2 位作者 李妮 王超 洪潮 《四川大学学报（工程科学版）》 CSCD 北大核心 2015年第4期162-167,共6页
为了改善高压直流系统的故障后的恢复性能,在研究低压限流单元(voltage dependent current order limiter,VDCOL)对直流系统无功功率消耗和电压稳定性影响的基础上,提出了一种分段变速率低压限流单元(piecewise-variable-rate VDCOL,PVR... 为了改善高压直流系统的故障后的恢复性能,在研究低压限流单元(voltage dependent current order limiter,VDCOL)对直流系统无功功率消耗和电压稳定性影响的基础上,提出了一种分段变速率低压限流单元(piecewise-variable-rate VDCOL,PVR-VDCOL)的控制方法,该方法通过将电压下降或恢复过程划分为几个不同的阶段,并在每个阶段根据电压水平的不同而设置不同的功率恢复速率。推导了控制器初值的计算公式,制定了利用Simplex算法优化控制器参数的流程,并重点分析了分段数目对控制器性能的影响及其确定方法。在PSCAD/EMTDC中对提出的PVR-VDCOL和传统线性VDCOL的控制效果进行了对比仿真,并对不同分段数目下的仿真结果进行了对比分析,仿真结果表明提出的PVR-VDCOL能够有效改善直流系统的恢复性能。 展开更多
关键词 高压直流输电 低压限流单元 电压稳定 Simplex算法
暂未订购 下载PDF
基于Downhill-Simplex算法的观测数据与作物生长模型同化方法研究 认领 引用 被引量：6
12
作者 孙琳丽 景元书 +4 位作者 马玉平 俄有浩 邹艳东 邢开瑜 吴玮 《中国农业气象》 CSCD 北大核心 2012年第4期555-566,共12页
以夏玉米叶面积指数(LAI)、贮存器官干重(WSO)、地上总干重(TAGP)以及土壤水分含量(SM)为结合点,建立了基于Downhill-Simplex算法的作物生长模型WOFOST同化多种地面观测数据的一般方法或流程:开展观测数据与作物生长模型同化方法的正确... 以夏玉米叶面积指数(LAI)、贮存器官干重(WSO)、地上总干重(TAGP)以及土壤水分含量(SM)为结合点,建立了基于Downhill-Simplex算法的作物生长模型WOFOST同化多种地面观测数据的一般方法或流程:开展观测数据与作物生长模型同化方法的正确性验证→利用Downhill-Simplex算法进行WOFOST模型的敏感性分析→选择敏感参数组合→通过优化效果确定待优化参数→利用新的观测数据对待优化参数进行优化,从而实现了观测数据与作物生长模型的同化,提升了模型的模拟能力。同化过程中遴选出的WOFOST模型的待优化参数主要包括比叶面积、最大CO2同化速率、初始地上部总干物重、根深最大日增量和初始土壤有效水等。 展开更多
关键词 观测数据同化 作物生长模型 Downhill—Simplex算法 敏感性分析
暂未订购 下载PDF
A ROBUST PHASE-ONLY DIRECT DATA DOMAIN ALGORITHM BASED ON GENERALIZED RAYLEIGH QUOTIENT OPTIMIZATION USING HYBRID GENETIC ALGORITHM 认领 引用 被引量：2
13
作者 Shao Wei Qian Zuping Yuan Feng 《Journal of Electronics(China)》 2007年第4期560-566,共7页
A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency ... A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency and computational speed are improved via the hybrid GA com- posed of standard GA and Nelder-Mead simplex algorithms. First, the objective function, with a form of generalized Rayleigh quotient, is derived via the standard D3LS algorithm. It is then taken as a fitness function and the unknown phases of all adaptive weights are taken as decision variables. Then, the nonlinear optimization is performed via the hybrid GA to obtain the optimized solution of phase-only adaptive weights. As a phase-only adaptive algorithm, the proposed algorithm is sim- pler than conventional algorithms when it comes to hardware implementation. Moreover, it proc- esses only a single snapshot data as opposed to forming sample covariance matrix and operating matrix inversion. Simulation results show that the proposed algorithm has a good signal recovery and interferences nulling performance, which are superior to that of the phase-only D3LS algorithm based on standard GA. 展开更多
关键词 Generalized Rayleigh quotient Hybrid genetic algorithm Phase-only optimization Direct Data Domain Least Squares （D^3LS） algorithm Nelder-Mead simplex algorithm
暂未订购 下载PDF
Learner Phase of Partial Reinforcement Optimizer with Nelder-Mead Simplex for Parameter Extraction of Photovoltaic Models 认领 引用
14
作者 Jinpeng Huang Zhennao Cai +3 位作者 Ali Asghar Heidari Lei Liu Huiling Chen Guoxi Liang 《Journal of Bionic Engineering》 SCIE EI CSCD 2024年第6期3041-3075,共35页
This paper proposes an improved version of the Partial Reinforcement Optimizer(PRO),termed LNPRO.The LNPRO has undergone a learner phase,which allows for further communication of information among the PRO population,c... This paper proposes an improved version of the Partial Reinforcement Optimizer(PRO),termed LNPRO.The LNPRO has undergone a learner phase,which allows for further communication of information among the PRO population,changing the state of the PRO in terms of self-strengthening.Furthermore,the Nelder-Mead simplex is used to optimize the best agent in the population,accelerating the convergence speed and improving the accuracy of the PRO population.By comparing LNPRO with nine advanced algorithms in the IEEE CEC 2022 benchmark function,the convergence accuracy of the LNPRO has been verified.The accuracy and stability of simulated data and real data in the parameter extraction of PV systems are crucial.Compared to the PRO,the precision and stability of LNPRO have indeed been enhanced in four types of photovoltaic components,and it is also superior to other excellent algorithms.To further verify the parameter extraction problem of LNPRO in complex environments,LNPRO has been applied to three types of manufacturer data,demonstrating excellent results under varying irradiation and temperatures.In summary,LNPRO holds immense potential in solving the parameter extraction problems in PV systems. 展开更多
关键词 Partial reinforcement optimizer Learner phase Nelder-Mead simplex algorithm Parameter extraction
基于Simplex算法对马奶啤酒发酵控制优化及品质分析 认领 引用 被引量：1
15
作者 王威 武运 +4 位作者 古丽娜孜 张亚南 吴浩天 田歌 华雨 《食品工业科技》 CAS CSCD 北大核心 2017年第4期191-196,共6页
以马奶啤酒为考察对象,通过控制单因素实验确定四个单因素,判断步长,利用Simplex算法确定马奶啤酒发酵控制参数,结果表明:接种总量8%(干酪乳杆菌∶马克思克鲁维酵母菌=1∶2),发酵温度35℃,发酵时间48 h,蔗糖添加量9%及麦芽汁添加量30%... 以马奶啤酒为考察对象,通过控制单因素实验确定四个单因素,判断步长,利用Simplex算法确定马奶啤酒发酵控制参数,结果表明:接种总量8%(干酪乳杆菌∶马克思克鲁维酵母菌=1∶2),发酵温度35℃,发酵时间48 h,蔗糖添加量9%及麦芽汁添加量30%为最佳发酵参数,此条件下的综合p H为3.30±0.02,酒精度为5.4%±0.2%vol,感官评分为79±1.4。感官指标,理化指标及卫生指标均符合《GB 19302-2010发酵乳》国标。马奶啤酒发酵控制的研究为新疆地区马乳及其制品的多样性提供了理论与实践基础。 展开更多
关键词 马奶啤酒 Simplex算法 发酵控制参数 品质分析
暂未订购 下载PDF
基于MATLAB GUI的单纯形法求解器软件开发 认领 引用
16
作者 周黄威 罗显枫 +1 位作者 黄小荣 李冬梅 《湖北理工学院学报》 2026年第1期69-73,共5页
在新工科教育背景下,信息技术与传统工科课程的深度融合已成为教学改革的重要方向。针对“运筹学”课程中单纯形法抽象、初学者理解难度大的问题,文章开发了一款基于MATLAB GUI的单纯形法求解器软件。该软件不仅能够以表格形式动态展示... 在新工科教育背景下,信息技术与传统工科课程的深度融合已成为教学改革的重要方向。针对“运筹学”课程中单纯形法抽象、初学者理解难度大的问题,文章开发了一款基于MATLAB GUI的单纯形法求解器软件。该软件不仅能够以表格形式动态展示单纯形法的每一次迭代结果,还引入了半平面交算法自动绘出图解法的可行域,从而实现代数推演与几何直观的同步呈现。学生在学习过程中可以同时观察到迭代表格的更新与可行域顶点的变化,能显著提升对单纯形法的学习兴趣和理解效果,为“运筹学”课程改革和新工科专业建设提供了有益经验。 展开更多
关键词 “运筹学”课程 半平面交算法 单纯形法 MATLAB GUI
暂未订购 下载PDF
基于Simplex码的BOTDR数字相干探测技术及算法研究 认领 引用
17
作者 郝蕴琦 杨坤 翟凤潇 《激光杂志》 CAS 北大核心 2018年第4期65-67,共3页
针对基于Simplex码的BOTDR传感系统相干检测中本地光频率固定的情况,本文提出利用数字相干探测技术方案,设计相关算法,得到传感光纤的三维布里渊散射谱。高速数据采集卡采集每行Simplex码对应的时域信号,转化为数字信号之后在频域进行... 针对基于Simplex码的BOTDR传感系统相干检测中本地光频率固定的情况,本文提出利用数字相干探测技术方案,设计相关算法,得到传感光纤的三维布里渊散射谱。高速数据采集卡采集每行Simplex码对应的时域信号,转化为数字信号之后在频域进行信号处理与分析。对于所有的编码序列,提取出某频率处所有空间分辨率内的幅度,乘以Simplex码的逆矩阵后进行移位平均,获得该频率处传感光纤的幅度;同理可得到其它频率处的幅度信息;最终获得传感光纤长度上一定频率范围内的幅度信息,即布里渊散射谱。实验中对31位Simplex码的BOTDR系统干涉信号进行数字相干探测,解调出了布里渊散射谱及对应的幅度和频率信息。实验结果表明该探测技术及算法的可行性。 展开更多
关键词 光纤光学 布里渊散射谱 数字相干探测及算法 Simplex码 BOTDR
暂未订购 下载PDF
Practical Application of Out-of-Kilter Algorithm 认领 引用
18
作者 Irma Ibrišimović Zoran Jasak +1 位作者 Aldijana Omerović ElvirČajić 《Chinese Business Review》 2023年第2期86-94,共9页
The algorithm under this name, together with the variants, is a method that solves the problems of optimal flow and costs. Examples of such problems are planning and procurement, scheduling by contractors, distributio... The algorithm under this name, together with the variants, is a method that solves the problems of optimal flow and costs. Examples of such problems are planning and procurement, scheduling by contractors, distribution and supply systems, transport on the road or rail network, electricity transmission, computer and telecommunications networks, pipe transmission systems (water, oil, …), and the like. The main goal of any business organization is to increase profits and satisfy its customers. Because business is an integral part of our environment, their goals will be limited by certain environmental factors and economic conditions. The out-of-kilter algorithm is used to solve a complex allocation problem involving interactive and conflicting personal choices subject to interactive resource constraints. The paper presents an example of successful use of this algorithm and proposes an extension to the areas of corporate and social planning. Customer demand, warehousing, and factory capacity were used as input for the model. First, we propose a linear programming approach to determine the optimal distribution pattern to reduce overall distribution costs. The proposed model of linear programming is solved by the standard simplex algorithm and the Excel-solver program. It is noticed that the proposed model of linear programming is suitable for finding the optimal distribution pattern and total minimum costs. 展开更多
关键词 out-of-kilter algorithm linear programming minimization minimum cost flow simplex algorithm
暂未订购 下载PDF
基于Downhill-Simplex算法的客舱照明优化设计方法研究 认领 引用
19
作者 刘正权 钟军 《照明工程学报》 2014年第3期124-127,共4页
优化设计方法在照明设计中得到了广泛和深入的研究。针对民用飞机客舱照明设计方案,研究了Downhill-Simplex优化算法在客舱照明设计中的应用,编写了照明优化设计程序,通过客舱工作面照度均匀度优化设计实例对优化设计程序进行了验证。... 优化设计方法在照明设计中得到了广泛和深入的研究。针对民用飞机客舱照明设计方案,研究了Downhill-Simplex优化算法在客舱照明设计中的应用,编写了照明优化设计程序,通过客舱工作面照度均匀度优化设计实例对优化设计程序进行了验证。其中优化前客舱工作面照度均匀度为0.5,通过优化客舱工作面照度均匀度达到了0.8,表明优化算法是可靠的。本优化设计方法可用于飞机内外部照明、道路照明和投影设备等非成像光学设计领域。 展开更多
关键词 客舱照明 全局优化 光学仿真 Downhill-Simplex算法
暂未订购 下载PDF
矿井通风网络风阻智能校准研究 认领 引用 被引量：1
20
作者 闫振国 张龙成 +4 位作者 王延平 曹豫其 刘毅涛 陈崇武 阮佳宁 《工矿自动化》 CSCD 北大核心 2025年第9期124-132,共9页
现有矿井通风系统风阻校准模型未严格界定摩擦阻力因数的约束情况,并缺乏风阻调整幅度的相关考虑,导致风阻校准效率低。针对上述问题,提出了一种以风阻修正量最小化及实测-解算风量误差最小化为双重目标的风阻校准优化模型。该模型严格... 现有矿井通风系统风阻校准模型未严格界定摩擦阻力因数的约束情况,并缺乏风阻调整幅度的相关考虑,导致风阻校准效率低。针对上述问题,提出了一种以风阻修正量最小化及实测-解算风量误差最小化为双重目标的风阻校准优化模型。该模型严格划定风阻参数的物理可行域,通过加权法将双目标优化模型转换为单目标函数,协同实现风阻修正量最小化与实测-解算风量误差最小化,维持初始风阻参数的物理真实性,并提升网络解算的精度。在模型求解方面,将下山单纯形(NMS)算法的几何操作与蜣螂优化(DBO)算法的生物寻优行为相结合,提出NMS-DBO算法,该算法通过自适应权重融合策略、反射方向感知与滚球导航的融合策略、收缩回退与孵卵开发的融合策略使风阻校准优化模型输出最优风阻解,确保风阻参数在物理约束范围内实现高精度校准。以含有35个分支的某矿井通风网络为研究对象,建立风阻校准模型,并采用NMS-DBO算法、鲸鱼优化算法(WOA)、粒子群优化(PSO)算法及DBO算法分别进行求解,结果表明:NMS-DBO算法求解的目标函数值为0.454,优于WOA(0.853)、PSO算法(0.525)及DBO算法(0.521),表明NMS-DBO算法在收敛精度上优于其他3种算法;NMS-DBO算法求解的最优风阻与初始风阻的相关性系数达0.998,最大实测-解算风量误差从22.99 m3/s降至3 m3/s以内,实现了风阻参数与风量高精度匹配的协同优化。 展开更多
关键词 矿井通风系统 初始风阻校准 下山单纯形法 蜣螂优化算法 通风网络解算 实测-解算风量误差 风阻修正量
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 23 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈