摘要

This paper addresses a new reliable p-hub covering location problem (p-HLP) in a degradable transportation network. The capacity of links is assumed as uniform random variables subject to stochastic degradations because of daily traffic, earthquake, flood, etc. Stochastic degradations cause some uncertainties in a network, such as uncertain travel time. As a result, this paper tackles with uncertainty in a degradable network by the stochastic programming and travel time budget concept. An artificial bee colony (ABC) algorithm is proposed to solve real-sized instances, and its performance is compared with a differential evolution (DE) algorithm. Finally, some computational experiments are provided to demonstrate the effectiveness of the proposed model and solution approaches.

  • 出版日期2018