期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 262, 期 1, 页码 151-162出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2017.03.033
关键词
Vehicle routing; Column generation; Dynamic programming; Integer programming; COIN-OR
In this paper, we present an exact method for the demand weighted vehicle routing problem. This problem arises when the objective is to minimize the distance traveled by the vehicles weighted by the number of passengers on the routes. The resulting model is a non-convex, mixed-integer quadratic program and we show how to reformulate this problem as a linear integer program with auxiliary variables. The reformulation provides very tight lower bounds on the optimal solution value and little enumeration is required. However, the reformulated model is very large and therefore, it is solved with a branch, price and cut algorithm. Using COIN-OR software, we provide computational results with actual data from a large urban university. (C) 2017 Elsevier E.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据