首页 | 本学科首页   官方微博 | 高级检索  
     


A powerful route minimization heuristic for the vehicle routing problem with time windows
Authors:Yuichi Nagata,Olli Br  ysy
Affiliation:aInterdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, 4259 Nagatsuta Midori-ku Yokohama, Kanagawa 226-8502, Japan;bAgora Innoroad Laboratory, Agora Center, P.O. Box 35, FI-40014 University of Jyväskylä, Finland
Abstract:We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger’s benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions.
Keywords:Vehicle routing   Heuristics   Time windows   Guided local search
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号