首页> 外文期刊>Soft computing: A fusion of foundations, methodologies and applications >A bi-level optimization model of LRP in collaborative logistics network considered backhaul no-load cost
【24h】

A bi-level optimization model of LRP in collaborative logistics network considered backhaul no-load cost

机译:合作物流网络中LRP的双层优化模型被认为回程无负荷成本

获取原文
获取原文并翻译 | 示例
       

摘要

In collaborative logistics network, all task demands are centralized by logistics platform for resource allocation, and then resource owners execute discretely under final plan. The key point of this study is to effectively balance the different appeals of stakeholders. In this paper, a bi-level programming model is presented to solve multi-deport LRP considered the constraint of hard time window, vehicle capacity and vehicle backhaul cost, which aims at achieving the effective interest coordination between upper layer platform and lower layer vehicle owners. To solve this bi-level model, genetic algorithm is redesigned according to this specific situation. Optimal results of simulation sample show that the satisfied solution for both platform and vehicle owners could be obtained using this method. Feasibility and validity of this model and adaptive algorithm have been verified in the paper. The bi-level model provides a practical and effective method to solve the profit distribution problem between platform and vehicle owners.
机译:在协作物流网络中,所有任务需求都是通过物流平台集中资源分配的,然后资源所有者在最终计划下离心执行。本研究的关键点是有效地平衡利益攸关方的不同呼吁。在本文中,提出了一种双级编程模型来解决多拆放LRP认为是硬时间窗口,车辆容量和车辆回程成本的约束,旨在实现上层平台和下层车主之间的有效兴趣协调。为了解决这一双级模型,根据这种具体情况重新设计遗传算法。仿真样本的最佳结果表明,使用此方法可以获得平台和车主的满意解决方案。本文已验证了该模型和自适应算法的可行性和有效性。双级模型提供了一种解决平台和车主之间的利润分布问题的实用有效方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号