Study on Multi-Depot Collaborative Transportation Problem of Milk-Run Pattern

摘要

Analyze the relevance between Milk Run mode and collaborative transportation problem, put forward collaborative transportation problem of multiple-depot on Milk Run mode under the supply and demand separate nodes, consider the value of transport and transport costs, introduce the concept of node - arc flow, by comparing the size of traffic flow determine nodes collection, and then constructed multi-transport model of the problem. Considering one-way pickup and delivery closed, construct two-stage algorithm model, use dynamic programming recursive solution to determine the best route to pick up, and then solving delivery routing problem with different start and return point based on geometric method of Cosine. Finally use a numerical example illustrates the effectiveness of the algorithm and reasonable model.