时间窗约束下的车辆路径问题遗传算法外文翻译（可编辑）.docVIP

时间窗约束下的车辆路径问题遗传算法外文翻译 Genetic Algorithms for the Vehicle Routing Problem with Time Windows Material Source: Special issue on Bioinformatics and Genetic AlgorithmsAuthor: Olli Br?ysy 1 Introduction Vehicle Routing Problems VRP are all around us in the sense that many consumer products such as soft drinks, beer, bread, snack foods, gasoline and pharmaceuticals are delivered to retail outlets by a fleet of trucks whose operation fits the vehicle routing model. In practice, the VRP has been recognized as one of the great success stories of operations research and it has been studied widely since the late fifties. Public services can also take advantage of these systems in order to improve their logistics chain. Garbage collection, or town cleaning, takes an ever increasing part of the budget of local authorities A typical vehicle routing problem can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points cities, stores, warehouses, schools, customers etc. The routes must be designed in such a way that each point is visited only once by exactly one vehicle, all routes start and end at the depot, and the total demands of all points on one route must not exceed the capacity of the vehicle The Vehicle Routing Problem with Time WindowsVRPTW is a generalization of the VRP involving the added complexity that every customer should be served within a given time window. Additional complexities encountered in the VRPTW are length of route constraint arising from depot time windows and cost of waiting time, which is incurred when a vehicle arrives too early at a customer location. Specific examples of problems with time windows include bank deliveries, postal deliveries, industrial refuse collection, school-bus routing and situations where the customer must provide access, verification, or payment upon delivery of the product or service[Solomon and Desrosiers, 1988]. Besides being one of the most important prob