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