Distance-constrained vehicle routing problem : exact and approximate solution (mathematical programming)
The asymmetric distance-constrained vehicle routing problem (ADVRP) looks at finding vehicle tours to connect all customers with a depot, such that the total distance is minimised; each customer is visited once by one vehicle; every tour starts and ends at a depot; and the travelled distance by each...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Brunel University
2013
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577891 |