4PL Collaborative Routing Customization Problem on the Dynamic Networks

摘要

Aiming at the dynamic time changes in the logistics transportation network, the problem that a Fourth Party Logistics (4PL) supplier collaborates Third Party Logistics (3PL) suppliers to customize routes for the customers is proposed. A mathematic programming model is presented by considering the transportation, staying and transit cost with the time constraint, and the dynamic time is updated at the transit nodes. A Two-phase solution method bases on the Ant Colony Optimization (TACO) is established. In the TACO, two equations of the state are given respectively for generating the best solution and renewing the ants' pheromone distribution. The numerical analysis shows that comparing with the algorithm repeated using the ACO, TACO cannot only save the running time, but also can increase the probability of finishing the task.