The Study Of Algorithm And Scheduling For VRPTW

In the traditional production areas, profits for reducing the material consumption and labor consumption are known as the first and second profit source. As market competition intensifying and technology and management level increasing, the production enterprises in the area of controllable cost of space has become smaller and smaller, the first and second profit source begin to exhaust. Competition requires the enterprises to reduce costs in order to survive.In this case, the logistics as "the third profit source" of a corporation begin to gain more and more attention.In order to achieve advantage in competition,advanced logistics concepts and technology are used constantly into the production and management.Logistics is a very important part of the logistics system,it occupy a large part of the logistics cost. Logistics vehicle routing planning problem is a problem that studies how to minimize the transport logistics cost and has great practical significance.As closely integrating theory and practice of operations research, it has gained a lot of research results in recent decades, so that was called "one of the most successful research in operations research field."In this thesis, the author purpose the research problem-vehicle routing problem with time windows, and construct a mathematical model:defines an objective funtion.It sets up to vehicle limit and restrict the constraints customer needs, while analyzed and summarized the history and vehicle routing problem based on the study to determine the status of research methods in this thesis. This thesis mainly the following aspects:1).Study for Vehicle Routing ProblemStarting form classic example of operational research -traveling salesman problem, vehicle routing problem raises, combining with the actual situation in the specific circumstances of vehicle routing problem and the main difficulties of the analysis, and algorithm for solving this problem was discussed.2).Study and Study of Algorithm for Vehicle Routing Problem with Time WindowVehicle routing problem under the actual conditions-increasing competition leding to increasingly stringent customer requirements, proposed object of this thesis -the time window distribution center vehicle path planning.The genetic algorithm was come up by a further analysising for vehicle routing problem algorithm and basing on existing research.3).Plan System realization and instance demonstrationBased on the above-mentioned theoretical studies,C++ builder and Microsoft SQL Server 2000 are applied to complete the system implementation combining with the computer-aided distribution center vehicle routing planning system.A Solomon standard data is used to verify this system and the algorithm.Of course, the subject of study has some limitations, such as the complexity of the actual traffic considerations, the perfect combination with the actual situation is subject to further study.