Rapport-NEONetworkingandEmergingOptimization.docVIP

SINTEF REPORT TITLE Route Construction and Local Search Algorithms for the Vehicle Routing Problem with Time Windows SINTEF Applied Mathematics Address: P.O.Box 124, Blindern 0314 Oslo NORWAY Location: Forskningsveien 1 Telephone: +47 22 06 73 00 Fax: +47 22 06 73 50 Enterprise No.: NO 948 007 029 MVA AUTHOR(S) Olli Br?ysy and Michel Gendreau CLIENT(S) SINTEF Applied Mathematics, Research Council of Norway REPORT NO. CLASSIFICATION CLIENTS REF. STF42 A01024 Open TOP – 140689/420 CLASS. THIS PAGE ISBN PROJECT NO. NO. OF PAGES/APPENDICES Open 82-14-01614-228/0 ELECTRONIC FILE CODE PROJECT MANAGER (NAME, SIGN.) CHECKED BY (NAME, SIGN.) Local_VRPTW_Report.doc Geir Hasle Geir Hasle FILE CODE DATE APPROVED BY (NAME, POSITION, SIGN.) 2001-12-18 Geir Hasle, Research Director ABSTRACT This report presents a survey of research on the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval, all routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. Both traditional heuristic route construction methods and recent local search algorithms are examined. The basic features of each method are described, and experimental results for Solomon’s benchmark test problems are presented and analyzed. Moreover, we discuss how heuristic methods should be evaluated and propose using the concept of Pareto optimality in the comparison of different heuristic approaches. The metaheuristic methods are described in Br?ysy and Gendreau (2001). KEYWORDS ENGLISH NORWEGIAN GROUP 1 Computer Science Datateknikk GROUP 2 Optimization Optimering SELECTED BY AUTHOR Vehicle Routing Problem (VRP) Ruteplanlegging Constructi