期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到735篇文章
< 1 2 … 37 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
From recursion to tabulation:Rethinking how we teach dynamic programming 认领 引用
1
作者 Jiang Long 《计算机教育》 2026年第6期302-311,共10页
This paper proposes an intuitive,modular teaching framework for dynamic programming(DP).Beginning with the fundamental concept of recursion,the framework leverages dependency graphs to visually illustrate structural r... This paper proposes an intuitive,modular teaching framework for dynamic programming(DP).Beginning with the fundamental concept of recursion,the framework leverages dependency graphs to visually illustrate structural relationships among subproblems.This visual approach helps students intuitively grasp the underlying logic of tabulation,enabling them to independently determine correct tabulation orders.The plug-and-play design significantly reduces the barrier to learning,while strengthening students'analytical thinking and problem-solving skills.The effectiveness of this method is demonstrated through classroom application using classic examples such as the longest common subsequence(LCS),matrix chain multiplication(MCM),and rod cutting problems. 展开更多
关键词 Dynamic programming Plug-and-play framework Algorithm pedagogy Computer science education
暂未订购 下载PDF
A Dynamic Programming Algorithm on Project- Gang Investment Decision Making 认领 引用
2
作者 Xu Xu-song Wu Jian-mou 《Wuhan University Journal of Natural Sciences》 EI CAS 2002年第4期403-407,共5页
The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic ... The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic programming algorithm on the investment decision making of Project Gang is brought forward, and this algorithm can find out the best Scheme of distributing the m resources to the n Items in the time of O(m 2 n). 展开更多
关键词 Project-Gang investment decision making dynamic programming algorithm
暂未订购 下载PDF
Comparison between dynamic programming and genetic algorithm for hydro unit economic load dispatch 认领 引用 被引量：1
3
作者 Bin XU Ping-an ZHONG +2 位作者 Yun-fa ZHAO Yu-zuo ZHU Gao-qi ZHANG 《Water Science and Engineering》 EI CAS CSCD 2014年第4期420-432,共13页
The hydro unit economic load dispatch （ELD） is of great importance in energy conservation and emission reduction. Dynamic programming （DP） and genetic algorithm （GA） are two representative algorithms for solving... The hydro unit economic load dispatch （ELD） is of great importance in energy conservation and emission reduction. Dynamic programming （DP） and genetic algorithm （GA） are two representative algorithms for solving ELD problems. The goal of this study was to examine the performance of DP and GA while they were applied to ELD. We established numerical experiments to conduct performance comparisons between DP and GA with two given schemes. The schemes included comparing the CPU time of the algorithms when they had the same solution quality, and comparing the solution quality when they had the same CPU time. The numerical experiments were applied to the Three Gorges Reservoir in China, which is equipped with 26 hydro generation units. We found the relation between the performance of algorithms and the number of units through experiments. Results show that GA is adept at searching for optimal solutions in low-dimensional cases. In some cases, such as with a number of units of less than 10, GA＇s performance is superior to that of a coarse-grid DP. However, GA loses its superiority in high-dimensional cases. DP is powerful in obtaining stable and high-quality solutions. Its performance can be maintained even while searching over a large solution space. Nevertheless, due to its exhaustive enumerating nature, it costs excess time in low-dimensional cases. 展开更多
关键词 hydro unit economic load dispatch dynamic programming genetic algorithm numerical experiment
暂未订购 下载PDF
Application of Dynamic Programming Algorithm Based on Model Predictive Control in Hybrid Electric Vehicle Control Strategy 认领 引用 被引量：1
4
作者 Xiaokan Wang Qiong Wang 《Journal on Internet of Things》 2020年第2期81-87,共7页
A good hybrid vehicle control strategy cannot only meet the power requirements of the vehicle,but also effectively save fuel and reduce emissions.In this paper,the construction of model predictive control in hybrid el... A good hybrid vehicle control strategy cannot only meet the power requirements of the vehicle,but also effectively save fuel and reduce emissions.In this paper,the construction of model predictive control in hybrid electric vehicle is proposed.The solving process and the use of reference trajectory are discussed for the application of MPC based on dynamic programming algorithm.The simulation of hybrid electric vehicle is carried out under a specific working condition.The simulation results show that the control strategy can effectively reduce fuel consumption when the torque of engine and motor is reasonably distributed,and the effectiveness of the control strategy is verified. 展开更多
关键词 State of charge model predictive control dynamic programming algorithm optimization
暂未订购 下载PDF
A Dynamic Programming Algorithm for the Ridersharing Problem Restricted with Unique Destination and Zero Detour on Trees 认领 引用
5
作者 Yiming Li Huiqiang Lu +1 位作者 Zhiqian Ye Xiao Zhou 《Journal of Applied Mathematics and Physics》 2017年第9期1678-1685,共8页
We deal with the problem of sharing vehicles by individuals with similar itineraries which is to find the minimum number of drivers, each of which has a vehicle capacity and a detour to realize all trips. Recently, Gu... We deal with the problem of sharing vehicles by individuals with similar itineraries which is to find the minimum number of drivers, each of which has a vehicle capacity and a detour to realize all trips. Recently, Gu et al. showed that the problem is NP-hard even for star graphs restricted with unique destination, and gave a polynomial-time algorithm to solve the problem for paths restricted with unique destination and zero detour. In this paper we will give a dynamic programming algorithm to solve the problem in polynomial time for trees restricted with unique destination and zero detour. In our best knowledge it is a first polynomial-time algorithm for trees. 展开更多
关键词 Dynamic Programming Algorithm Rideshare Tree
暂未订购 下载PDF
Dynamic vehicle routing for a dual-channel distribution center with stochastic demands and shared resources 认领 引用
6
作者 XU Mei YANG Feng CHEN Ting 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2025年第6期1501-1531,共31页
This paper addresses a dynamic vehicle routing problem with stochastic requests in a dual-channel distribution center that utilizes shared vehicle resources to serve two types of customers:offline corporate clients(CC... This paper addresses a dynamic vehicle routing problem with stochastic requests in a dual-channel distribution center that utilizes shared vehicle resources to serve two types of customers:offline corporate clients(CCs)with fixed and stochastic batch demands,and online individual customers(ICs)with single-unit demands.To manage stochastic batch demands from CCs,this paper proposes three recourse policies under a differentiated resource-sharing scheme:the waiting-tour-based(WTB)policy,the advance-tour-based(ATB)policy,and the advance-customer-based(ACB)policy.These policies differ in their response priorities to random requests and the scope of route reoptimization.The problem is formulated as a two-stage stochastic recourse programming model,where the first stage establishes routes for fixed demands.In the second stage,we construct three stochastic recourse programming models corresponding to the proposed recourse policies.To solve these models,this paper develop rolling horizon algorithms integrated with mathematical programming models or metaheuristic algorithms.Extensive numerical experiments validate the effectiveness of the proposed algorithms and policies.The results indicate that both the ATB and ACB policies lead to cost savings compared to the WTB policy,especially when stochastic demands are urgent and delivery resources are quite limited.Specifically,when the number of ICs is small,the expected total cost savings can exceed 12%,and in some scenarios,savings of over 20%can be achieved.When the number of ICs is large,some scenarios can achieve cost savings exceeding 7%.Furthermore,the ACB policy yields lower costs,fewer worsened ICs,fewer trips,and less vehicle time than the ATB policy. 展开更多
关键词 dynamic vehicle routing stochastic request dualchannel distribution stochastic recourse programming rolling horizon algorithm
暂未订购 下载PDF
A hybrid dynamic programming-rule based algorithm for real-time energy optimization of plug-in hybrid electric bus 认领 引用 被引量：21
7
作者 ZHANG Ya Hui JIAO Xiao Hong +3 位作者 LI Liang YANG Chao ZHANG Li Peng SONG Jian 《Science China(Technological Sciences)》 SCIE EI CAS 2014年第12期2542-2550,共9页
The optimization of the control strategy of a plug-in hybrid electric bus(PHEB) for the repeatedly driven bus route is a key technique to improve the fuel economy. The widely used rule-based(RB) control strategy is la... The optimization of the control strategy of a plug-in hybrid electric bus(PHEB) for the repeatedly driven bus route is a key technique to improve the fuel economy. The widely used rule-based(RB) control strategy is lacking in the global optimization property, while the global optimization algorithms have an unacceptable computation complexity for real-time application. Therefore, a novel hybrid dynamic programming-rule based(DPRB) algorithm is brought forward to solve the global energy optimization problem in a real-time controller of PHEB. Firstly, a control grid is built up for a given typical city bus route, according to the station locations and discrete levels of battery state of charge(SOC). Moreover, the decision variables for the energy optimization at each point of the control grid might be deduced from an off-line dynamic programming(DP) with the historical running information of the driving cycle. Meanwhile, the genetic algorithm(GA) is adopted to replace the quantization process of DP permissible control set to reduce the computation burden. Secondly, with the optimized decision variables as control parameters according to the position and battery SOC of a PHEB, a RB control is used as an implementable controller for the energy management. Simulation results demonstrate that the proposed DPRB might distribute electric energy more reasonably throughout the bus route, compared with the optimized RB. The proposed hybrid algorithm might give a practicable solution, which is a tradeoff between the applicability of RB and the global optimization property of DP. 展开更多
关键词 plug-in hybrid electric bus （PHEB） control strategy optimization dynamic programming （DP） genetic algorithm （GA） city bus route
暂未订购 下载PDF
Bus frequency optimization in a large-scale multi-modal transportation system:integrating 3D-MFD and dynamic traffic assignment 认领 引用
8
作者 Kai Yuan Dandan Cui Jiancheng Long 《Digital Transportation and Safety》 2023年第4期241-252,共12页
A properly designed public transport system is expected to improve traffic efficiency.A high-frequency bus service would decrease the waiting time for passengers,but the interaction between buses and cars might result... A properly designed public transport system is expected to improve traffic efficiency.A high-frequency bus service would decrease the waiting time for passengers,but the interaction between buses and cars might result in more serious congestion.On the other hand,a low-frequency bus service would increase the waiting time for passengers and would not reduce the use of private cars.It is important to strike a balance between high and low frequencies in order to minimize the total delays for all road users.It is critical to formulate the impacts of bus frequency on congestion dynamics and mode choices.However,as far as the authors know,most proposed bus frequency optimization formulations are based on static demand and the Bureau of Public Roads function,and do not properly consider the congestion dynamics and their impacts on mode choices.To fill this gap,this paper proposes a bi-level optimization model.A three-dimensional Macroscopic Fundamental Diagram based modeling approach is developed to capture the bi-modal congestion dynamics.A variational inequality model for the user equilibrium in mode choices is presented and solved using a double projection algorithm.A surrogate model-based algorithm is used to solve the bi-level programming problem. 展开更多
关键词 Three-dimensional macroscopic fundamental diagram Dynamic traffic assignment Bi-level programming model Double projection algorithm Surrogate model-based algorithm
暂未订购 下载PDF
Predictive Mathematical and Statistical Modeling of the Dynamic Poverty Problem in Burundi: Case of an Innovative Economic Optimization System 认领 引用
9
作者 Fulgence Nahayo Ancille Bagorizamba +1 位作者 Marc Bigirimana Irene Irakoze 《Open Journal of Optimization》 2021年第4期101-125,共25页
The mathematical and statistical modeling of the problem of poverty is a major challenge given Burundi’s economic development. Innovative economic optimization systems are widely needed to face the problem of the dyn... The mathematical and statistical modeling of the problem of poverty is a major challenge given Burundi’s economic development. Innovative economic optimization systems are widely needed to face the problem of the dynamic of the poverty in Burundi. The Burundian economy shows an inflation rate of -1.5% in 2018 for the Gross Domestic Product growth real rate of 2.8% in 2016. In this research, the aim is to find a model that contributes to solving the problem of poverty in Burundi. The results of this research fill the knowledge gap in the modeling and optimization of the Burundian economic system. The aim of this model is to solve an optimization problem combining the variables of production, consumption, budget, human resources and available raw materials. Scientific modeling and optimal solving of the poverty problem show the tools for measuring poverty rate and determining various countries’ poverty levels when considering advanced knowledge. In addition, investigating the aspects of poverty will properly orient development aid to developing countries and thus, achieve their objectives of growth and the fight against poverty. This paper provides a new and innovative framework for global scientific research regarding the multiple facets of this problem. An estimate of the poverty rate allows good progress with the theory and optimization methods in measuring the poverty rate and achieving sustainable development goals. By comparing the annual food production and the required annual consumption, there is an imbalance between different types of food. Proteins, minerals and vitamins produced in Burundi are sufficient when considering their consumption as required by the entire Burundian population. This positive contribution for the latter comes from the fact that some cows, goats, fishes, ···, slaughtered in Burundi come from neighboring countries. Real production remains in deficit. The lipids, acids, calcium, fibers and carbohydrates produced in Burundi are insufficient for consumption. This negative contribution proves a Burundian food deficit. It is a decision-making indicator for the design and updating of agricultural policy and implementation programs as well as projects. Investment and economic growth are only possible when food security is mastered. The capital allocated to food investment must be revised upwards. Demographic control is also a relevant indicator to push forward Burundi among the emerging countries in 2040. Meanwhile, better understanding of the determinants of poverty by taking cultural and organizational aspects into account guides managers for poverty reduction projects and programs. 展开更多
关键词 Poverty Problem Mathematical Modeling Applied Statistics Operational Research Symplectic Partitioned Runge Kutta Algorithm Dynamic Programming Matlab and Simulink AMPL KNITRO Gurobi Economic Optimization Technology Transfer Incubation of Results Sustainable Development Goals
暂未订购 下载PDF
多周期应急资源调配主体冲突消解方法研究 认领 引用 被引量：2
10
作者 陈雪龙 王子睿 李苗苗 《中国管理科学》 CSSCI CSCD 北大核心 2026年第3期226-241,共16页
应急资源调配是在时间紧迫、资源短缺、预算压力的环境下,多主体参与和协作的复杂系统工程,消解应急资源调配系统内的主体冲突是保障资源调配活动顺利开展的前提。针对应急资源调配主体冲突消解问题,基于三层两阶段多周期应急资源调配模... 应急资源调配是在时间紧迫、资源短缺、预算压力的环境下,多主体参与和协作的复杂系统工程,消解应急资源调配系统内的主体冲突是保障资源调配活动顺利开展的前提。针对应急资源调配主体冲突消解问题,基于三层两阶段多周期应急资源调配模式,给出了资源调配主体及其冲突表示方法,定义了主体冲突测度方法;考虑到主体冲突消解的目的是提升资源调配的效能,构建了救援成本最小化、救生效用最大化、公平性最优等资源调配目标与多主体利益诉求之间的映射关系,给出相应定理并证明了上述目标的优化与主体冲突消解的正相关性;在此基础上,建立了主体冲突消解的多周期多目标的动态规划模型;基于近似动态规划的思想,设计了基于贪心随机自适应搜索算法的滚动算法对模型进行求解,在优化资源调配目标的同时实现主体冲突消解;通过震后应急资源调配算例验证了方法的科学性及有效性。研究结果表明,主体间目标差异是主体冲突产生的内在动因,且主体目标在资源调配各周期随灾害情境的演变而动态变化;以资源调配目标偏好与多主体利益诉求间的映射关系为基础构建的多周期多目标动态规划模型,可在资源调配各周期、多阶段平衡主体的目标和诉求,实现动态的多主体共识达成及最优决策,从而有效消解应急资源调配系统内主体冲突,且在资源调配过程中成本得到合理控制,救生效用和公平性得到兼顾,灾民的剥夺痛苦得到显著缓解。 展开更多
关键词 应急资源调配 主体冲突消解 多周期动态规划 剥夺成本 滚动算法
暂未订购 下载PDF
水库优化调度模型求解算法的比较研究 认领 引用
11
作者 黄馗 郭佳俊 +3 位作者 艾学山 穆振宇 丁杰 石轩语 《武汉大学学报（工学版）》 CAS CSCD 北大核心 2026年第1期24-30,共7页
基于以发电量最大为目标的水库优化调度模型,分析了4种具有代表性的优化调度算法,即动态规划(dynamic programming,DP)算法、离散微分动态规划(discrete differential dynamic programming,DDDP)算法、逐步优化算法(progressive optimal... 基于以发电量最大为目标的水库优化调度模型,分析了4种具有代表性的优化调度算法,即动态规划(dynamic programming,DP)算法、离散微分动态规划(discrete differential dynamic programming,DDDP)算法、逐步优化算法(progressive optimality algorithm,POA)和浮子算法(float algorithm,FA)的理论基础及求解流程,并以南欧江流域和沅江流域的多个水电站为实例,对比分析了各算法的求解效果及效率。结果表明:DP算法的结果精确,但计算时空复杂度较高,DDDP算法往往能收敛至全局最优解且相对高效,POA需要较优的初始解才能收敛至全局最优解附近;FA计算效率高且解的精度较高,在不发生弃水时几乎可直接得到最优解,在发生弃水时亦能得到较优的初始解。基于水库发电优化调度运行规律建立的浮子算法为水库优化调度模型求解开辟了新思路,具有较好的应用前景。 展开更多
关键词 水库优化调度 浮子算法 离散微分动态规划 逐步优化算法
暂未订购 下载PDF
智能车辆实时避障轨迹规划研究 认领 引用
12
作者 张丽霞 李龙飞 +2 位作者 潘福全 葛吴邑 李宝刚 《哈尔滨理工大学学报》 CAS 北大核心 2026年第2期63-73,共11页
自动驾驶车辆实际运行过程中会出现车辆变道,避障过程中也易与其他车辆及行人发生碰撞。为提升汽车的安全性能,将时间-路径-速度三维轨迹规划问题进行降维解耦,分解成路径规划及速度规划2个二维问题进行求解。在路径规划层,引入JPS跳点... 自动驾驶车辆实际运行过程中会出现车辆变道,避障过程中也易与其他车辆及行人发生碰撞。为提升汽车的安全性能,将时间-路径-速度三维轨迹规划问题进行降维解耦,分解成路径规划及速度规划2个二维问题进行求解。在路径规划层,引入JPS跳点搜索法,并加入障碍物模型,同时对JPS启发函数进行优化以减少JPS算法扩展节点数量和扩展次数,最后基于分段加速度连续性约束及各项空间约束进行二次规划算法路径平滑处理,生成最终规划路径。在速度规划层,对障碍物进行运动预测并投影至规划空间,再利用动态规划算法作为“粗规划”并进行剪枝优化,最后构建二次规划模型进行速度平滑,输出完整的速度规划结果。通过仿真测试和实车验证可知,所设计的路径规划和速度规划系统能有效避开障碍物,曲率连续,路径平均规划时间在4 ms以内,速度规划时间控制在10 ms以内,实时性良好。 展开更多
关键词 避障轨迹规划 动态规划算法 二次规划算法 跳点搜索算法 速度规划
暂未订购 下载PDF
集采模式下航空企业多地多周期横向调配 认领 引用
13
作者 付维方 王宏博 +1 位作者 张兆民 张伟钢 《上海海事大学学报》 北大核心 2026年第1期113-119,167,共7页
为改善航空企业多基地需求与库存不匹配的现象,针对缺货无运行影响的消耗件,本文研究集采模式下多地多周期横向调配问题。整合集采、分配和调配三个传统的独立决策环节,提出多地多周期的备件供应联合优化的动态决策模型。考虑满足各基... 为改善航空企业多基地需求与库存不匹配的现象,针对缺货无运行影响的消耗件,本文研究集采模式下多地多周期横向调配问题。整合集采、分配和调配三个传统的独立决策环节,提出多地多周期的备件供应联合优化的动态决策模型。考虑满足各基地服务水平要求和降低企业总库存成本,设计遗传算法以求解决策模型。与其他4种保障方案进行比较,仿真结果显示,不同参数下本文方案的运营总成本均比其他方案的低。本文方案可提高备件供应的经济性,为航空企业多基地联合保障体系优化提供理论依据。 展开更多
关键词 消耗件 横向调配 服务水平 动态规划 遗传算法
暂未订购 下载PDF
基于云边协同的远程驾驶接管任务自适应卸载模型 认领 引用
14
作者 赵红专 汪懿晨 +5 位作者 张继康 袁泉 王建强 杨良义 王涛 周旦 《交通运输工程学报》 EI CAS CSCD 北大核心 2026年第6期153-166,共14页
建立了基于云边协同的自适应任务卸载模型,分析了远程驾驶接管过程中因网络波动与算力不足引起的高时延与连接不稳定问题;定义了实时控制类、计算密集型与交互服务类3类任务,并设定了紧急与一般两级优先级体系,以精确区分不同任务对时... 建立了基于云边协同的自适应任务卸载模型,分析了远程驾驶接管过程中因网络波动与算力不足引起的高时延与连接不稳定问题;定义了实时控制类、计算密集型与交互服务类3类任务,并设定了紧急与一般两级优先级体系,以精确区分不同任务对时延和可靠性的差异化需求;构建了融合云端中心、边缘节点与车载终端的协同计算环境,提出了基于任务优先级动态分配计算节点、结合实时网络带宽与边缘负载自适应调整资源权重的分层卸载规则,并研究了基于备用节点的断点续传机制,以增强系统在不稳定环境下的鲁棒性;采用动态规划算法构建了以全局最小时延为优化目标的决策模型,设定了相应的奖励函数以量化评估不同卸载策略的有效性;基于任务数据量、处理器频率等11项参数构建了专门的数据集,并设计了对比试验,系统研究了模型在动态负载与不同资源状态下的性能表现。研究结果表明:在边缘负载动态变化的场景下,所提自适应卸载策略获得的奖励值相较于传统固定阈值边缘计算方法提升13.2%;在引入云端协同计算后,系统整体奖励值相较于仅使用边缘计算的方案提升23.6%;特别在边缘节点负载超过60%时,该策略能够有效降低任务阻塞率达45%。 展开更多
关键词 智能交通 云边协同计算 动态规划算法 远程驾驶接管 网联自动驾驶汽车
暂未订购 下载PDF
区间合并问题类的统一建模与动态规划求解框架 认领 引用
15
作者 石海鹤 龚嘉盈 +3 位作者 熊潇 靳梦 杜人增 石海鹏 《华中科技大学学报（自然科学版）》 EI CAS CSCD 北大核心 2026年第6期108-113,共6页
针对动态规划中一类尚未被形式化研究的问题,提出区间合并动态规划问题的概念,并为区间合并动态规划问题开发了建模和动态规划求解的统一形式化框架.深入分析区间合并动态规划问题的本质特征,刻画区间合并动态规划问题的代数语义,借助... 针对动态规划中一类尚未被形式化研究的问题,提出区间合并动态规划问题的概念,并为区间合并动态规划问题开发了建模和动态规划求解的统一形式化框架.深入分析区间合并动态规划问题的本质特征,刻画区间合并动态规划问题的代数语义,借助形式化方法分划与递推(PAR)进行问题的通用形式化规约描述和算法形式化推导,从而设计出求解区间合并动态规划问题的通用泛型算法.通过选取典型区间合并动态规划问题实例进行建模和求解,展示了统一形式化框架的有效性和适用性,可为动态规划领域相关算法的形式化构造提供参考. 展开更多
关键词 区间合并 通用泛型算法 代数语义建模 动态规划 分划与递推(PAR)方法
暂未订购 下载PDF
基于混沌数据加密的切换系统最优控制与隐私保护 认领 引用
16
作者 齐义文 乔鑫鑫 +1 位作者 邓飞其 王云龙 《自动化学报》 EI CAS CSCD 北大核心 2026年第7期1360-1371,共12页
针对控制系统中数据经网络传输存在的隐私泄露以及隐私保护导致的性能损失问题,本文研究一种具有隐私保护的切换系统最优控制方法.首先,根据混沌系统的非周期性及不可预测性,开发一种基于混沌系统的数据加密方法.将主混沌系统生成的伪... 针对控制系统中数据经网络传输存在的隐私泄露以及隐私保护导致的性能损失问题,本文研究一种具有隐私保护的切换系统最优控制方法.首先,根据混沌系统的非周期性及不可预测性,开发一种基于混沌系统的数据加密方法.将主混沌系统生成的伪随机序列添加到切换系统输出数据中,能避免其经非理想网络传输时隐私的泄露.其次,设计一种基于粒子群优化算法的混沌形态同步控制器,降低不确定项的影响,保障主-从混沌系统的同步性,确保解密后数据的可用性.然后,利用自适应动态规划算法对采用解密后数据构造的代价函数进行优化,将预更新最优子系统的更新规则作为候选切换律.通过对比候选切换律与当前切换律作用下系统的性能,将性能好的切换律作为控制策略的一部分,确保切换系统性能最优.最后,通过仿真对所提方法的可行性进行验证. 展开更多
关键词 切换系统 隐私保护 自适应动态规划 主-从混沌系统 粒子群优化算法
暂未订购 下载PDF
基于蚁群优化算法的动态规划改进及大型露天矿山高效采剥规划 认领 引用
17
作者 吕玉琪 王孝东 +2 位作者 黄雪林 向弘 滕英超 《矿业研究与开发》 CAS 北大核心 2026年第1期52-59,共8页
为提高大型露天矿山采剥规划的效率与精度,提出了一种融合蚁群优化(ACO)算法与动态规划(DP)的开采增量体动态排序方法(ACO-DP)。结合ACO的分布式搜索机制,重构状态转移路径选择策略,显著降低计算复杂度。通过广东某露天采石场的实际应用... 为提高大型露天矿山采剥规划的效率与精度,提出了一种融合蚁群优化(ACO)算法与动态规划(DP)的开采增量体动态排序方法(ACO-DP)。结合ACO的分布式搜索机制,重构状态转移路径选择策略,显著降低计算复杂度。通过广东某露天采石场的实际应用,验证ACO-DP方法在提升采剥规划效率、优化资源配置和提高经济效益方面的显著作用。结果表明,ACO-DP方法将采石场的规划时间从3000 min缩短至6.45 min,效率提升了99.8%,采剥比从0.39优化至0.124,降幅为68.2%,净现值从24499万元逐步增加到峰值25393万元。ACO-DP方法可集成至矿山数字孪生系统,支持实时动态调整与多目标协同优化,为“双碳”目标下的矿山智能规划提供了新思路。 展开更多
关键词 大型露天矿山 采剥规划优化 蚁群优化算法 动态规划 开采增量体动态排序
暂未订购 下载PDF
抽水蓄能电站面板堆石坝土石方平衡智能优化调配方法 认领 引用
18
作者 袁霖 闫宾 +2 位作者 钟金盛 林文 闫书星 《水电与抽水蓄能》 2026年第2期28-35,共8页
抽水蓄能电站建设过程中,土石方调配问题涉及多点施工区域,还需考虑地形地质、料源、坝体分区和施工进度等因素。传统土石方调配方法过度依赖经验,难以动态响应施工环境变化。将土石方调配动态规划分别与线性规划、遗传算法和粒子群算... 抽水蓄能电站建设过程中,土石方调配问题涉及多点施工区域,还需考虑地形地质、料源、坝体分区和施工进度等因素。传统土石方调配方法过度依赖经验,难以动态响应施工环境变化。将土石方调配动态规划分别与线性规划、遗传算法和粒子群算法相结合,构建了可实时调整的智能优化模型,并基于各阶段土石方供需变化,动态生成最优调配方案。工程算例表明,该模型相较于传统人工手算结果有效提高了直接上坝率,减少了中转调运需求,降低了运输成本,为土石方资源调配提供了新的理论框架和实践方法。 展开更多
关键词 抽水蓄能电站 土石方调配 动态规划 智能算法 优化模型
暂未订购 下载PDF
干散货船队配置与运营调度协同优化研究 认领 引用
19
作者 梁金鹏 赵旭 +1 位作者 宋建欣 王杰 《交通运输系统工程与信息》 EI CSCD 北大核心 2026年第4期289-298,共10页
针对干散货船队配置与运营调度联合优化中多类决策高度耦合、求解规模大的问题,本文以最大化系统总利润为目标,建立基于时空网络的混合整数线性规划模型。为求解该模型,提出动态加船求解算法,通过将多船联合优化分解为序贯单船子问题,... 针对干散货船队配置与运营调度联合优化中多类决策高度耦合、求解规模大的问题,本文以最大化系统总利润为目标,建立基于时空网络的混合整数线性规划模型。为求解该模型,提出动态加船求解算法,通过将多船联合优化分解为序贯单船子问题,并设置边际收益终止准则,有效降低计算复杂度;采用随机模拟算例与基于铁矿石运输的大规模现实算例,对模型与算法进行验证和灵敏度分析。数值实验表明:动态加船算法与Gurobi求解结果的目标值偏差在大多数算例中控制在5%以内,而计算时间大幅缩短,在大规模算例中优势尤为显著;固定成本与燃油价格对船队运营决策存在“门槛效应”,在一定范围内仅压缩利润水平而不改变船队配置,超过临界阈值后将触发船舶数量收缩与低收益货物的主动放弃;系统净收益对数量占比较高的主干货类运价更为敏感,而少量高价值远洋货物的运价波动对整体盈利的带动作用相对有限。 展开更多
关键词 水路运输 船队配置与运营调度协同优化 动态加船算法 干散货船队 时空网络 混合整数线性规划
暂未订购 下载PDF
An online value iteration method for stochastic linear quadratic control with multiplicative noise 认领 引用
20
作者 Shumei Li Bing-Chang Wang Baoqiang Zhang 《Control Theory and Technology》 EI CSCD 2026年第3期451-461,共11页
This paper proposes a model-free online value iteration(VI)algorithm for solving stochastic linear quadratic control problems with ergodic cost functions,where the diffusion term in the dynamics equation is influenced... This paper proposes a model-free online value iteration(VI)algorithm for solving stochastic linear quadratic control problems with ergodic cost functions,where the diffusion term in the dynamics equation is influenced by both the state and control variables.First,we propose an offline VI algorithm based on the idea of stochastic approximation.However,this algorithm requires prior knowledge of the system parameters,which are not always readily available.To overcome this limitation,we then develop a(partially)model-free online learning algorithm based on VI.This algorithm only requires a single system trajectory and does not need the initial control to be stabilizing.By exploiting the growth rate of Itô’s integrals to handle the stochastic term generated by multiplicative noise,we provide a rigorous proof of the algorithm’s convergence.Finally,a simulation example is presented to validate the convergence of the proposed algorithms. 展开更多
关键词 Stochastic linear quadratic problem Model-free Value iteration algorithm Ergodic control Robust dynamic programming
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 37 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