AN EFFICIENT ARTIFICIAL BEE COLONY ALGORITHM FOR A P-HUB COVERING LOCATION PROBLEM WITH TRAVEL TIME RELIABILITY

Authors

  • Marjan Sadeghi
  • Reza Tavakkoli Moghaddam
  • Reza Babazadeh

DOI:

https://doi.org/10.23055/ijietap.2018.25.1.3159

Abstract

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, as in a form of daily traffic, earthquake, flood, etc. Stochastic degradations cause some uncertainties in a network, such as travel time uncertainty. 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 performances are compared with a differential evolution (DE) algorithm. Finally, some computational experiments are provided to demonstrate the effectiveness of the proposed model and solution approaches.

 

Published

2018-02-28

How to Cite

Sadeghi, M., Tavakkoli Moghaddam, R., & Babazadeh, R. (2018). AN EFFICIENT ARTIFICIAL BEE COLONY ALGORITHM FOR A P-HUB COVERING LOCATION PROBLEM WITH TRAVEL TIME RELIABILITY. International Journal of Industrial Engineering: Theory, Applications and Practice, 25(1). https://doi.org/10.23055/ijietap.2018.25.1.3159