Two models of the capacitated vehicle routing problem
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 th...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Croatian Operational Research Society
2017-01-01
|
| Series: | Croatian Operational Research Review |
| Online Access: | http://hrcak.srce.hr/file/285563 |