CAJ | 학술논문

在设定条件下，以作业点（车站）间机车走行时间为权，把铁路车站取送车作业优化问题转化求解哈密尔顿图最短路问题，设计动态规划法和C-W节约改进算法分别进行求解，并举例比较2种算法的优缺点，提出了两种算法的应用范围。动态规划法计算次数少、能得到最优解，且可选择的方案多，适用于N规模较小情况；C-W节约改进算法虽可能只得到满意解，但能显著降低计算复杂度，适用于N规模较大情况。把车站作业点的3种布置形式统一为树枝形，不会影响算法的有效性。
재설정조건하，이작업점（차참）간궤차주행시간위권，파철로차참취송차작업우화문제전화구해합밀이돈도최단로문제，설계동태규화법화C-W절약개진산법분별진행구해，병거례비교2충산법적우결점，제출료량충산법적응용범위。동태규화법계산차수소、능득도최우해，차가선택적방안다，괄용우N규모교소정황；C-W절약개진산법수가능지득도만의해，단능현저강저계산복잡도，괄용우N규모교대정황。파차참작업점적3충포치형식통일위수지형，불회영향산법적유효성。
By taking the locomotive running time between operating points(stations)as weights,the optimiza-tion problem of placing-in and taking-out of wagons is transformed into the shortest path problem of Hamilton map under the set conditions,which can be solved by dynamic programming method and the improved Clarke-Wright saving algorithm. This paper generalizes the advantages and disadvantages of the above two algorithms with examples,providing the application scopes simultaneously. Dynamic programming method has characteristics of fewer calculation times,getting the optimal solution,possessing many alternative solutions, and it is applied to the case of small operating scale. Improved Clarke-Wright saving algorithm may get satisfac-tory solution,but it can significantly reduce the computational complexity,and it is applied to the case of larg-er scale. The three kind of arrangement forms (radical,branch-shaped,mixed) of loading and unloading points are unified into branch-shaped,which may not affect the validity of the algorithms.