共查询到20条相似文献，搜索用时 93 毫秒
1.
《Information processing & management》2022,59(2):102854
As a recent swarm intelligence optimization algorithm, sparrow search algorithm (SSA) is widely adopted in many real-world problems. However, the solutions to the limitations of SSA (such as low accuracy of convergence and tendency of trapping into local optimum) are still not available. To address these issues, we propose an enhanced multi-strategies sparrow search algorithm (EMSSA) based on three strategies specifically addressing the limitations of SSA: 1) in the uniformity-diversification orientation strategy, we propose an adaptive-tent chaos theory to allow more diversity and greater randomness in the initial population; 2) in the hazard-aware transfer strategy, we construct a weighted sine and cosine algorithm based on the growth function to avoid trapping into the state of local optima stagnation; 3) in the dynamic evolutionary strategy, we design the similar perturbation function and introduce the triangle similarity theory to improve the exploration capability. The performance of EMSSA in solving the continuous optimization problems about the 23 benchmark functions, CEC2014, and CEC2017 problems is much improved than that of SSA and other state-of-the-art algorithms. Furthermore, the results of the density peak clustering optimization show that the EMSSA outperforms SSA. 相似文献
2.
本文针对标准人工蜂群算法开发能力较弱的缺点,借鉴粒子群算法的思想,将全局最优解引入,与引领蜂进行交叉操作,使蜂群进行有引导的探索,通过基准函数的测试,证明了改进后的算法性能有所提高。 相似文献
3.
在科技服务机构和科技服务大量增长以及用户需求日趋复杂化和链式化的背景下,向用户推荐满足其个性化要求的科技服务链成为亟需解决的问题.首先构建考虑服务特有属性的科技服务推荐模型,在NSGA-Ⅱ算法中引入去重操作以消除由于候选服务数量限制产生的重复服务链,提高算法的多样性和收敛性,并使用该算法对模型进行求解,得到一组Pareto最优服务链集.然后通过科技服务链评估函数对服务链进行排序,将最优综合科技服务链推荐给用户.实验结果表明改进的NSGA-Ⅱ算法求解出的满足服务需求方要求的解的数量和准确性均优于NSGA-Ⅱ算法. 相似文献
4.
蜂群优化算法在带软时间窗的车辆路径问题中的应用 总被引：1，自引：0，他引：1
本文给出了带软时间窗的车辆路径问题的一种新的算法,蜂群算法.通过计算若干benchmark问题,并将结果与硬时间窗的目前最好解及蚁群算法的相应解作比较与分析,验证了算法的有效性.蜂群算法是刚刚起步的智能优化算法,目前国内外关于蜂群算法的文献较少,研究范围较窄,故本文不仅是拓宽蜂群算法应用范围的有效尝试,同时也给本身求解方法不多的软时间窗车辆路径问题提供了一种新解决方法. 相似文献
5.
6.
A novel recommendation method based on social network using matrix factorization technique 总被引：1，自引：1，他引：0
Chonghuan Xu 《Information processing & management》2018,54(3):463-474
The rapid development of information technology and the fast growth of Internet have facilitated an explosion of information which has accentuated the information overload problem. Recommender systems have emerged in response to this problem and helped users to find their interesting contents. With increasingly complicated social context, how to fulfill personalized needs better has become a new trend in personalized recommendation service studies. In order to alleviate the sparsity problem of recommender systems meanwhile increase their accuracy and diversity in complex contexts, we propose a novel recommendation method based on social network using matrix factorization technique. In this method, we cluster users and consider a variety of complex factors. The simulation results on two benchmark data sets and a real data set show that our method achieves superior performance to existing methods. 相似文献
7.
针对传统协同过滤技术在图书推荐中效率不高、数据极端稀疏性及主观性强等问题,提出一种基于云填充和蚁群聚类的协同过滤图书推荐方法,首先根据蚁群聚类算法得到用户群分类,然后在进行协同过滤前预先通过云模型填充用户——项目矩阵,以降低数据的稀疏性。实验结果表明,该算法在推荐精度上有明显的提高。 相似文献
8.
Graph-based recommendation approaches use a graph model to represent the relationships between users and items, and exploit the graph structure to make recommendations. Recent graph-based recommendation approaches focused on capturing users’ pairwise preferences and utilized a graph model to exploit the relationships between different entities in the graph. In this paper, we focus on the impact of pairwise preferences on the diversity of recommendations. We propose a novel graph-based ranking oriented recommendation algorithm that exploits both explicit and implicit feedback of users. The algorithm utilizes a user-preference-item tripartite graph model and modified resource allocation process to match the target user with users who share similar preferences, and make personalized recommendations. The principle of the additional preference layer is to capture users’ pairwise preferences, provide detailed information of users for further recommendations. Empirical analysis of four benchmark datasets demonstrated that our proposed algorithm performs better in most situations than other graph-based and ranking-oriented benchmark algorithms. 相似文献
9.
Helem Sabina Sánchez Antonio Visioli Ramon Vilanova 《Journal of The Franklin Institute》2017,354(10):3945-3970
In this paper, we propose tuning rules for one degree-of-freedom proportional-integral-derivative controllers, by considering important aspects such as the trade-off in the performance in the servo and regulation operation modes and the control system robustness by constraining the maximum sensitivity peak. The different conflicting objectives are dealt with by using a multi-objective optimization algorithm to generate the trade-off optimal solutions. In this context, a simple tuning rule is determined by using the Nash solutions as a multi-criteria decision making technique. The Nash criteria is shown to provide convenient trade-off solutions for the controller tuning problem. Illustrative simulation examples show the effectiveness of the method. 相似文献
10.
《Information processing & management》2023,60(1):103123
Aligning time series of different sampling rates is an important but challenging task. Current commonly used dynamic time warping methods usually suffer from pathological temporal singularity problem. In order to overcome this, we transform the alignment task to a spatial-temporal multi-objective optimization (MOO) problem. Existing MOO algorithms are always inefficient in finding Pareto optimal alignment solutions due to their insufficiency in maintaining convergence and diversity among the obtained Pareto solutions. In light of this, we propose a novel and efficient MOO algorithm Cell-MOWOA which integrates Cellular automata with the rising Whale Optimization Algorithm to find Pareto optimal alignment solutions. Innovative multi-variate non-linear cell state evolutionary rules are designed within Pareto solution external archive to improve the convergence and diversity of the Pareto solutions, and novel whale population updating mechanism is designed to accelerate the convergence to the Pareto front. Besides, new integer whale updating mechanism is presented to transform real-number whale solutions to integer whale solutions. Experimental results on 85 gold-standard UCR time series datasets showed that Cell-MOWOA outperformed six state-of-the-art baselines by 24.53% in average in increasing alignment accuracy and 42.66% in average in reducing singularity. Besides, it achieved outstanding runtime efficiency, especially on long time series datasets. 相似文献
11.
[研究目的]现有科技服务平台中科技服务资源数量指数级增长、服务质量多样化,以及企业用户需求难以量化。为解决科技服务平台企业用户与服务资源间的精准匹配问题,提出一种基于企业用户需求的科技服务资源综合推荐算法(EURSTS)。[研究方法]综合考虑科技服务特殊属性和企业背景信息,采用模糊模型量化信息和综合相似度求解,对企业用户和科技服务资源进行匹配推荐。[研究结论]通过与CB算法、基于服务QoS算法的对比说明EURSTS算法能显著的改善推荐效果,其准确率平均提升了30.1%~37.1%,召回率平均提升了0.1%~7.9%,验证了该算法的有效性。 相似文献
12.
提出建设项目决策中的工期—成本—碳排放平衡问题,并建立多目标决策模型,提出求解算法。提出的改进自适应性混和遗传算法可求解该多目标优化问题,设计单点交叉和变异的修复式策略来避免不可行解的产生。通过锦屏二级水电建设项目的案例说明模型和算法的有效性和合理性,通过灵敏度分析以及与其他算法的比较说明该优化方法的高效性、灵活性和适应性。结果表明,降低待工时间、提高使用效率是降低碳排放的关键因素,揭示碳排放和成本、进度间的变化机理;结果可产生多个帕累托最优解;决策者可根据三个目标的偏好选择最终方案。 相似文献
13.
细菌觅食算法在求解水库优化调度问题时,以固定的步长进行趋向操作,同时以固定概率对细菌个体进行随机驱散操作,虽然可以一定程度上增加种群多样性,但是在进化后期容易使优秀的个体流失,影响算法的寻优质量。针对该问题,文章提出步长自适应调整和驱散概率自适应调整两项改进策略,根据算法进化程度和细菌个体的能量值动态调整趋向操作的步长和驱散操作的概率,使算法进化过程中尽量保证种群多样性的基础上,提高细菌个体的觅食能力,进一步促进算法达到局部搜索和全局优化之间的平衡。将改进的细菌觅食算法应用于乌江梯级水库群的联合优化调度问题,模拟结果表明:改进细菌觅食算法具有较强的全局寻优能力,适合求解梯级水库联合优化调度问题。 相似文献
14.
针对PID控制器在不同的应用系统,需要动态调整PID控制参数的问题,提出了基于遗传算法的PID自适应参数优化方案。该方案通过将PID控制器产生的误差作为目标函数,利用遗传算法实现对PID控制器参数的自动调整。为了提高参数的优化效率,文章通过对交叉算子和变异算子的自适应处理,提高了PID控制器的性能。实验测试表明,文章设计的PID参数优化策略比普通的基于遗传算法优化策略效率平均高14.7%。 相似文献
15.
A recommender system has an obvious appeal in an environment where the amount of on-line information vastly outstrips any individual’s capability to survey. Music recommendation is considered a popular application area. In order to make personalized recommendations, many collaborative music recommender systems (CMRS) focus on capturing precise similarities among users or items based on user historical ratings. Despite the valuable information from audio features of music itself, however, few studies have investigated how to utilize information extracted directly from music for personalized recommendation in CMRS. In this paper, we describe a CMRS based on our proposed item-based probabilistic model, where items are classified into groups and predictions are made for users considering the Gaussian distribution of user ratings. In addition, this model has been extended for improved recommendation performance by utilizing audio features that help alleviate three well-known problems associated with data sparseness in collaborative recommender systems: user bias, non-association, and cold start problems in capturing accurate similarities among items. Experimental results based on two real-world data sets lead us to believe that content information is crucial in achieving better personalized recommendation beyond user ratings. We further show how primitive audio features can be combined into aggregate features for the proposed CRMS and analyze their influences on recommendation performance. Although this model was developed originally for music collaborative recommendation based on audio features, our experiment with the movie data set demonstrates that it can be applied to other domains. 相似文献
16.
[目的/意义]通过融合用户社交与情境信息,构建虚拟知识社区个性化知识推荐模型并开展个性化知识推荐算法的设计,能够在一定程度上完善虚拟知识社区个性化知识推荐方法的理论体系,具有一定的理论价值和应用价值。[方法/过程]首先构建出基于用户社交与情境信息的虚拟知识社区个性化知识推荐模型,然后利用改进的最大团算法设计出虚拟知识社区个性化知识推荐算法,最后通过选取某虚拟知识社区的用户数据进行实例分析实现精准的个性化知识推荐。[结果/结论]在利用融合用户社交与情境信息进行虚拟知识社区个性化知识推荐过程中,通过对某虚拟知识社区的实例分析,表明其个性化知识推荐结果的精准度得到了显著的提升。 相似文献
17.
Financial decisions are often based on classification models which are used to assign a set of observations into predefined groups. Different data classification models were developed to foresee the financial crisis of an organization using their historical data. One important step towards the development of accurate financial crisis prediction (FCP) model involves the selection of appropriate variables (features) which are relevant for the problems at hand. This is termed as feature selection problem which helps to improve the classification performance. This paper proposes an Ant Colony Optimization (ACO) based financial crisis prediction (FCP) model which incorporates two phases: ACO based feature selection (ACO-FS) algorithm and ACO based data classification (ACO-DC) algorithm. The proposed ACO-FCP model is validated using a set of five benchmark dataset includes both qualitative and quantitative. For feature selection design, the developed ACO-FS method is compared with three existing feature selection algorithms namely genetic algorithm (GA), Particle Swarm Optimization (PSO) algorithm and Grey Wolf Optimization (GWO) algorithm. In addition, a comparison of classification results is also made between ACO-DC and state of art methods. Experimental analysis shows that the ACO-FCP ensemble model is superior and more robust than its counterparts. In consequence, this study strongly recommends that the proposed ACO-FCP model is highly competitive than traditional and other artificial intelligence techniques. 相似文献
18.
针对现有水资源配置模型存在的不精确问题,在现有水资源模型基础上增加了决策偏好系数和排放污染物种类以提高模型精确性,以吉林市水资源基础数据初始化水资源优化配置模型,针对目前对模型进行优化的粒子群算法易出现局部最优等情况,引入萤火虫算法对其进行改进,通过萤火虫趋向最优解的原理改善粒子群算法出现局部最优的情况,并加速其收敛速度。应用改进粒子群算法对模型进行优化求解,得出水资源优化配置方案,以满足经济效益、社会效益、生态环境效益的全面要求。 相似文献
19.
