Algorithm 4 shows the pseudo-code of G-ERMP The al-gorithm has as input the set of scenarios ξ the vector ofvehicles with their request size ri and their capacity CiThe output consists of the set of p

, since |ξ| is typically much smaller than |V|3. Thus, the time complexity of G-ERMP is polynomial in the number of vehicles and scenarios.

原文地址: https://www.cveoy.top/t/topic/eIO1 著作权归作者所有。请勿转载和采集!