A redundancy allocation problem by using utility function method and ant colony optimization: tradeoff between availability and total cost

2019 ◽  
Vol 10 (3) ◽  
pp. 416-428 ◽  
Author(s):  
Ali Salmasnia ◽  
Sadegh Noori ◽  
Hadi Mokhtari
Keyword(s):  
Utility Function ◽  
Ant Colony Optimization ◽  
Function Method ◽  
Allocation Problem ◽  
Ant Colony ◽  
Redundancy Allocation Problem ◽  
Redundancy Allocation ◽  
Total Cost

Efficiently Solving the Redundancy Allocation Problem Using Tabu Search

2003 ◽  
Vol 35 (6) ◽  
pp. 515-526 ◽  
Author(s):  
Sadan Kulturel-Konak ◽  
Alice E. Smith ◽  
David W. Coit
Keyword(s):  
Tabu Search ◽  
Allocation Problem ◽  
Redundancy Allocation Problem ◽  
Redundancy Allocation

Hybrid ant colony optimization for capacitated multiple-allocation cluster hub location problem

2017 ◽  
Vol 32 (1) ◽  
pp. 44-58 ◽  
Author(s):  
Mohammad Mirabi ◽  
Parya Seddighi
Keyword(s):  
Ant Colony Optimization ◽  
Location Problem ◽  
Demand Management ◽  
Telecommunication Networks ◽  
Ant Colony ◽  
Hub Location ◽  
Hub Location Problem ◽  
Total Cost ◽  
Wide Range ◽  
Cost Of Transportation

AbstractThe hub location problems involve locating facilities and designing hub networks to minimize the total cost of transportation (as a function of distance) between hubs, establishing facilities and demand management. In this paper, we consider the capacitated cluster hub location problem because of its wide range of applications in real-world cases, especially in transportation and telecommunication networks. In this regard, a mathematical model is presented to address this problem under capacity constraints imposed on hubs and transportation lines. Then, a new hybrid algorithm based on simulated annealing and ant colony optimization is proposed to solve the presented problem. Finally, the computational experiments demonstrate that the proposed heuristic algorithm is both effective and efficient.

Sign in / Sign up

Export Citation Format

Share Document