New Exact Iterative Method for the Capacitated Vehicle Routing Problem
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 e...
| Published in: | Communications |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2016-09-01
|
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-201603-0003_new-exact-iterative-method-for-the-capacitated-vehicle-routing-problem.php |
| Summary: | 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. |
|---|---|
| ISSN: | 1335-4205 2585-7878 |