Fourth party logistics routing problem model with fuzzy duration time and cost discount

作者:

Highlights:

摘要

In this paper, from the viewpoint of a fourth party logistics (4PL) provider, a multi-source single-destination 4PL routing problem with fuzzy duration time and cost discount (M-S 4PLRPFC) is described considering the comprehensive ability of 3PL suppliers and nodes. A chance-constrained programming model is established for the M-S 4PLRPFC. Next, a memetic algorithm (MA) with a fuzzy simulation method is designed to solve the problem. Based on a set of problem instances as the test bed, experiments are performed to compare the performance of the proposed MA with those of the enumeration method and a standard genetic algorithm (SGA). The experimental results show that the proposed MA obtains the same results as the enumeration method and that it is than the SGA.

论文关键词:Fourth party logistics,Routing problem,Chance constrained programming,Memetic algorithm,Local search

论文评审过程:Received 10 September 2012, Revised 16 April 2013, Accepted 21 April 2013, Available online 9 May 2013.

论文官网地址:https://doi.org/10.1016/j.knosys.2013.04.020