检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李兆进 刘雅[1] 杨臻 LI Zhao-jin;LIU Ya;YAND Zhen(School of Management, Xi’an Jiaotong University, Xi’an 710049, China)
出 处:《运筹与管理》2022年第4期28-34,共7页Operations Research and Management Science
基 金:国家自然科学基金资助项目(72071156);教育部人文社会科学研究青年基金(18YJC630104)。
摘 要:为了获得运输的规模经济效应,本文研究了一种考虑订单合并和货物转运的零担多式联运路径优化问题。首先,以总运输成本为目标函数,以网络中的运输工具容量、可以提供的运输工具最大数量、运输工具服务的关闭时间以及订单时间窗为约束,构建混合整数规划模型,在模型中允许多个订单进行合并运输并考虑运输过程中的转运成本。其次,由于多式联运路径优化问题是典型的NP-hard问题,为了快速求解该模型,开发了一种可以快速为该问题提供近似最优解和下界的列生成启发式算法。最后,生成并测试了大量算例,结果表明所开发的列生成启发式算法可以在较短的时间内提供高质量的近似最优解。文章所构建的模型和开发的列生成启发式算法可以为零担自营多式联运物流企业提供高效的决策支持。In order to obtain the economies of scale effect of transportation,this paper studies a route optimization problem of LTL multimodal transport considering order consolidation and freight transshipment.Firstly,the total transportation cost is taken as the objective function,a mixed integer programming model is constructed with the constraints of the capacity of transportation vehicles,the maximum number of vehicles that can be provided,the closing time of vehicle services and the time window of orders.In the model,the consolidation of multiple orders are allowed and the transshipment cost is considered.Secondly,as the multimodal transportation route optimization problem is a typical NP hard problem,in order to quickly solve the problem,a column generation heuristic is developed which can quickly provide approximate optimal solution and lower bound for the problem.Finally,a large number of instances are generated and tested.The results show that the developed column generation heuristic can provide high-quality approximate optimal solution in a short time.The model and the developed column generation heuristic can provide efficient decision support for LCL self-operated multimodal transport logistics companies.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229