轨道养护计划多目标模型及求解
Multi-objective Track Maintenance Plan Model and Solution
投稿时间:2017-10-19  修订日期:2018-04-11
DOI:10.11908/j.issn.0253-374x.2018.07.010     稿件编号:    中图分类号:U216
 
摘要点击次数: 132    全文下载次数: 58
中文摘要
      建立了包括轨道几何状态最优和成本费用最小两个目标函数的轨道养护计划模型.为了求解轨道养护计划多目标模型,通过编码改进、约束条件全过程控制以及遗传系数自适应的方法,对带精英策略的快速非支配排序遗传算法(NSGA II算法)进行了改进,使其在求解轨道养护计划多目标问题时能更好地保持种群多样性,避免“早熟”,并在后期加速收敛得到全局最优解,解决了大型养路机械最佳作业时间和地点的决策问题;沪昆上行线案例表明:所建立的计划编制方法的计算效率高,且养护计划效果明显,各区段轨道不平顺均未超过事后养护维修限度.
英文摘要
      In order to solve the multi-objective model of track maintenance plan, the fast and elitist non-dominated sorting generic algorithm (NSGA-II algorithm) is improved through coding improvement, constraint condition control in the whole process and self-adaption of genetic coefficients. It can maintain the diversity of the population in solving the multi-objective problem of track maintenance to avoid premature convergence, the global optimal solution is obtained by accelerating convergence at the later stage. These methods solve the decision making problem of large maintenance machineries’ optimal operation time and place. Case in Shanghai and Kunming line shows, established planning method has high computational efficiency and the effect of maintenance plan is obvious, the track irregularity of all sections did not exceed the limit of maintenance.
HTML   查看全文  查看/发表评论  

您是第4442182位访问者
版权所有《同济大学学报(自然科学版)》
主管单位:教育部 主办单位:同济大学
地  址: 上海市四平路1239号 邮编:200092 电话:021-65982344 E-mail: zrxb@tongji.edu.cn
本系统由北京勤云科技发展有限公司设计