Routing Problem With Stochastic Delay Time Under Forth Party Logistics

The Forth Party Logistics (4PL) is becoming the main mode of logistics for its effective characteristics, of which the routing problem is the key problem. In order to find a suitable route, stochastic delay time must be considered. Routing problem with stochastic delay time is studied with the objective of minimize cost and the constraint of due date in this paper. First, both chance constrained programming model (CCPM) and expectation model (EM) are established for the problem. Then numerical experiments are used for models comparison and problem analysis. The results show that the CCPM is more corresponding in the face of stochastic delays, so that the optimal route of decision-making is more likely to meet the needs of routing problems in real life.