Abstract
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.
Highlights
Transportation is the essential means to ensure the orderly conduct of production and life
A large part of the reason is the lack of cooperation among enterprises, resulting in insufficient capacity or load phenomenon occurs frequently. It is very important strengthen the cooperation between enterprises, through collaborative transportation combined transport tasks, integrate transport resources, reducing transport costs
Milk run mode of collaborative transportation problem is belong to the yard vehicle scheduling problem, the article considers the perspective of transportation benefits, establishes the income - cost model, and put forward the thinking of solving the two-phase algorithm on the basis of this
Summary
Transportation is the essential means to ensure the orderly conduct of production and life. A large part of the reason is the lack of cooperation among enterprises, resulting in insufficient capacity or load phenomenon occurs frequently. In this context, it is very important strengthen the cooperation between enterprises, through collaborative transportation combined transport tasks, integrate transport resources, reducing transport costs. Literature [2] analyze the problem of collaborative transportation route optimization in straight-through transportation, a single point and two points of transit models, built integer programming model of transportation costs and achieved good results with using Lagrangian relaxation algorithm. Literature [4], [5] research collaborative transportation cost control from the perspective of select transit point and route coverage. A single distribution point is often unable to meet the set requirements in reality of large-scale cooperative distribution problems
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
