为求解高维优化问题,提出基于反向学习和衰减因子的灰狼优化算法(grey wolf algorithm based on opposition learning and reduction factor,ORGWO).设计一种灰狼反向学习模型,模型考虑问题搜索边界信息和种群历史搜索信息,初始种群阶...为求解高维优化问题,提出基于反向学习和衰减因子的灰狼优化算法(grey wolf algorithm based on opposition learning and reduction factor,ORGWO).设计一种灰狼反向学习模型,模型考虑问题搜索边界信息和种群历史搜索信息,初始种群阶段增加反向学习,增强种群多样性.根据算法各个阶段不同特征引入衰减因子,平衡全局和局部勘探能力.选取8个高维函数和23个不同特征的优化函数对算法性能进行测试,进一步使用收敛性分析,寻优成功率,CPU时间,Wilcoxon秩和检验来评估改进算法,实验结果表明,ORGWO算法在求解高维问题上具有较好的精度,鲁棒性和更快的收敛速度.展开更多
在许多经济模型中,决策者需要通过比较集值优化问题的目标函数来衡量支出以达到自身收益的最大。在电子商务视角下,本文讨论了有限理性下基于改进集的集合优化问题E-u-最小解集的Levitin-Polyak良定性和广义Levitin-Polyak良定性,并通...在许多经济模型中,决策者需要通过比较集值优化问题的目标函数来衡量支出以达到自身收益的最大。在电子商务视角下,本文讨论了有限理性下基于改进集的集合优化问题E-u-最小解集的Levitin-Polyak良定性和广义Levitin-Polyak良定性,并通过有限理性模型证明了该良定性的充分条件。此外,借助非线性分析的方法给出了集合优化问题(广义) Levitin-Polyak良定性的特征刻画。这些结果为电子商务在实际生活中的应用打下了夯实的理论基础。In many economic models, decision-makers need to measure expenditures by comparing the objective functions of set-valued optimization problems in order to achieve maximum benefit. Under the perspective of E-commerce, this paper studies the Levitin-Polyak well-posedness and generalized Levitin-Polyak well-posedness of E-u-minimal solution of set optimization problems under bounded rationality via improvement set. Furthermore, the sufficient condition of well-posedness is given by using a bounded rationality model. Besides, we obtain the characterization of (generalized) Levitin-Polyak well-posedness for the problem by utilizing nonlinear analysis method. These results have laid a solid theoretical foundation for the application of E-commerce in practical life.展开更多
文摘为求解高维优化问题,提出基于反向学习和衰减因子的灰狼优化算法(grey wolf algorithm based on opposition learning and reduction factor,ORGWO).设计一种灰狼反向学习模型,模型考虑问题搜索边界信息和种群历史搜索信息,初始种群阶段增加反向学习,增强种群多样性.根据算法各个阶段不同特征引入衰减因子,平衡全局和局部勘探能力.选取8个高维函数和23个不同特征的优化函数对算法性能进行测试,进一步使用收敛性分析,寻优成功率,CPU时间,Wilcoxon秩和检验来评估改进算法,实验结果表明,ORGWO算法在求解高维问题上具有较好的精度,鲁棒性和更快的收敛速度.
文摘在许多经济模型中,决策者需要通过比较集值优化问题的目标函数来衡量支出以达到自身收益的最大。在电子商务视角下,本文讨论了有限理性下基于改进集的集合优化问题E-u-最小解集的Levitin-Polyak良定性和广义Levitin-Polyak良定性,并通过有限理性模型证明了该良定性的充分条件。此外,借助非线性分析的方法给出了集合优化问题(广义) Levitin-Polyak良定性的特征刻画。这些结果为电子商务在实际生活中的应用打下了夯实的理论基础。In many economic models, decision-makers need to measure expenditures by comparing the objective functions of set-valued optimization problems in order to achieve maximum benefit. Under the perspective of E-commerce, this paper studies the Levitin-Polyak well-posedness and generalized Levitin-Polyak well-posedness of E-u-minimal solution of set optimization problems under bounded rationality via improvement set. Furthermore, the sufficient condition of well-posedness is given by using a bounded rationality model. Besides, we obtain the characterization of (generalized) Levitin-Polyak well-posedness for the problem by utilizing nonlinear analysis method. These results have laid a solid theoretical foundation for the application of E-commerce in practical life.
