An ant colony optimization approach to the multi-vehicle prize-collecting arc routing for connectivity problem

Benchmark instances for road network repair and restoration problems in the context of disaster response operations

“…Similar to previous authors who studied KPC-ARCP (e.g. Akbari and Salman [6] and Souza Almeida and Goerlandt [7] ), the suggested traversing speed is 50 km/h. Note that this speed is only for traversing a road, and it is not the same as the clearing rate of the teams.…”

“…Thus, the intensity of the edge is assumed to be the probability calculated in its midpoint. For example, if the intensity of the midpoint of edge [1 , 2] is 0.06, then edge (1,2) has intensity of 0.06. The relevant parameters the mechanism to determine what roads in the network are blocked, are specified in Table 3 .…”

“…The disaster intensity is specified with “M” for medium impact and “H” for high impact. When the disaster occurs, it is assumed that the initial network is subdivided into multiple disconnected subnetworks called “components”, as defined in the previous studies of KPC-ARCP [6] , [7] , [8] . The second number in the instance name refers to the exact number of components of the damaged network.…”

Emerging Data-Driven Calibration Research on an Improved Link Performance Function in an Urban Area

“…Therefore, it is necessary to recalibrate the function according to the traffic flow data in different spatial and temporal environments [14][15][16][17][18][19][20]. Parameter calibration problems have also been extensively studied in the transportation field [14,[21][22][23][24][25][26][27][28][29][30].…”