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.
Study on Multi-Depot Collaborative Transportation Problem of Milk-Run Pattern
2016
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
A reactive tabu search algorithm for the multi-depot container truck transportation problem
Online Contents | 2009
|A reactive tabu search algorithm for the multi-depot container truck transportation problem
Online Contents | 2009
|Intermodal Transportation and Inland Depot Selection
British Library Conference Proceedings | 2002
|Intermodal Transportation and Optimum Depot Selection
British Library Conference Proceedings | 2002
|Planet: Part III. Depot Transportation Simulator
NTIS | 1967
|