英语论文 车辆优化调度.pdfVIP

4OR-Q J Oper Res (2010) 8:221–238 DOI 10.1007/s10288-010-0144-6 INVITED SURVEY Recent progress of local search in handling the time window constraints of the vehicle routing problem Hideki Hashimoto · Mutsunori Yagiura · Shinji Imahori · Toshihide Ibaraki Received: 31 May 2010 / Revised: 23 August 2010 / Published online: 10 September 2010 © Springer-Verlag 2010 Abstract Vehicle routing and scheduling problems have a wide range of applica- tions and have been intensively studied in the past half century. The condition that enforces each vehicle to start service at each customer in the period specified by the customer is called the time window constraint. This paper reviews recent results on how to handle hard and soft time window constraints, putting emphasis on its different definitions and algorithms. With these diverse time windows, the problem becomes applicable to a wide range of real-world problems. Keywords Vehicle routing · Time windows · Scheduling · Survey MSC classification (2000) 90B35 · 90C27 · 65K05 · 90B06 · 90-02 H. Hashimoto ( ) B Department of Industrial and Systems Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551, Japan e-mail: hasimoto@indsys.chuo-u.ac.jp M. Yagiura Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Furocho, Chikusa-ku, Nagoya 464-8603, Japan e-mail: yagiura@nagoya-u.jp S. Imahori Department of Computational Science and Engineering, Graduate School of Engineering, Nagoya University, Furocho, Chikusa-ku, Nagoya 464-8603, Japan e-mail: imahori@na.cse.nagoya-u.ac.jp T. Ibaraki The Kyoto College of Graduate Studies for Informatics, 7 Monzencho, Tanaka, Sakyo-ku, Kyoto 606-8225, Japan e-mail: ibaraki@ieee.org 123 222