Abstract—Hubs are critical elements that benefit networks by switching, distributing and concentrating flows. A hub location problem is common in a lot of industries, such as transportation networks, telecommunication networks, postal delivery networks and express shipment. Furthermore, a transportation network plays a vital role in each country. Nonetheless, during a day many factors such as traffic incidence, natural disasters cause some degradation in the transportation network. As a result, in this paper, we study a reliable hub covering location problem in a degradable transportation network to minimize the total transportation cost. For achieving near-optimal solutions for a real-sized problem an imperialism competitive algorithm (ICA) is proposed. Also the effectiveness of the proposed ICA is shown by some computational experiments. At last, conclusion is provided.
Index Terms—Hub location, road, capacity reliability, chance-constraint method, imperialism competitive algorithm.
The authors are with School of Industrial Engineering, Collage of Engineering, University of Tehran, Tehran, Iran (email: email@example.com, firstname.lastname@example.org).
Cite: Marjan Sadeghi and Reza Tavakkoli-Moghaddam, "An Efficient Imperialism Competitive Algorithm for a Reliable Hub Covering Location Problem," International Journal of Machine Learning and Computing vol. 5, no. 1, pp. 40-43, 2015.