Research Article
Hybrid Genetic Algorithms for the Asymmetric Distance-Constrained Vehicle Routing Problem
Table 1
List of notations that will be used in this study.
| Notation | Description |
| | Number of cities (or customers or nodes) | | Set of cities, where “city 0” is the depot | | Number of vehicles | | Distance matrix | | The traveled distance from city i to city j | | Maximum traveled distance-constrained | | The decision binary variable that is equal to 1 if a vehicle travels from city i to city j and 0 otherwise | | The variable that presents the shortest distance traveled from the depot to city j, where i is the predecessor of j |
|
|