首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 109 毫秒
1.
针对当前基本粒子群算法无人机航迹规划在后期收敛速度比较慢、效率不高、易陷入局部最优等问题,提出一种改进粒子群算法。首先,在迭代前期和后期分段设置惯性权值的调整,实现粒子惯性和寻优行为的平衡;其次,设置一个定值与相邻2次适应度函数最优值比较策略,防止陷入局部最优;最后,引入遗传算法的交叉、变异机制,得出更优的结果。并通过仿真验证了改进粒子群算法在三维空间航迹规划的有效性和可行性。结果表明,与其他航迹规划算法相比,新算法具有路径长度更短、耗时更少、路径更平滑等优点,加快了收敛速度,提高了航迹规划效率和稳定性。因此,改进算法的航迹规划可得到满足约束关系的最优航迹,对实现自主飞行有重要的参考价值。  相似文献   

2.
为了解决传统粒子群算法(PSO)容易“早熟”、陷入局部最优以及灰狼算法(GWO)收敛速度慢的问题。首先,采用GWO算法的个体极值更新策略来实现个体包围式向最优值趋近,融入PSO算法的速度更新策略来实现群体向最优值的趋近,并且在原始粒子群算法基础上加入线性惯性权重递减来提高算法的收敛速度,从而提出了一种基于灰狼算法和改进的粒子群算法(IPSO)的融合优化算法(GW-IPSO);其次,通过6个经典算例进行仿真试验,将融合算法与PSO算法、IPSD算法、灰狼和粒子群结合算法(GW-PSO)进行对比;最后,应用融合算法对二级直线倒立摆的控制器设计进行参数寻优。结果表明:针对6个标准测试函数,混合算法的30次试验结果平均值更接近最优值,且标准差几乎都是最小的;应用在倒立摆控制问题上,系统在5 s左右进入稳定状态。融合后的GW-IPSO算法能够在一定程度上避免早熟和陷入局部极值的问题发生,并且能够很好地应用于控制器设计过程中参数寻优问题。  相似文献   

3.
本文以高端物流服务集成商与库存配送服务商为研究对象,以集成商的供应链网络成本最小、服务商的运营成本最小且准时制供应为目标,深入研究考虑碳限额、碳交易机制以及残次品处理的多供应商选择多产品多阶段库存配送问题,构建了基于动态规划的双层库存配送模型。利用双层全局--局部--邻域粒子群算法 (Bi-GLNPSO) 设计了模型求解方案,并通过算例验证了模型和算法的有效性和合理性。探讨了碳限额和碳交易机制对总成本和库存配送决策的影响。  相似文献   

4.
针对基础设施效益模糊、难以度量的特点,结合模糊集理论,建立了模糊投资组合优化模型,改进粒子群算法,加入混沌思想,使用混沌粒子群算法(CPSO)求解基础设施的模糊投资组合优化模型。以4个城市投资公司的数据为样本,验证该方法的科学性与有效性。研究结果表明:模糊投资组合优化模型可较好地表征基础设施的模糊效益,提高基础设施投资决策的科学性;混沌寻优思想改进的粒子群算法可求得模糊投资组合优化模型的全局最优解,增强算法的鲁棒性。  相似文献   

5.
APSO-BP算法可实现粒子群优化的自动调整,解决传统粒子群优化算法收敛性较差,局部易出现极小值的局限,文章引入APSO-BP算法对辽宁某水库生态调度进行优化计算。研究结果表明:APSO-BP算法的收敛精度和全局优化搜索能力都好于传统粒子群优化算法,经APSO-BP算法优化下的水库生态调度可以满足流域的生态蓄水,流域最小生态需水满足度达到75%,适宜生态需水满足度达到66.7%,生态优化调度结果明显好于传统粒子群优化算法。APSO-BP算法可用于水库生态优化调度。研究成果对于水库生态调度方案以及区域生态蓄水规划配置提供方法参考。  相似文献   

6.
提出一种基于粒子群算法的流水工序调度任务优化模型。利用流水工序调度任务的特点得到流水工序时间约束条件,利用粒子群算法的原理建立流水工序调度任务优化模型,利用粒子群算法对模型进行求解。仿真实验表明,利用该算法能够得到流水工序调度问题的最优解,提高生产效率。  相似文献   

7.
传统的网络计划(CPM/PERT)默认项目实施所需资源已合理投入,并就此安排各项工作。由于该技术传递信息量较少,不利于项目群资源共享。文章通过对工程项目群工期、成本、管理资源分析,提出基于粒子群算法的项目群网络计划优化模型,引入柯布-道格拉斯生产函数完善目标函数,并以某区域管道铺设工程为例开展实例研究,为今后项目群管理提供参考与借鉴。  相似文献   

