A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem
Abstract The Asymmetric Distance-Constrained Vehicle Routing Problem (ADVRP) is NP-hard as it is a natural extension of the NP-hard Vehicle Routing Problem. In ADVRP problem, each customer is visited exactly once by a vehicle; every tour starts and ends at a depot; and the traveled distance by each...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2021-01-01
|
| Series: | Computational Social Networks |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s40649-020-00084-7 |