数学规划
58 种方法属于此方法族。
精选
非洲秃鹫优化算法The African Vultures Optimization Algorithm (AVOA) is a metaheuristic algorithm introduced by Moghdani and Salimifard in 2020, inspired by the search and scavenging behavior of Afr基于智能体的动态规划Agent-based dynamic programming (ABDP) embeds Bellman's dynamic programming framework within individual agents of an agent-based model, enabling each agent to solve sequential, mulAgent-Based Goal ProgrammingAgent-Based Goal Programming (ABGP) integrates agent-based simulation with goal programming optimization to model systems where multiple autonomous decision-makers pursue competing基于主体的整数规划Agent-Based Integer Programming (ABIP) couples the behavioral richness of agent-based modeling with the combinatorial rigor of integer programming. Individual agents pursue local oAquila OptimizerThe Aquila Optimizer (AO) is a nature-inspired metaheuristic algorithm presented by Abualigah et al. in 2021, modeled after the hunting behavior and sensory abilities of golden eag算术优化算法The Arithmetic Optimization Algorithm (AOA) is a metaheuristic optimization approach introduced by Abualigah et al. in 2020 that leverages mathematical operators (multiplication, d
Reading path
This topic's most-referenced foundational methods, in the order they were developed — a place to start if you're new here.
全部方法 58
非洲秃鹫优化算法基于智能体的动态规划Agent-Based Goal Programming基于主体的整数规划Aquila Optimizer算术优化算法贝叶斯动态规划贝叶斯目标规划贝叶斯整数规划贝叶斯线性规划贝叶斯混合整数规划贝叶斯优化双层优化（领导者-跟随者）分支定界法 (Branch and Bound)约束规划凸优化确定性动态规划确定性整数规划确定性线性规划确定性混合整数规划矮獴优化算法动态规划进化策略（CMA-ES）汉密尔顿-雅可比-贝尔曼方程Harris Hawks OptimizationHoney Badger Algorithm整数规划水母搜索优化器线性规划混合整数规划多目标动态规划多目标目标规划多目标线性规划 (MOLP)多目标混合整数规划非线性规划策略情景动态规划政策情景目标规划Policy Scenario Integer Programming二次规划 (QP)鲁棒目标规划鲁棒整数规划鲁棒线性规划鲁棒混合整数规划鲁棒优化龙格-库塔优化器单纯形法黏菌算法随机动态规划随机目标规划随机整数规划随机线性规划随机混合整数规划随机优化基于代理的模型优化机组组合变邻域搜索 (VNS)车辆路径问题 (VRP)鲸鱼优化算法 (WOA)