Vehicle routing with time windows: Two optimization algorithms
成果类型：
Article
署名作者：
Fisher, ML; Jornsten, KO; Madsen, OBG
署名单位：
Norwegian School of Economics (NHH); Technical University of Denmark
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.45.3.488
发表日期：
1997
页码：
488-492
关键词：
摘要：
We describe two optimization methods for vehicle routing problems with time windows. These are a K-Tree relaxation with time windows added as side constraints and a Lagrangian decomposition in which variable splitting is used to divide the problem into two subproblems-a semi-assignment problem and a series of shortest path problems with time windows and capacity constraints. We present optimal solutions to problems with up to 100 customers.