2E-TVRP instances

Published: 17 June 2020| Version 3 | DOI: 10.17632/szb5x6xw53.3
Contributor:
Hongqi LI

Description

We use 140 randomly-generated instances to verify the effectiveness of the models and the heuristic. The number (denoted as n) of CDCs (including the central depot) was 3, 4, 5 or 10. In an instance, suppose the numbers of satellites served by each CDC (denoted as num_C) are the same, and cargo sources (i.e., CDCs) needed by any satellite served by a CDC (denoted as SL_type_num) are the same. A satellite demand may include cargoes that are provided by more than one CDC. Time windows of satellites served by a CDC are generated by the method provided by Solomon (1987). All instances are classified by n, num_C and SL_type_num. There are 5 different instances for the same n, num_C and SL_type_num. All instances (in Table 2) can be obtained by emailing the corresponding author.

Files

Institutions

Beihang University

Categories

Vehicle Routing Problem

License