New Exact Iterative Method for the Capacitated Vehicle Routing Problem

Communications

Zuzana Borcinova¹  Stefan Pesko¹ 

[1] Department of Mathematical Methods and Operations Research, Faculty of Management Science and Informatics, University of Zilina, Slovakia;

关键词: capacitated vehicle routing problem;    mixed linear programming model;   

DOI  :  10.26552/com.C.2016.3.19-21

来源: DOAJ

【 摘 要 】

The aim of the Capacitated Vehicle Routing Problem is to find a set of minimum total cost routes for a fleet of capacitated vehicles, to serve a set of customers. This problem belongs into category of NP hard problems that can be exactly solved only for small instances. In this paper we propose an exact iterative method for the CVRP based on the solution of Mixed Linear Programming model, which is able to solve problem for relatively larger instances in acceptable computing time.

【 授权许可】

Unknown