2010 A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation英文资料.pdf

informs ® Vol. 44, No. 4, November 2010, pp. 442–454 issn 0041-1655 eissn 1526-5447 10 4404 0442 doi 10.1287/trsc.1100.0331 © 2010 INFORMS A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation A. L. Kok Algorithmic RD, ORTEC, 2800 AL Gouda, The Netherlands, leendert.kok@ C. M. Meyer, H. Kopfer Faculty of Business Studies and Economics, University of Bremen, 28359 Bremen, Germany {cmmeyer@uni-bremen.de, kopfer@uni-bremen.de} J. M. J. Schutten Operational Methods for Production and Logistics, University of Twente, 7500 AE Enschede, The Netherlands, m.schutten@utwente.nl In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding feasible driver schedules complying with complex restrictions on drivers’ driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose a restricted dynamic pro- gramming heuristic for the vehicle routing problem with time windows and the full European social legislation on drivers’ driving and working h