8.
传统的安全投入模型对解决高危行业领域中模糊复杂的安全投入问题具有一定局限性,尤其当建立目标函数时,采用隐含线性关系假设的函数进行拟合会影响模型的推广能力。基于此,本文首先采用支持向量回归机(SVR)建立事故损失模型,与传统C-D函数拟合结果相比,该模型具有更好的预测能力;然后,以实际安全投入要求为约束,以安全总成本最小化为原则建立企业安全投入优化模型;最后,采用基于捕食搜索策略的粒子群算法对模型进行求解,同时,为保证全局收敛性,引入自适应控制策略对算法进行了改进。结果表明:该模型能够更加准确地描述安全投入与安全成本间的非线性作用关系,并通过粒子群寻优得到具备可行性的全局最优解,为高危行业企业安全投入结构优化提供新的决策思路。  相似文献   

9.
为了研究网络表示学习在社交网络中链路预测方面的应用,提出了一种基于骨干度与网络编码的链路预测模型(BDLINE)。在网络表示学习算法LINE的基础上融入骨干度算法,通过给一阶相似度和二阶相似度中增添骨干权重,将网络编码到多维向量空间中,调试到最优参数。实验采用2个真实数据的数据集,分别在不同的算法模型上进行多次实验。实验结果表明:在链路预测方面,BDLINE均比其他网络表示学习算法的性能有所提升,AUC评测值更高,预测效果表现得更好。因此,所提出的方法可以方便地提取网络特征信息,更好地处理社交网络在链路预测中的随机性,对社交网络中预测网络节点的关联性和有效性具有一定的参考。  相似文献   

10.
为解决重力坝结构优化设计中数值模拟计算量大、设计效率低下的不足,文章使用PCE法建立近似模型代替数值模拟试验,经过检验所建立的模型精度较高满足工程设计要求;使用改进粒子群算法避免了该算法容易获取局部最优值的弊端,对重力坝结构进行优化设计,优化后的断面面积减小7. 1%,且安全系数为6. 51满足工程安全要求。  相似文献   

11.
针对无线传感器网络分簇算法中能量分布不均衡导致的"热区"和簇头负载过重问题,提出了一种基于PSO算法优化簇头选举的非均匀分簇算法。在候选簇头选举和竞争半径计算过程中综合考虑节点动态能量、节点密度和节点距基站距离,将网络进行非均匀分簇,并引入PSO算法进行最终簇头选举。根据节点能量、节点密度和距基站距离确定簇间单跳多跳结合的路由规则,选取代价函数小的节点作为下一跳节点。基于节点信息熵确定融合阈值,进行簇内数据融合剔除冗余数据。仿真结果表明,改进算法的数据传输量比EEUC算法和UCRA算法分别提高了20%和10%,提升了数据的融合效率,有效延长了网络生命周期,簇头能量消耗得到均衡,减少了网络能量消耗,网络的整体性能显著优于其他对比算法。  相似文献   

12.
This paper addresses multi-objective (MO) optimization of a single-model assembly line balancing problem (ALBP) where the operation times of tasks are unknown variables and the only known information is the lower and upper bounds for operation time of each task. Three objectives are simultaneously considered as follows: (1) minimizing the cycle time, (2) minimizing the total equipment cost, and (3) minimizing the smoothness index. In order to reflect the real industrial settings adequately, it is assumed that the task time is dependent on worker(s) (or machine(s)) learning for the same or similar activity and sequence-dependent setup time exists between tasks. Finding an optimal solution for this complicated problem especially for large-sized problems in reasonable computational time is cumbersome. Therefore, we propose a new solution method based on the combination of particle swarm optimization (PSO) algorithm with variable neighborhood search (VNS) to solve the problem. The performance of the proposed hybrid algorithm is examined over several test problems in terms of solution quality and running time. Comparison with an existing multi-objective evolutionary computation method in the literature shows the superior efficiency of our proposed PSO/VNS algorithm.  相似文献   

13.
This article presents an artificial intelligence-based solution to the problem of product line optimization. More specifically, we apply a new hybrid particle swarm optimization (PSO) approach to design an optimal industrial product line. PSO is a biologically-inspired optimization framework derived from natural intelligence that exploits simple analogues of collective behavior found in nature, such as bird flocking and fish schooling. All existing product line optimization algorithms in the literature have been so far applied to consumer markets and product attributes that range across some discrete values. Our hybrid PSO algorithm searches for an optimal product line in a large design space which consists of both discrete and continuous design variables. The incorporation of a mutation operator to the standard PSO algorithm significantly improves its performance and enables our mechanism to outperform the state of the art Genetic Algorithm in a simulated study with artificial datasets pertaining to industrial cranes. The proposed approach deals with the problem of handling variables that can take any value from a continuous range and utilizes design variables associated with both product attributes and value-added services. The application of the proposed artificial intelligence framework yields important implications for strategic customer relationship and production management in business-to-business markets.  相似文献   

