期刊
CROATIAN OPERATIONAL RESEARCH REVIEW
卷 8, 期 2, 页码 463-469出版社
CROATIAN OPERATIONAL RESEARCH SOC
DOI: 10.17535/crorr.2017.0029
关键词
Capacitated Vehicle Routing Problem; linear programming model
类别
资金
- Scientific Grant Agency of the Ministry of Education of the Slovak Republic [VEGA 1/0518/15]
- Slovak Academy of Sciences [VEGA 1/0518/15]
The aim of the Capacitated Vehicle Routing Problem (CVRP) is to find a set of minimum total cost routes for a fleet of capacitated vehicles based at a single depot, to serve a set of customers. There exist various integer linear programming models of the CVRP. One of the main differences lies in the way to eliminate sub-tours, i.e. cycles that do not go through the depot. In this paper, we describe a well-known flow formulation of CVRP, where sub-tour elimination constraints have a cardinality exponentially growing with the number of customers. Then we present a mixed linear programming formulation with polynomial cardinality of sub-tour elimination constraints. Both of the models were implemented and compared on several benchmarks.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据