最大最小蚁群算法
最大最小蚁群算法的相关文献在2007年到2022年内共计62篇,主要集中在自动化技术、计算机技术、经济计划与管理、电工技术
等领域,其中期刊论文57篇、会议论文2篇、专利文献67973篇;相关期刊43种,包括人天科学研究、管理科学学报、运筹与管理等;
相关会议2种,包括第九届中国系统建模与仿真技术高层论坛、湖北省机械工程学会第十六届机械设计与传动学术年会等;最大最小蚁群算法的相关文献由151位作者贡献,包括刘志中、万春霆、万杰等。
最大最小蚁群算法—发文量
专利文献>
论文:67973篇
占比:99.91%
总计:68032篇
最大最小蚁群算法
-研究学者
- 刘志中
- 万春霆
- 万杰
- 于海平
- 何琳
- 刘磊振
- 吴隽
- 孙静
- 张洁
- 方洁
- 李亚龙
- 李文锋
- 杨艳霞
- 檀斌
- 毛晓明
- 汪定伟
- 潘丹
- 王伟
- 王永忠
- 祁宁
- 罗安
- 胡俊杰
- 董攀
- 蔡永智
- 薛霄
- 许川佩
- 贺德强
- 赵勇
- 邓建新
- 陈定方
- 陈阳
- 高慧明
- 黄德所
- 乐意
- 于信尧
- 付华
- 何荣军
- 俞德华
- 关启明
- 冼学辉
- 刘光远
- 刘升
- 刘希玉
- 刘旗扬
- 刘晋西
- 刘沙
- 刘洋
- 刘红军
- 卢淑娟
- 吴佩雯
-
-
-
-
-
何荣军;
杜运夯;
吴再生
-
-
摘要:
水力坡度是粉煤灰膏体井下处理系统设计的重要参数,决定着能耗大小和运行成本.为掌握水力坡度的精确结果,将最大最小蚁群算法(MMAS)和BP神经网络结合应用于水力坡度的预测中,建立了水力坡度预测模型.经实践应用表明,该预测模型具有最大最小蚁群算法的快速收敛和全局性,又具有BP神经网络强大的映照效果,预测结果完全满足实际应用需要.
-
-
贺德强;
罗安;
邓建新;
谭文举
-
-
摘要:
针对列车转向架关键部件的预防性维修存在欠维修或过维修问题,提出一种列车转向架关键部件预防性维修决策优化模型.该模型以关键部件故障周期为优化变量,基于不同的维修模式和最小修形式确定机会维修期望概率.借鉴机会维修思想,利用最大最小蚁群迭代算法,确定关键部件的最佳维修周期与机会维修阈值,以最小平均费用率为优化目标,最终达到降低预防性维修固定维修成本的目的.以某地铁公司列车转向架关键部件维修为例,通过对比分析证明,该模型能够有效降低转向架关键部件的运营维修费用,减少列车在库停车检修次数,提高列车运营效率,从而为轨道交通装备的维修决策提供理论和实践参考.%To solve over or less repair for preventive maintenance of train bogie key components,an optimal decision model for preventive maintenance of train bogie key components was proposed.Based on the different maintenance mode and the minimum repair form,the model used the key component failure cycle as the optimization variable to determine the opportunity for maintaining the expected probability.On the basis of opportunity maintenance idea,the maximum and minimum ant colony iterative algorithm was used to determine the optimal maintenance cycle and opportunistic maintenance threshold of key components.With the minimum average cost rate as the optimization target,the maintenance of fixed maintenance costs was reduced ultimately.By taking the key parts maintenance of train bogie of a subway company as an example,the model could effectively reduce the operation and maintenance costs of bogie's key components,reduce the number of train parking in the depot and improve the train operation efficiency,which could provide theoretical and practical reference for the maintenance decision of rail transit equipment.
-
-
袁汪凰;
游晓明;
刘升;
朱艳
-
-
摘要:
针对蚁群算法易陷入局部最优,收敛速度较慢的问题,在最大-最小蚁群算法的基础上,提出一种自适应模拟退火蚁群算法.在高温阶段以一定概率接受次优解,优化每次迭代后的路径,增加算法的全局搜索能力,并采用一种自适应的信息素更新策略,前期增加算法的全局搜索能力,后期加快算法的收敛速度;在低温阶段通过降温系数的取值,加快算法收敛速度,在温度机制上采用了回火机制,避免局部最优,使解的质量得到了提高.同时在算法中结合了3opt进一步优化了算法解的质量.实验结果表明该算法的收敛速度以及求解质量得到了一定程度的改善,较好地平衡了种群多样性以及收敛速度的关系.%Aiming at the problem that the ant colony algorithm is easy to fall into the local optimum and the convergence speed is slow,an adaptive simulated annealing ant colony algorithm was proposed based on the maximum -minimum ant colony algorithm.The algorithm accepted the difference solution with a certain probability at a high temperature.The path was optimized after each iteration.The global search ability of the algorithm was increased,and an adaptive pheromone updating strategy was adopted.The global search ability of the algorithm was increased in the early stage and accelerated the convergence speed of the algorithm in the later stage.In the low temperature stage, the speed of the algorithm was accelerated by the value of the temperature coefficient, and then the tempering mechanism was adopted to avoid the local optimum.The quality of the solution was improved.At the same time,the 3opt algorithm was used to further optimize the quality of the algorithm.The experimental results showed that the convergence speed and the solution quality of the proposed algorithm had been improved to a certain extent,and it could balance the relationship between population diversity and convergence rate.
-
-
方洁
-
-
摘要:
最大最小蚁群算法通过对信息素更新和限制的改进,有效提高收敛速度,但难以避免出现停滞并陷入局部最优的困境.基于贪心边的MMAS改进算法规定一种新的搜索停滞状态,设定不同等级贪心边,并在停滞状态下利用搜索过程中寻找到的贪心边进行优先搜索.该算法使搜索能够尽早地集中在有效边进行,丢弃"无用"搜索,提高发现更优路径的可能性.利用TSP标准实例进行测试,结果表明改进算法的最优解更加接近实际最优解,具有更高的全局寻优能力和更快的收敛速度.
-
-
方洁
-
-
摘要:
最大最小蚁群算法通过对信息素更新和限制的改进,有效提高收敛速度,但难以避免出现停滞并陷入局部最优的困境。基于贪心边的MMAS改进算法规定一种新的搜索停滞状态,设定不同等级贪心边,并在停滞状态下利用搜索过程中寻找到的贪心边进行优先搜索。该算法使搜索能够尽早地集中在有效边进行,丢弃"无用"搜索,提高发现更优路径的可能性。利用TSP标准实例进行测试,结果表明改进算法的最优解更加接近实际最优解,具有更高的全局寻优能力和更快的收敛速度。
-
-
杨福兴;
张琪
-
-
摘要:
传统物流配送车辆调度研究存在目标单一,约束条件考虑有限,路径规划不合理等问题,不利于实际应用.调度优化可有效节约资源,提升企业运营效益.为了降低配送车辆的距离和时间总成本,提高求解算法的效率和精度,提出一种适用型整数规划模型和改进型最大最小蚁群算法.首先建立了针对时变环境、带时间窗、限制车辆容量等约束条件的车辆优化调度模型,采用结合时变策略的改进型最大最小蚁群算法求解调度模型,并给出了具体实现流程.以Solomon测试集对算法性能进行测试,仿真结果表明,改进型最大最小蚁群算法具有较高的求解精度和收敛速度,适用型模型及算法实用地、有效地优化了物流配送车辆的调度问题.%Traditional vehicle scheduling problem is single-goaled with limited constraint conditions,which is not beneficial to practical application.Intelligent dispatching of vehicles can conserve resources effectively and promote benefit.In order to lower total cost of distance and time and increase efficiency and accuracy of algorithm,we proposed a suitable integer programming model and an improved max-min ant colony system algorithm.The research is aiming at constraint conditions such as time-dependent environment,time windows and capacity limitation.Firstly,this paper abstracted critical factors and put forward a targeted mathematical model.Secondly,we presented an improved max-min ant colony system algorithm with temporal change strategy.Finally,we adopted Solomon set to test the algorithm.Simulations reveal that the improved method has better performance in solving accuracy and convergence rate.The model and algorithm optimize logistic vehicle scheduling problem practically and effectively.
-
-
詹长书;
李正娇
-
-
摘要:
根据鲜活农产品"易腐"等自身特点、客户的消费特点以及目前鲜活农产品配送中存在的问题,基于VRP理论,构建物流配送路径优化模型,应用改进的蚁群算法对模型进行求解,满足顾客对时间、质量的要求,降低配送成本,提高顾客满意度.%In this paper, in view of the characteristics of fresh farm produce, such as being perishable, the property of consumer behavior and the existing problems in the distribution of fresh farm produce at current stage, we built the corresponding logistics distribution route optimization model based on the VRP theory and solved it using the improved ant algorithm so as to meet the consumer's requirement for time and quality, lower distribution cost and improve customer satisfaction.
-
-
高慧明;
王永忠;
黄德所
- 《第九届中国系统建模与仿真技术高层论坛》
| 2014年
-
摘要:
针对某防空旅没有建立弹药配送模型的问题,作者通过实地调研,获得第一手数据的基础上,建立了弹药配送模型.然后根据问题特点采取了最大最小蚁群算法(MMAS),进行了求解.通过算例证明了算法的有效性,本研究对某防空旅战时弹药配送、减少资源消耗、降低被侦察的概率等方面具有实际意义.
-