Study On Models And Algorithms For Vehicle Routing Problem Under Multifactor

Transportation comprises a signficant fraction of the national economy. In the routine work, carious modes of transportation all face such a common problem: how to make routes and timetables for the vehicles that passengers and goods can be transported from one place to another efficiently. These problems are generally known as vehicle routing problems (VRP) in thecircles of operations research.With increasing intensification of marketing competition, step out of global integration, and speedy development of science and technology, many enterprises have been conscious that logistic is an important measure to improve the ability of market competition and exalt the ability of coral competition, and introduced advanced logistical theory and logistical technique to manufacture and operation management of enterprise. Being an important approach to realize logistic rationalization, research on vehicle routing problems will help enterprise to reduce logistical cost, improve operation efficiency, and enhance customer satisfaction roundly.It is clear that the vehicle routing problem is the key problem in the optimization of transportation operations. Because vehicle routing problems bridge theory of Operations Research and practice of production, they are named as one of the most successful areas in Operations Research in the past decades.Vehicle routing problems is normally defined as a problem that some rational routes should be organized to let one or more vehicles pass by a series of depots which deliver or receive goods in sequence, and that a certain targets such as the shortest distance, the lowest cost, the shortest time and the least vehicles should be gained under several constraints, for example, volume of demand, volume of delivery, time of delivery, capacity of vehicle, odometer of traveling, time limits, and so on.In this paper, based on summarizing relative reference, we retrospecte domestic and foreign researchs on vehicle routing problem. we research models and algorithms of vehicle routing problems with time window in certain imformation; models and algorithms of vehicle routing problems with stochastic time and models and algorithms of vehicle routing problems with fuzzy demand. This paper could scientifically improved the efficiency of Logistics Distribution, which did not had a great significance only intheoretical research but also in the applied science for the development of Logistics Distribution.