铁道学报
鐵道學報
철도학보
2014年
6期
1-8
,共8页
张文晰%陈崇双%薛锋%牟峰
張文晰%陳崇雙%薛鋒%牟峰
장문석%진숭쌍%설봉%모봉
路企直通列车%取送车%树枝形专用线%直达车流%分支定界
路企直通列車%取送車%樹枝形專用線%直達車流%分支定界
로기직통열차%취송차%수지형전용선%직체차류%분지정계
direct-connection train%taking-out and placing-in shunting%branch-shaped sidings%through wagon flow%branch and bound
合理安排取送车顺序对提高机车劳动效率和加速车辆周转具有重要意义。针对树枝形专用线的直达车流取送问题,以车辆在装卸区总停留时间最小为目标函数,满足取送顺序间的逻辑关联约束,建立数学模型。结合后出线者先送、先完工者先取两条准则确定初始方案;引入送车代价和取车代价预先评估方案的有利性,设计隐枚举算法。算例表明:走行时间越离散或装卸时间越集中,寻优进程越缓慢;当专用线数目小于6时能迅速找到最优解,大于6时,设置合理的局部迭代阈值可较快地获得高质量解;获得多个满意解比单个耗费更多时间。
閤理安排取送車順序對提高機車勞動效率和加速車輛週轉具有重要意義。針對樹枝形專用線的直達車流取送問題,以車輛在裝卸區總停留時間最小為目標函數,滿足取送順序間的邏輯關聯約束,建立數學模型。結閤後齣線者先送、先完工者先取兩條準則確定初始方案;引入送車代價和取車代價預先評估方案的有利性,設計隱枚舉算法。算例錶明:走行時間越離散或裝卸時間越集中,尋優進程越緩慢;噹專用線數目小于6時能迅速找到最優解,大于6時,設置閤理的跼部迭代閾值可較快地穫得高質量解;穫得多箇滿意解比單箇耗費更多時間。
합리안배취송차순서대제고궤차노동효솔화가속차량주전구유중요의의。침대수지형전용선적직체차류취송문제,이차량재장사구총정류시간최소위목표함수,만족취송순서간적라집관련약속,건립수학모형。결합후출선자선송、선완공자선취량조준칙학정초시방안;인입송차대개화취차대개예선평고방안적유리성,설계은매거산법。산례표명:주행시간월리산혹장사시간월집중,심우진정월완만;당전용선수목소우6시능신속조도최우해,대우6시,설치합리적국부질대역치가교쾌지획득고질량해;획득다개만의해비단개모비경다시간。
Reasonable arrangement of taking-out and placing-in shunting operations are of great significance to raise locomotive productivity and speed up vehicle circulation . In this paper , the mathematical model for tak-ing-out and placing-in shunting of through wagon flow on branch-shaped sidings , was set up with minimizing its total residence time in the loading-unloading area as object function , and with the constraint of the logic cross relation between such two kinds of arrangements to be satisfied . The initial plan was determined accord-ing two criteria ,i.e. ,last departure first placing-in and first completion first taking-out . The implicit enu-meration algorithm was designed via assessing the plan′s profitability in advance , on the basis of introducing placing-in cost and taking-out cost scheme . Case study show s as follow s :the more discrete the locomotive running time or the more intensive the loading-unloading operating time , the slower the optimization process . When the number of sidings is less than 6 , the best solutions can be rapidly found out . Otherwise , high quali-tative solutions can be obtained in short period by setting local iteration threshold . More compute time is spent in getting multiple satisfactory solutions than single one .