基于动态规划的铁路转运站散装物资对位卸载作业优化算法  

Optimization Algorithm of Bulk Materials Counterpoint Unloading Operation in Railway Transfer Stations Based on Dynamic Programming

作　　者：谢得卉 陈曦 刘振元[1] 樊垚堤 唐淑贤 XIE Dehui;CHEN Xi;LIU Zhenyuan;FAN Yaodi;TANG Shuxian(School of Artificial Intelligence&Automation,Huazhong University of Science&Technology,Wuhan 430074;Yalong River Hydropower Development Company Ltd.,Chengdu 610051,China)

机构地区：[1]华中科技大学人工智能与自动化学院,湖北武汉430074 [2]雅砻江流域水电开发有限公司,四川成都610051

出　　处：《物流技术》2021年第5期42-48,共7页Logistics Technology

基　　金：中央高校基本科研业务费(HUST:2017KFYXJJ178);雅砻江流域水电开发有限公司专项研究资助项目;华中科技大学教学研究项目(2019085)。

摘　　要：针对铁路转运站物流作业中的散装物资卸载问题,建立目标为最小化卸载时长的对位卸载模型,并使用启发式动态规划进行求解。首先,建立该卸载问题的0-1整数线性规划模型,并证明该问题是个NP完全问题;其次,将原问题转换为动态规划模型,设计启发式动态规划算法进行求解;最终,计算实验证明基于动态规划的启发式算法计算效率明显优于动态规划方法,同时算法的求解质量也得到了较好的保证。In this paper,aiming at the problem of bulk materials unloading in railway transfer stations,we established a counterpoint unloading model intended to minimize unloading time,and used heuristic dynamic programming to solve the problem.First,we established a 0-1 integer linear programming model for the problem,and proved it to be an NP complete problem.Next,we converted the original problem into a dynamic programming problem,and designed a heuristic dynamic programming algorithm to solve it.Finally,a numerical experiment was used to demonstrate the obvious superiority of the dynamic programming based heuristic algorithm over the dynamic programming algorithm in terms of computational efficiency while also guaranteeing to further extent the quality of the solutions yielded.

关 键 词：铁路转运站 散装物资卸载 NP完全问题 动态规划 启发式规则 

分 类 号：U294.7[交通运输工程—交通运输规划与管理] U294.26[交通运输工程—道路与铁道工程]