Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2017.0029
Two models of the capacitated vehicle routing problem
Zuzana Borčinova
; Faculty of Management Science and Informatics, University of Zilina, Univerzitna 8215/1, 010 026 Zilina, Slovakia
Sažetak
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.
Ključne riječi
Capacitated Vehicle Routing Problem; linear programming model
Hrčak ID:
193543
URI
Datum izdavanja:
30.12.2017.
Posjeta: 10.427 *