Font Size: a A A

A Study On Models And Algorithms For Collaborate Vechicle Routing Problem

Posted on:2013-09-22Degree:MasterType:Thesis
Country:ChinaCandidate:B SunFull Text:PDF
GTID:2252330374474922Subject:Transportation planning and management
Abstract/Summary:PDF Full Text Request
Collaborative Vehicle Routing Problem (CVRP) is the advanced stage of development ofthe multi-depot Vehicle Routing Problem (MDVRP). The various logistics companies shareinformation and resources such as customers, warehousing and motorcade through internet.They serve the customers belong to different companies to reduce the cost of total distribution.CVRP is a new research field of Logistics, and the related.theoretical study is rarely.The paper aims at studying CVRP, and the main research work are summarized asfollows:(1)Considering some constraints such as maximum mileages of different vehicles,depot’s capacity and time window, etc., a class of deterministic CVRP to optimize total cost ofdispatching was studied. The problem was solved by discrete particle swarm optimizationalgorithm, and the model’s correctness and reasonableness was proved throughComprehensive simulation and experimental analysis. The experimental result shows that theoptimal total distribution mileage and cost solved by the presented model can be significantlyreduced compared to general logistics.(2) A class of CVRP with fuzzy travel and customer service time was discussed. Thispaper built a fuzzy programming model on CVRP,considering uncertainty factors to affectCVRP, and then converted into a deterministic one. Its solution was also solved by discreteparticle swarm optimization algorithm. The distribution of the prepared program can adapt tochanging traffic environment, when the incident interference occurred. Therefore, it is closerto the practical application of logistics enterprises.(3) Considering the random factors in the distribution of the original plan, which resultedin a failure of distribution program, reliability theory is used in the CVRP in the paper. AConcept to the vehicle task reliability was defined. Based on feature on the problem, solutionalgorithm was designed. Defining scheme of the solution code and the heuristic algorithm toproduce the initial population, the model’s correctness and reasonableness was provedthrough Comprehensive simulation and experimental analysis. The study shows that althoughthe cost of distribution may be higher with with the increase of vehicle mission reliability, thereliability of this scheme is better. And thus it is less affected by uncertain disturbance in actual distribution.The research results have enriched the content and form of the vehicle routing problem,not only has it filled the blank of the CVRP field, but also supplied theory and method forsubsequent distribution work. This study has both theoretical and practical contributions.
Keywords/Search Tags:logistics, collaborative transport, vehicle route problem, particle swarmoptimization, genetic algorithm
PDF Full Text Request
Related items