期刊
TRANSPORTATION SCIENCE
卷 43, 期 4, 页码 408-416出版社
INFORMS
DOI: 10.1287/trsc.1090.0301
关键词
vehicle routing problem; traveling salesman problem; exact algorithms; heuristics; metaheuristics; survey
资金
- Canadian Natural Sciences and Engineering Research Council [05-39682]
The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title The Truck Dispatching Problem. The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据