检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张家赫 Zhang Jiahe(Baiyin Nonferrous Railway Logistic Co.,Ltd.,Baiyin 730900,China)
机构地区:[1]白银有色铁路运输物流有限责任公司,白银730900
出 处:《青海交通科技》2024年第2期20-25,共6页Qinghai Transportation Science and Technology
摘 要:为高效编制树枝形专用线取送车方案,考虑机车的数量、机车的牵引能力、调移作业节点的先后顺序,建立以取送作业时间为目标的优化模型;再根据作业性质,设计了结合遗传算法和大规模邻域搜索算法的改进遗传算法求解该模型。以某一铁路车站的取送作业为例,对模型进行求解,验证模型算法的有效性,结果表明:建立的模型求解方案符合实际,设计的改进GA算法可以快速高效求解模型,验证了改进算法的有效性。In order to efficiently prepare the dendritic special line pickup and delivery scheme,considering the number of locomotives,the traction capacity of locomotives,and the sequence of shifting operation nodes,an optimization model with pickup and delivery operation time as the goal is set up;and then,according to the nature of the operation,an improved genetic algorithm combining genetic algorithm and large-scale neighborhood search algorithm is designed to solve the model.Taking the pickup and delivery operation of a railroad station as an example,the model is solved to verify the validity of the model algorithm,and the results show that:the established model solving scheme is in line with the reality,and the designed improved GA algorithm can solve the model quickly and efficiently,which verifies the validity of the improved algorithm.
关 键 词:交通运输工程 取送车作业 装卸线布置 货物作业点 遗传算法
分 类 号:U294.1[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.71.161