检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李冰[1] 张志宁 轩华[1] LI Bing;ZHANG Zhining;XUAN Hua(School of Management Engineering,Zhengzhou University,Zhengzhou 450001,China)
出 处:《系统管理学报》2021年第2期201-214,共14页Journal of Systems & Management
基 金:河南省科技攻关计划资助项目(202102310310);国家自然科学基金资助项目(U1604150,U1804151)。
摘 要:针对树枝形铁路专用线小运转货物作业系统优化问题,首先剖析了铁路枢纽小运转货物作业机理,进而根据各车组到达编组站时分、车组目的装卸站位置、车组取送作业时间要求以及调机牵引定数等限制,以调机早到等待成本、调机晚到惩罚成本、铁路枢纽专用线调机和货车运营成本最小化为目标,构建问题模型。鉴于模型复杂,直接求解较为困难,故设计HH-GAP&AIP求解策略。该方法首先给出基于作业紧急度-编组定额-集结时间的送车-取车贪婪调配策略,形成小运转列车初始取送方案。进而设计异步循环启发式完成解的迭代寻优,同时为避免算法陷入局部最优及扩大解的搜索空间,给出基于检测-剔除-变换的取送车径路调整策略。最后,设计实验场景,对所提出的方法进行过程验证,并设计不同规模问题,对算法进行测试对比及性能评估。Aimed at the optimization problem of local freight train transship system based on the branchshaped siding network,the process of shunting local train in railway terminal was analyzed.Besides,based on the time point of each wagon group arriving at the marshalling station,the handling station of wagon group,the loading/unloading time of wagon group in handling station,the engine’s traction number,etc.,the problem was formulated as a programming model which minimized the waiting cost for engine early arrival,the penalty cost for engine late arrival,and the operating cost of engine and the wagon.In view of the model complexity and the difficulty in solving it,the HH-GAP&AIP solution strategy was provided.First,the greedy strategy which makes placing-in and taking-out wagons shunting based on the handling emergency level,wagon accumulation number and time was proposed to generate the initial scheduling scheme.Then,asynchronous iteration heuristic was proposed to complete the iterative optimization of the solution.Next,an updating approach based on the checking-detection-transformation procedure was given to prevent the mentioned algorithm from falling into local optimum and expanding the search scope.After that,the experimental scenarios were designed to test the algorithm proposed.Finally,the algorithm proposed was compared with some other algorithms and the performance of the algorithm proposed was evaluated by some different sized cases.
分 类 号:N945[自然科学总论—系统科学] U291.7[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.193.237