14.
This article addresses the particle swarm optimization (PSO) method. It is a recent proposed algorithm by Kennedy and Eberhart [1995. Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks (Perth, Australia), vol. IV, IEEE Service Center, Piscataway, NJ, pp. 1942–1948]. This optimization method is motivated by social behaviour of organisms such as bird flocking and fish schooling. PSO algorithm is not only a tool for optimization, but also a tool for representing socio-cognition of human and artificial agents, based on principles of social behaviour. Some scientists suggest that knowledge is optimized by social interaction and thinking is not only private but also interpersonal. PSO as an optimization tool, provides a population-based search procedure in which individuals called particles change their position (state) with time. In a PSO system, particles fly in a multidimensional search space. During flight, each particle adjusts its position according to its own experience, and according to the experience of neighbours, making use of the best position encountered by itself and its neighbours. In this paper, we propose firstly, an extension of the PSO system that integrates a new displacement of the particles (the balance between the intensification process and the diversification process) and we highlight a relation between the coefficients of update of each dimension velocity between the classical PSO algorithm and the extension. Secondly, we propose an adaptation of this extension of PSO algorithm to solve combinatorial optimization problem with precedence constraints in general and resource-constrained project scheduling problem in particular. The numerical experiments are done on the main continuous functions and on the resource-constrained project scheduling problem (RCPSP) instances provided by the psplib. The results obtained are encouraging and push us into accepting than both PSO algorithm and extensions proposed based on the new particles displacement are a promising direction for research.  相似文献   

15.
Making accurate accept/reject decisions on dynamically arriving customer requests for different combinations of resources is a challenging task under uncertainty of competitors' pricing strategies. Because customer demand may be affected by a competitor's pricing action, changes in customer interarrival times should also be considered in capacity control procedures. In this article, a simulation model is developed for a bid price–based capacity control problem of an airline network revenue management system by considering the uncertain nature of booking cancellations and competitors' pricing strategy. An improved bid price function is proposed by considering competitors' different pricing scenarios that occur with different probabilities and their effects on the customers' demands. The classical deterministic linear program (DLP) is reformulated to determine the initial base bid prices that are utilized as control parameters in the proposed self-adjusting bid price function. Furthermore, a simulation optimization approach is applied in order to determine the appropriate values of the coefficients in the bid price function. Different evolutionary computation techniques such as differential evolution (DE), particle swarm optimization (PSO), and seeker optimization algorithm (SOA), are utilized to determine these coefficients along with comparisons. The computational experiments show that promising results can be obtained by making use of the proposed metaheuristic-based simulation optimization approach.  相似文献   

16.
针对移动机器人路径规划中的传统蚁群算法收敛精度低、易陷入局部最优等问题,提出一种改进蚁群算法。首先,对算法的转移概率进行改进,加入转向代价,减少不必要的转折,并针对启发函数启发性能不够强,对路径启发信息进行改进;然后,提出一种自适应的参数调整伪随机状态转移策略,动态改变参数值,避免过早陷入搜索停滞,增强搜索的全面性,同时对信息素更新方式进行改进,调整信息素挥发系数,保持蚂蚁发现最优路径的能力;最后,通过Matlab与其他算法进行对比分析。仿真结果表明,改进的蚁群算法收敛速度快,且路径长度和算法迭代次数有明显减少,能得到全局最优路径。改进蚁群算法具有可行性、有效性,在移动机器人路径规划中有一定的应用价值。  相似文献   

17.
分析了风电特性及分布式风电接入对配电网规划的影响;指出了含风电的配电网规划过程中需要分析风电随机性出力对整个配电网的影响,并通过对风电和负荷方式的采样,建立了基于机会约束的配电网规划模型;提出了一种基于随机邻域搜索的含风电配电网优化规划方法,模型求解结果验证了其可行性。  相似文献   

18.
This paper addresses the problem of multiprocessor task-scheduling in a hybrid flow shop (HFS) problem to minimize the makespan. Due to the complex nature of an HFS problem, it is decomposed into the following two sequential decision problems: determining the job permutation in stage 1, followed by a decoding method to assign jobs into each machine in subsequent stages when designing a heuristic algorithm. The decoding method plays a pivotal role for improving the solution quality of any algorithm for the HFS problem. However, the majority of existing algorithms ignores the problem and is only concerned with the first decision problem. This study emphasizes the importance of the decoding method via a small test, and searches for a number of solid decoding methods that can be incorporated into the cocktail decoding method. Then, this study develops a particle swarm optimization (PSO) algorithm that can be combined with the cocktail decoding method. In the PSO, a variety of job sequences are generated using the PSO procedure in stage 1, and the cocktail decoding method is used to assign the jobs to machines in sequential stages. Moreover, a modified lower bound is introduced. Computational results show that the proposed lower bound is competitive, and with the help of the cocktail decoding method, the proposed PSO, and even the adoption of a standard PSO framework, significantly outperforms the majority of existing algorithms in terms of quality of solutions, especially for large problems.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号