检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:范厚明 田攀俊 吕迎春 张跃光 任晓雪 FAN Hou-ming;TIAN Pan-jun;LV Ying-chun;ZHANG Yue-guang;REN Xiao-xue(Transportation Engineering College,Dalian Maritime University,Dalian 116026,China)
机构地区:[1]大连海事大学交通运输工程学院,辽宁大连116026
出 处:《中国管理科学》2022年第2期137-149,共13页Chinese Journal of Management Science
基 金:国家社科基金应急管理体系建设研究专项(20VYJ024)。
摘 要:针对越库配送下考虑时空距离的库门分配与车辆路径问题,建立以车辆派遣成本、运输成本、时间惩罚成本、越库内部操作成本总和最小化为目标的库门分配与车辆路径优化模型。根据问题的特征设计改进的自适应遗传算法,并根据时空距离生成初始解。通过对不同规模的算例进行对比和分析,验证了模型的正确性和算法的有效性,结果表明,所得出的库门分配和车辆调度优化方案可以有效降低越库配送中心的运营成本。研究成果拓展和丰富了越库配送下的车辆路径问题研究,能为物流企业优化配送方案提供理论依据。Aiming at the problem of the temporal-spatial distance and vehicle routing in cross-docking,a model of the door assignment and the vehicle routing optimization is established,which is aiming to minimize the sum of vehicle dispatching cost,transportation cost,time window penalty cost and the operation cost of cross-dock.The improved adaptive genetic algorithm is designed according to the characteristics of the problem,and the initial solution is generated according to the temporal-spatial distance.By comparing and analyzing the examples of different scale,the correctness of the model and the validity of the algorithm are verified.The results show that the algorithm considering the temporal-spatial distance and integrating and optimizing the in-store operation and the out-store vehicle routing problem can effectively reduce the cost of the cross-dock center.The research results expand and enrich the research on the vehicle routing under the cross-docking,which can provide the theoretical basis for the logistics enterprise to optimize the decision distribution scheme.
关 键 词:时空距离 越库配送 库门分配 异型车辆 自适应遗传算法
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.113