有能力车辆路径问题的两种模型

IF 0.4 Q4 ECONOMICS

Croatian Operational Research Review Pub Date : 2017-12-06 DOI:10.17535/CRORR.2017.0029

Zuzana Borčinová, Slovakia Žilina

{"title":"有能力车辆路径问题的两种模型","authors":"Zuzana Borčinová, Slovakia Žilina","doi":"10.17535/CRORR.2017.0029","DOIUrl":null,"url":null,"abstract":"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 dierences 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 ow 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.","PeriodicalId":44065,"journal":{"name":"Croatian Operational Research Review","volume":"8 1","pages":"463-469"},"PeriodicalIF":0.4000,"publicationDate":"2017-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.17535/CRORR.2017.0029","citationCount":"46","resultStr":"{\"title\":\"Two models of the capacitated vehicle routing problem\",\"authors\":\"Zuzana Borčinová, Slovakia Žilina\",\"doi\":\"10.17535/CRORR.2017.0029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 dierences 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 ow 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.\",\"PeriodicalId\":44065,\"journal\":{\"name\":\"Croatian Operational Research Review\",\"volume\":\"8 1\",\"pages\":\"463-469\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2017-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.17535/CRORR.2017.0029\",\"citationCount\":\"46\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Croatian Operational Research Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17535/CRORR.2017.0029\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Croatian Operational Research Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17535/CRORR.2017.0029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}

引用次数: 46

摘要

有能力车辆路线问题(CVRP)的目标是为一组有能力车辆找到一组总成本最低的路线，这些路线以一个仓库为基地，为一组客户提供服务。CVRP存在各种整数线性规划模型。其中一个主要区别在于消除子行程的方式，即不经过仓库的循环。在本文中，我们描述了一个众所周知的CVRP的低公式，其中子巡回消除约束的基数随着客户数量呈指数增长。在此基础上，提出了子行程消去约束具有多项式基数的混合线性规划公式。这两种模型都在几个基准上实现并进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Two models of the capacitated vehicle routing problem

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 dierences 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 ow 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Croatian Operational Research Review ECONOMICS-

CiteScore

1.40

自引率

0.00%

发文量

审稿时长

22 weeks

期刊介绍： Croatian Operational Research Review (CRORR) is the journal which publishes original scientific papers from the area of operational research. The purpose is to publish papers from various aspects of operational research (OR) with the aim of presenting scientific ideas that will contribute both to theoretical development and practical application of OR. The scope of the journal covers the following subject areas: linear and non-linear programming, integer programing, combinatorial and discrete optimization, multi-objective programming, stohastic models and optimization, scheduling, macroeconomics, economic theory, game theory, statistics and econometrics, marketing and data analysis, information and decision support systems, banking, finance, insurance, environment, energy, health, neural networks and fuzzy systems, control theory, simulation, practical OR and applications. The audience includes both researchers and practitioners from the area of operations research, applied mathematics, statistics, econometrics, intelligent methods, simulation, and other areas included in the above list of topics. The journal has an international board of editors, consisting of more than 30 editors – university professors from Croatia, Slovenia, USA, Italy, Germany, Austria and other coutries.