一种集成最后一公里的四方物流网络设计问题启发式算法
作者:
作者单位:

东北大学

作者简介:

通讯作者:

中图分类号:

TP312

基金项目:

国家自然科学基金重点国际合作研究项目(71620107003); 国家自然基金青年基金(71601039); 辽宁省“兴辽英才 计划”(XLYC1802115);辽宁省高校创新团队支持计划资助项目(LT2016007); 流程工业综合自动化国家重点实验室基础科研 业务费资助(2013ZCX11); 辽宁省教育厅基础研究项目(LJC201909)


A Heuristic Algorithm for the Fourty Logistics Network Design Problem with Last-mile Delivery
Author:
Affiliation:

Northeastern University

Fund Project:

the NSFC Major International (Regional) Joint Research Project Grant No. 71620107003; the NSFC Research Project Grant No.71601039;the Liaoning Revitalizing Talent Program No. XLYC1802115, the Program for Liaoning Innovative Research Team in University Grant No. LT2016007; the Fundamental Research Funds for State Key Laboratory of Synthetical Automation for Process Industries Grant No. 2013ZCX11;Basic Research Project of Liaoning Educational Committee No. LJC201909

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    最后一公里分销网络可以帮助企业达成高响应性的供应链管理目标,集成最后一公里四方物流网络设计问题成为网络设计的一个重要研究方向.解决该问题需要对分销中心的位置,三方物流的选择、分配以及其车辆路径规划进行决策.本文在满足车辆路径规划,流守恒等约束条件下以最小化网络构建费用为目标建立了混合整数规划模型.由于该问题的NP-难特性,本文将该问题分解成两个子问题并设计了两阶段启发式算法,该算法迭代地解决两个子问题.在数值实验中,将启发式算法分别与CPLEX和粒子群优化算法求出的解进行比较,实验结果验证了启发式算法的有效性;同时,将提出的启发式算法成功地应用到实际规模的问题中,也说明本文提出的算法能够为解决集成最后一公里四方物流网络设计问题提供有效的工具.

    Abstract:

    Distributor storage network with last-mile delivery can be used to achieve the supply chain management objective of high responsiveness. The fourth party logistics network design problem with last-mile delivery is an important research in the network design problem. The problem needs to be solved by simultaneously making decisions on issues of the distribution center location, the selection, allocation and routing programming of the third party logistics. A mix-integer programming model is established to minimize the total system cost with satisfying the constraints of vehicle routing programming and flow conservation and so on. Because the problem is NP-hard, this paper presents a two-phase heuristic algorithm for the fourth party logistics network design problem with last-mile delivery by dividing the problem into two subproblems. The algorithm solves the subproblems in an iterative manner. In the numerical tests, by comparing with the solutions calculated by CPLEX and particle swarm optimization algorithm, the heuristic algorithm outperforms the other two algorithms, which illustrates that the heuristic algorithm can provide an efficient solution to the fourth party logistics network design problem with last-mile delivery; meanwhile, the heuristic algorithm is successfully applied in the experiment of practical scale, which also presents it can offer an effective tool in the field.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2020-11-03
  • 最后修改日期:2021-03-05
  • 录用日期:2021-03-16
  • 在线发布日期:
  • 出版日期: