Communications - Scientific Letters of the University of Zilina 2016, 18(3):19-21 | DOI: 10.26552/com.C.2016.3.19-21

New Exact Iterative Method for the Capacitated Vehicle Routing Problem

Zuzana Borcinova1, Stefan Pesko1
1 Department of Mathematical Methods and Operations Research, Faculty of Management Science and Informatics, University of Zilina, Slovakia

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.

Keywords: capacitated vehicle routing problem; mixed linear programming model

Published: September 30, 2016  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
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. doi: 10.26552/com.C.2016.3.19-21
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. LAPORTE, G.: What You Should Know about the Vehicle Routing Problem, Naval Research Logistics, 54: 811-819, 2007. Go to original source...
    2. TOTH, P., VIGO, D.: Models, Relaxations and Exact Approaches tor Capacitated Vehicle Routing Problem, Discrete Applied Mathematics, 123: 487-512, 2002. Go to original source...
    3. LAPORTE, G.: The Vehicle Routing Problem: An Overview of Exact dnd Approximate Algorithms, European J. of Operational Research 59: 345-358, 1992. Go to original source...
    4. KARA, I.: Tightening Bounding Constraints of the Miller-Tucker-Zemlin Based Formulation of the Capacitated Vehicle Routing Problems and Some Extensions, Proc. of the 2nd intern. conference on Manufacturing Engineering, Quality and Production Systems, edited by C. Panait et al., WSEAS Press, Constantza, 2010, pp.137-142. Go to original source...
    5. The Python Language Reference, 1990 - 2016, Python Software Foundation, http://docs.python.org/3/.
    6. Gurobi Optimizer Reference Manual, version 6.5, 2016, Gurobi Optimization, Inc., http://www.gurobi.com.
    7. Branch Cut and Price Resource Web, Vehicle Routing Data Sets USA, http://www.coin-or.org/SYMPHONY/branchandcut/VRP/data/.

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content