New Exact Iterative Method for the Capacitated Vehicle Routing Problem

  • Zuzana Borcinova
  • Stefan Pesko
Keywords: capacitated vehicle routing problem, mixed linear programming model

Abstract

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.

Author Biographies

Zuzana Borcinova

Department of Mathematical Methods and Operations Research, Faculty of Management Science and Informatics, University of Zilina, Slovakia

Stefan Pesko

Department of Mathematical Methods and Operations Research, Faculty of Management Science and Informatics, University of Zilina, Slovakia

Published
2016-09-30
How to Cite
Borcinova, Z., & Pesko, S. (2016). New Exact Iterative Method for the Capacitated Vehicle Routing Problem. Communications - Scientific Letters of the University of Zilina, 18(3), 19-21. Retrieved from http://journals.uniza.sk/index.php/communications/article/view/303
Issue
Vol 18 No 3 (2016)
Section
Articles