Integration In Common Distribution: Model And Algorithm

Integration of the logistic resources must be done as soon as we can do to develop modern logistics. Low efficiency of these integration restricted exerting logistic potential power. Consequently, how to integrate social resources to improve logistic operational efficiency, decrease operation cost, has became one of the most important question for discussion in Logistics modernization. Common-distribution is an effective way to integrate social resources. From the microcosmically viewing, participant companies could gain scale economic, increase operation efficiency, and reduce operational cost. Participant companies can save lots of resources, because they don't need much capital, equipment, land, and manpower. They also can gain development and expansion by concentrating on core-business. Common-distribution expanding market bound, breaking close selling net, facilitates establish concomitant, co-prosperity environment. From the macroscopically viewing, Implementing Common-distribution can bring out a lot of benefit, such as reducing total social traffic flux, allaying the possibility of jam in downtown because of unloading, ameliorating traffic condition, increasing load factor by concentrated disposal, saving space and manpower in logistic process, improving social living quality by ameliorating commercial logistic condition. This paper's object is decreasing distribution and relative affair cost by effectively organizing common-distribution and fully using owning facility, at the same time, benefit of participants is considered to eliminate Common-distribution obstacle. On the basis of summarizing the deficiency about Common-distribution integration, models and solutions were studied to implement Common-distribution. First, models were constructed to quantify distribution demand, as also to optimize distribution demand. These demand include determinate demand and un-determinate demand. These work is the base of implementing Common-distribution. Second, distribution plan that focus on heterogeneous vehicle routing problem is studied to optimize distribution cost. Then, about how to fairly allocate cost is studied to eliminate obstacle that obstruct implementing Common-distribution. Last, about how many vehicles should be hold is studied to fully use existing facility. On the basis of carefully analyzing relative business of every stage in implementing Common- distribution, relative business is abstracted to mathematics models, and using mathematics symbol expressed real operation. Arithmetic about these models also was studied, so as to can quantify thesebusiness. It makes participants can really decreasing operational cost and increasing logistics operation efficiency. At the same time, Common-distribution participants pay the most attention to how many they can get and how to allocate cost when they participate Common-distribution. Solution of these problem construct the base to implement Common-distribution.The primary innovations are as follows:As for integrating of determinate demand, a model is constructed according the devised mechanism which means that, to let dealer accept coordination, main decision maker must offer different price discount for different dealer, and assure that dealer have at least S% saving. According this model, an algorithm is studied to Solute it.When studying how to integrate business of dynamic demand, to coordinate decision of inventory and transportation, A analytic model is constructed to compute upper-level inventory Q and delivery cycle T, as well as to minimize long-run average cost in system. Then, how to simplify this model is analyzed to get solution bound and approximate formulate.About how to solute vehicle routing problem, this paper focus on heterogeneous vehicle routing problem, and summed up algorithms in foreign literature. Thereafter, a meta-heuristic algorithm, which combined giant tour algorithm and tabu-search algorithm, is devised. In the process of this algorithm, to reduce the likelihood of local optimum, infeasible solution is allowed by adding penalty fact...