期刊文献+
共找到2,320篇文章
< 1 2 116 >
每页显示 20 50 100
Using genetic/simulated annealing algorithm to solve disassembly sequence planning 被引量:5
1
作者 Wu Hao Zuo Hongfu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2009年第4期906-912,共7页
Disassembly sequence planning (DSP) plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassem... Disassembly sequence planning (DSP) plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient. 展开更多
关键词 disassembly sequence planning disassembly hybrid graph connection matrix precedence matrix binary-tree algorithms simulated annealing algorithm genetic algorithm.
在线阅读 下载PDF
Simulated annealing algorithm for the optimal translation sequence of the jth agent in rough communication 被引量:5
2
作者 Wang Hongkai Guan Yanyong Xue Peijun 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第3期507-512,共6页
In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a le... In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness. 展开更多
关键词 rough sets rough communication translation sequence OPTIMAL simulated annealing algorithm.
在线阅读 下载PDF
Simulated annealing algorithm for detecting graph isomorphism 被引量:4
3
作者 Geng Xiutang Zhang Kai 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第5期1047-1052,共6页
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem (GIP) is a nondeterministic polynomial problem. A simulated annea... Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem (GIP) is a nondeterministic polynomial problem. A simulated annealing (SA) algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability. 展开更多
关键词 graph isomorphism problem simulated annealing algorithm nondeterministic polynomial problem local search.
在线阅读 下载PDF
Parametric optimization and performance comparison of organic Rankine cycle with simulated annealing algorithm 被引量:3
4
作者 王志奇 周乃君 +2 位作者 张家奇 郭静 王晓元 《Journal of Central South University》 SCIE EI CAS 2012年第9期2584-2590,共7页
Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle (ORC). Working fluids considered were R123,... Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle (ORC). Working fluids considered were R123, R134a, R141b, R227ea and R245fa. Under the given conditions, the parameters including evaporating and condensing pressures, working fluid and cooling water velocities were optimized by simulated annealing algorithm. The results show that the optimal evaporating pressure increases with the heat source temperature increasing. Compared with other working fluids, R123 is the best choice for the temperature range of 100--180℃ and R141 b shows better performance when the temperature is higher than 180 ℃. Economic characteristic of system decreases rapidly with the decrease of heat source temperature. ORC system is uneconomical for the heat source temperature lower than 100℃. 展开更多
关键词 parametric optimization organic Rankine cycle simulated annealing algorithm working fluid low-temperature source
在线阅读 下载PDF
Classification of hyperspectral remote sensing images based on simulated annealing genetic algorithm and multiple instance learning 被引量:3
5
作者 高红民 周惠 +1 位作者 徐立中 石爱业 《Journal of Central South University》 SCIE EI CAS 2014年第1期262-271,共10页
A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning (MIL). The band selection method was proposed from subspace decom... A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning (MIL). The band selection method was proposed from subspace decomposition, which combines the simulated annealing algorithm with the genetic algorithm in choosing different cross-over and mutation probabilities, as well as mutation individuals. Then MIL was combined with image segmentation, clustering and support vector machine algorithms to classify hyperspectral image. The experimental results show that this proposed method can get high classification accuracy of 93.13% at small training samples and the weaknesses of the conventional methods are overcome. 展开更多
关键词 hyperspectral remote sensing images simulated annealing genetic algorithm support vector machine band selection multiple instance learning
在线阅读 下载PDF
Forecasting of wind velocity:An improved SVM algorithm combined with simulated annealing 被引量:2
6
作者 刘金朋 牛东晓 +1 位作者 张宏运 王官庆 《Journal of Central South University》 SCIE EI CAS 2013年第2期451-456,共6页
Accurate forecasting of wind velocity can improve the economic dispatch and safe operation of the power system. Support vector machine (SVM) has been proved to be an efficient approach for forecasting. According to th... Accurate forecasting of wind velocity can improve the economic dispatch and safe operation of the power system. Support vector machine (SVM) has been proved to be an efficient approach for forecasting. According to the analysis with support vector machine method, the drawback of determining the parameters only by experts' experience should be improved. After a detailed description of the methodology of SVM and simulated annealing, an improved algorithm was proposed for the automatic optimization of parameters using SVM method. An example has proved that the proposed method can efficiently select the parameters of the SVM method. And by optimizing the parameters, the forecasting accuracy of the max wind velocity increases by 34.45%, which indicates that the new SASVM model improves the forecasting accuracy. 展开更多
关键词 wind velocity forecasting improved algorithm simulated annealing support vector machine
在线阅读 下载PDF
Optimal control of cobalt crust seabedmining parameters based on simulated annealing genetic algorithm 被引量:2
7
作者 夏毅敏 张刚强 +2 位作者 聂四军 卜英勇 张振华 《Journal of Central South University》 SCIE EI CAS 2011年第3期650-657,共8页
Under the condition of the designated collection ratio and the interfused ratio of mullock, to ensure the least energy consumption, the parameters of collecting head (the feed speed, the axes height of collecting hea... Under the condition of the designated collection ratio and the interfused ratio of mullock, to ensure the least energy consumption, the parameters of collecting head (the feed speed, the axes height of collecting head, and the rotate speed) are chosen as the optimized parameters. According to the force on the cutting pick, the collecting size of the cobalt crust and bedrock and the optimized energy consumption of the collecting head, the optimized design model of collecting head is built. Taking two hundred groups seabed microtopography for grand in the range of depth displacement from 4.5 to 5.5 era, then making use of the improved simulated annealing genetic algorithm (SAGA), the corresponding optimized result can be obtained. At the same time, in order to speed up the controlling of collecting head, the optimization results are analyzed using the regression analysis method, and the conclusion of the second parameter of the seabed microtopography is drawn. 展开更多
关键词 cobalt crust mining parameter specific energy consumption simulated annealing genetic algorithm
在线阅读 下载PDF
Time -Sharing Power Supply Optimal Decision forElectrolytic Deposition Process of Zinc Based onSimulated Annealing Algorithm
8
作者 Huang Taisong Gui Weihua +1 位作者 Wang Yalin Yang Chunhua 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2000年第4期43-50,共8页
According to time-sharing valuation principle (TSVP) of power supply, the relationships of current density and current efficiency at different acidities are obtained based on the processed data of electrolytic deposit... According to time-sharing valuation principle (TSVP) of power supply, the relationships of current density and current efficiency at different acidities are obtained based on the processed data of electrolytic deposition process of zinc (EDPZ) with the least square method (LSM). Thus an optimal model of time-sharing power supply system for EDPZ is established, which has been optimized by use of an improved efficient simulated annealing algorithm (SAA). Practical results show that industrial and mining enterprises can obtain enormous economic benefits every year. 展开更多
关键词 algorithmS Current density ELECTRODEPOSITION Least squares approximations Mathematical models Optimization simulated annealing
在线阅读 下载PDF
A Personified Annealing Algorithm for Circles Packing Problem 被引量:5
9
作者 ZHANGDe-Fu LIXin 《自动化学报》 EI CSCD 北大核心 2005年第4期590-595,共6页
Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating t... Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating the moving of elastic objects, which can avoid the blindness of simulatedannealing search and make iteration process converge fast. Inspired by the life experiences of people,an e?ective personified strategy to jump out of local minima is given. Based on the simulatedannealing idea and personification strategy, an e?ective personified annealing algorithm for circlespacking problem is developed. Numerical experiments on benchmark problem instances show thatthe proposed algorithm outperforms the best algorithm in the literature. 展开更多
关键词 包装问题 模拟技术 退火算法 弹性物体
在线阅读 下载PDF
Control parameter optimal tuning method based on annealing-genetic algorithm for complex electromechanical system 被引量:1
10
作者 贺建军 喻寿益 钟掘 《Journal of Central South University of Technology》 2003年第4期359-363,共5页
A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that... A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that AGA takes objective function as adaptability function directly,so it cuts down some unnecessary time expense because of float-point calculation of function conversion.The difference from SAA is that AGA need not execute a very long Markov chain iteration at each point of temperature, so it speeds up the convergence of solution and makes no assumption on the search space,so it is simple and easy to be implemented.It can be applied to a wide class of problems.The optimizing principle and the implementing steps of AGA were expounded. The example of the parameter optimization of a typical complex electromechanical system named temper mill shows that AGA is effective and superior to the conventional GA and SAA.The control system of temper mill optimized by AGA has the optimal performance in the adjustable ranges of its parameters. 展开更多
关键词 GENETIC algorithm simulated annealing algorithm annealing-genetic algorithm complex electro-mechanical system PARAMETER tuning OPTIMAL control
在线阅读 下载PDF
基于IPSO算法优化SVM的睡眠分期模型
11
作者 张宇 白国长 王成 《传感器与微系统》 北大核心 2025年第8期138-142,共5页
针对目前睡眠分期中存在的依赖人工判别效率低、睡眠分期精度不高等问题,提出了一种基于改进粒子群优化算法优化支持向量机(IPSO-SVM)的睡眠分期模型,通过脑电(EEG)信号对睡眠过程进行准确分期。首先,对EEG信号进行滤波、分段等预处理;... 针对目前睡眠分期中存在的依赖人工判别效率低、睡眠分期精度不高等问题,提出了一种基于改进粒子群优化算法优化支持向量机(IPSO-SVM)的睡眠分期模型,通过脑电(EEG)信号对睡眠过程进行准确分期。首先,对EEG信号进行滤波、分段等预处理;其次,提取EEG信号的时域、频域、非线性特征;最后,通过IPSO-SVM算法建立睡眠分期模型。该模型在PSO算法中引入模拟退火算法来提升算法的搜索能力,同时引入惯性权重自适应变异使粒子能够跳出局部最优解。使用ISRUC-Sleep数据集的前6位受试者数据对IPSO-SVM分类模型进行验证。结果表明:IPSO-SVM模型的平均睡眠分期准确率为92.34%,K系数为0.88,改进的睡眠分期模型具有较高的准确率和系统稳定性。 展开更多
关键词 粒子群优化算法 支持向量机 模拟退火 自适应变异
在线阅读 下载PDF
基于模拟退火遗传算法的舰船编队网络优化调度方法
12
作者 陆青梅 赵山林 高媛 《舰船科学技术》 北大核心 2025年第10期155-160,共6页
舰船编队网络是一个复杂的通信系统,为减少通信延迟,确保信息的及时传递,提高整个编队的反应速度和作战效能,提出基于模拟退火遗传算法的舰船编队网络优化调度方法。以最小通信总延迟与总能耗为目标函数,通过设置约束条件,建立舰船编队... 舰船编队网络是一个复杂的通信系统,为减少通信延迟,确保信息的及时传递,提高整个编队的反应速度和作战效能,提出基于模拟退火遗传算法的舰船编队网络优化调度方法。以最小通信总延迟与总能耗为目标函数,通过设置约束条件,建立舰船编队网络优化调度模型。利用模拟退火遗传算法求解调度模型,实现最小通信总延迟与总能耗的舰船编队网络优化调度。实验结果表明,应用本文方法后,舰船编队网络的通信总延迟在0~80 ms之间,能耗保持在580 kWh以下。说明本文方法可以有效提升舰船编队网络通信的稳定性和效率,显著增强了编队的作战适应性和应变能力,为海军作战和海上安全提供更为可靠的支撑。 展开更多
关键词 模拟退火 遗传算法 舰船编队网络 优化调度 适应性 应变能力
在线阅读 下载PDF
考虑综合效益的周期型停车预约分配模型
13
作者 宋现敏 刘博 +3 位作者 李海涛 湛天舒 李世豪 张云翔 《交通运输系统工程与信息》 北大核心 2025年第1期24-35,共12页
为解决停车预约服务平台与用户之间存在的泊位运营问题,本文基于停车分配过程中服务平台的直接收益与服务水平间的关系,考虑用户出行特征的多样性,提出一种停车预约分配优化模型。为实现平台运营服务收益最大化,以运营商收益最大和用户... 为解决停车预约服务平台与用户之间存在的泊位运营问题,本文基于停车分配过程中服务平台的直接收益与服务水平间的关系,考虑用户出行特征的多样性,提出一种停车预约分配优化模型。为实现平台运营服务收益最大化,以运营商收益最大和用户出行成本的综合效益最小为目标建立联合优化函数,构建考虑停车分配时效性的周期型最优停车预约分配模型(POPA),并设计自适应升温的模拟退火-粒子群优化算法求解大规模停车分配问题。实验结果表明:综合考虑分配时效性和平台收益等多个因素,预约平台的最佳分配时段长度应为1 h,改进算法使求解效果提高了6.14%,灵敏度分析证明了惩罚因子的引入可在不影响用户时间成本与车位利用率的情况下,使平台的用户请求接受率提升2.25%~18.17%;通过对比分析,所提模型较用户最优模型提升了38.11%的实际收益,较平台最优模型降低了15.31%的平均用户时间成本。此外,通过拓展性数值测试证明了所提模型在大规模复杂场景中的适用性和有效性。 展开更多
关键词 交通工程 泊位运营 整数规划模型 停车分配 模拟退火-粒子群优化算法
在线阅读 下载PDF
区块链赋能的可信雾计算资源分配方法
14
作者 赵小虎 刘桁琳 王越 《计算机工程与设计》 北大核心 2025年第5期1318-1326,共9页
为解决雾环境中恶意节点的存在所造成系统资源分配整体收益低、节点间不可信问题,提出一种基于区块链技术的可信雾计算资源分配方法,保证可信节点的利益。将资源分配过程建模为区块链上的交易,对参与交易节点构建信任模型,采用节点信誉... 为解决雾环境中恶意节点的存在所造成系统资源分配整体收益低、节点间不可信问题,提出一种基于区块链技术的可信雾计算资源分配方法,保证可信节点的利益。将资源分配过程建模为区块链上的交易,对参与交易节点构建信任模型,采用节点信誉评估算法实现对不可信节点的筛选;考虑节点信誉度、需求和资源分配条件,以时延和能耗优化加权和作为系统整体增益,制定最大化系统增益优化问题;利用可信模拟退火算法对优化问题求解,得到最优分配策略。仿真结果验证了该方法的可靠性和有效性。 展开更多
关键词 雾计算 物联网 区块链 资源分配 任务卸载 信任计算 模拟退火优化算法
在线阅读 下载PDF
基于改进Jaya算法的规模化自压管网优化设计
15
作者 陈新明 陈嘉诚 杨阳 《排灌机械工程学报》 北大核心 2025年第7期732-739,共8页
为了解决遗传算法(GA)在解决规模化自压管网管径优化中所面临的参数较多导致算法实现困难,以及收敛条件不确定等问题,引入Jaya算法解决管径优化组合问题,并改进了原始算法,使改进后的Jaya算法适用于整数编码的变量优化.在以管网造价为... 为了解决遗传算法(GA)在解决规模化自压管网管径优化中所面临的参数较多导致算法实现困难,以及收敛条件不确定等问题,引入Jaya算法解决管径优化组合问题,并改进了原始算法,使改进后的Jaya算法适用于整数编码的变量优化.在以管网造价为目标函数、标准管径为决策变量,满足自压灌溉水量、水压、流速等约束条件的树状灌溉管网优化数学模型的基础上,使用改进的Jaya算法优化管径;用模拟退火罚函数法处理约束条件,将模拟退火的良好局部寻优能力和Jaya算法的全局搜索能力有机地结合在一起,使管网投资更小、可靠性更高.实例表明:优化结果与经济流速法和遗传算法的计算结果相比较,管网投资分别减少了34.8%和10.3%,管段水头利用率由19.51%提高到了73.07%,路径水头利用率从21.22%提高到了66.91%. 展开更多
关键词 规模化自压管网 管径优化 模拟退火 Jaya算法 组合优化问题
在线阅读 下载PDF
基于WOA-SA-RBF模型的西北内陆河流域突发水污染安全评价
16
作者 靳春玲 田亮 +2 位作者 贡力 李战江 蔡惠春 《科学技术与工程》 北大核心 2025年第23期10075-10083,共9页
为保障西北内陆河流域生态安全,急需开展西北地区内陆河流域突发水污染安全评价。聚焦于疏勒河流域敦煌区域,通过运用压力-状态-响应(pressure-state-response,PSR)模型框架,基于2017—2022年该流域的历史数据,采用一种融合鲸鱼优化与... 为保障西北内陆河流域生态安全,急需开展西北地区内陆河流域突发水污染安全评价。聚焦于疏勒河流域敦煌区域,通过运用压力-状态-响应(pressure-state-response,PSR)模型框架,基于2017—2022年该流域的历史数据,采用一种融合鲸鱼优化与模拟退火策略的径向基(whale optimization algorithm-simulated annealing-radial basis function,WOA-SA-RBF)神经网络模型,来评估该区域的突发水污染风险等级,并与粒子群优化算法-径向基(particle swarm optimization-radial basis function,PSO-RBF),遗传优化算法-径向基(genetic algorithm-radial basis function,GA-RBF)神经网络模型及传统评价方法优劣解距离法(technique for order preference by similarity to ideal solution,TOPSIS)法的评价结果进行对比分析。分析结果显示:疏勒河敦煌段在2017—2018年突发水污染风险水平被评定为Ⅱ级,而2019—2022年则降为Ⅲ级,显示出风险逐渐下降并趋向稳定的趋势;结果与TOPSIS法分析结果一致,与流域治理情况相符,从而有效验证本文评估模型的精度。研究成果有助于提高疏勒河流域针对突发水污染事件的预防控制能力与紧急应对效率,对西北内陆河流域的水资源管理以及祁连山区域的生态保护工作具有不可忽视的重要意义。 展开更多
关键词 鲸鱼优化算法(WOA) 模拟退火算法(SA) 径向基神经网络模型(RBF) 突发水污染 安全评价 内陆河
在线阅读 下载PDF
基于HTML的Web系统在植保机中的应用研究
17
作者 陈伟卫 《农机化研究》 北大核心 2025年第3期181-185,共5页
为了实现农田信息的实时监控,将农田信息进行可视化处理,设计了本系统。植保机作为农田中数据采集节点和地面工作站的中继站,可实现将农田信息上传地面工作站,且可利用HTML完成农田数据的Web可视化处理。同时,依据通讯路径损耗,确定通... 为了实现农田信息的实时监控,将农田信息进行可视化处理,设计了本系统。植保机作为农田中数据采集节点和地面工作站的中继站,可实现将农田信息上传地面工作站,且可利用HTML完成农田数据的Web可视化处理。同时,依据通讯路径损耗,确定通讯频率为430M,植保机飞行高度为750 m;基于模拟退火算法,实现植保机飞行路径规划;利用HTML完成用户Web网页设计;并对系统进行测试。测试结果表明:土壤湿度监控精度相对误差分布区间为[0.57%, 2.79%],Web网页可以实现各数据节点农田信息的实时显示。 展开更多
关键词 植保机 路径规划 模拟退火算法 WEB可视化
在线阅读 下载PDF
基于改进乌燕鸥算法同步优化SVM的特征选择
18
作者 赵小强 缐文霞 《兰州理工大学学报》 北大核心 2025年第3期89-98,共10页
针对支持向量机(SVM)中特征选择和参数优化对分类精度有较大影响的问题,提出了一种基于改进乌燕鸥算法同步优化SVM的特征选择算法.首先利用Tent混沌映射对乌燕鸥种群初始化,增加种群多样性,在此基础上引入余弦自适应并结合模拟退火算法... 针对支持向量机(SVM)中特征选择和参数优化对分类精度有较大影响的问题,提出了一种基于改进乌燕鸥算法同步优化SVM的特征选择算法.首先利用Tent混沌映射对乌燕鸥种群初始化,增加种群多样性,在此基础上引入余弦自适应并结合模拟退火算法,避免乌燕鸥算法陷入局部最优的缺陷,增强算法全局搜索能力,提高收敛精度;其次将改进算法同特征选择和支持向量机相结合,同步优化二进制特征选择和SVM的参数;最后在10个标准数据集上进行特征选择仿真对比实验,实验结果表明相比原始算法及其他对比优化算法,所提算法能有效降低数据维度,提高分类准确率. 展开更多
关键词 乌燕鸥优化算法 余弦自适应 模拟退火算法 支持向量机 特征选择
在线阅读 下载PDF
考虑可变编组和均衡检修的动车组运用计划编制优化研究
19
作者 户佐安 张文豪 +2 位作者 周甲明 黄鑫磊 张玉召 《北京交通大学学报》 北大核心 2025年第2期14-24,共11页
针对动车组(Electric Multiple Units,EMU)日常运用与高级修协调失衡问题,首先,从自动化编制的角度出发,阐明可变编组模式动车组接续过程,探究动车组运用计划与高级修周期的内在关系,并在此基础上,将动车组高级修均衡性及各项费用综合... 针对动车组(Electric Multiple Units,EMU)日常运用与高级修协调失衡问题,首先,从自动化编制的角度出发,阐明可变编组模式动车组接续过程,探究动车组运用计划与高级修周期的内在关系,并在此基础上,将动车组高级修均衡性及各项费用综合纳入优化目标,同时考虑检修能力、运行图、接续作业等约束条件,建立考虑可变编组和均衡检修的动车组运用检修一体化优化编制模型.然后,将启发式规则加入可行解生成算法中,结合模拟退火算法的寻优策略,设计出用于求解动车组运用计划的算法,以优化模型的求解过程.最后,以武广线部分运行图数据为背景进行算例验证.研究结果表明:可变编组模式比固定编组模式所需动车组数量减少16.9%,一级修检修次数减少18.7%,有效降低了综合运营成本.在考虑均衡检修条件后,动车组运用方案中动车组高级修均衡度上升了65%,有效缓解了实际运营中动车组集中送修,检修基地检修能力不足的问题,提高了动车组运用的组织水平. 展开更多
关键词 动车组 运用计划 可变编组 均衡检修 模拟退火算法
在线阅读 下载PDF
基于多旅行商问题建模的地铁乘务排班计划优化
20
作者 薛锋 肖恩 +2 位作者 杨颖 王金成 罗建 《交通运输系统工程与信息》 北大核心 2025年第2期261-272,共12页
针对地铁乘务排班计划问题,本文借鉴多旅行商问题的模型特点进行建模,用排班问题中的乘务片段表示旅行商问题中的城市,乘务片段的接续时间表示旅行商问题中城市间的距离,综合考虑各班次最长在班时间、连续值乘时间、间休时间和就餐时间... 针对地铁乘务排班计划问题,本文借鉴多旅行商问题的模型特点进行建模,用排班问题中的乘务片段表示旅行商问题中的城市,乘务片段的接续时间表示旅行商问题中城市间的距离,综合考虑各班次最长在班时间、连续值乘时间、间休时间和就餐时间等约束,以乘务片段接续时间最短和乘务人员工作时间方差最小为优化目标,建立非线性0-1整数规划模型。基于多旅行商问题的求解思路,设计遗传模拟退火混合算法求解模型。最后,以成都地铁5号线为例验证算法,并与多种优化算法编制方案进行对比分析。实例分析结果显示,相比于ADMM(交替方向乘子法)算法和G-SPFA(基于贪婪思想的最短路)算法,本文优化后的排班方案在乘务任务数量优化率分别为17.9%和23.1%,接续时间方面的优化率分别为15.8%和12.1%,能够有效降低企业的人力成本,提高司乘员的值乘效率,验证了模型的有效性。 展开更多
关键词 城市交通 多旅行商问题 遗传模拟退火算法 乘务排班计划
在线阅读 下载PDF
上一页 1 2 116 下一页 到第
使用帮助 返回顶部