Metaheuristics for reliable server assignment problems
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper,we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinearinteger programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure ofservice availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliableserver assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all testproblems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind ofreliability optimization problems including reliable sever assignment and e-Navigation system.
Abstract
Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper,we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinearinteger programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure ofservice availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliableserver assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all testproblems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind ofreliability optimization problems including reliable sever assignment and e-Navigation system.
참고문헌 (16)
- A. Konak, "Reliable sever assignment in networks using nature inspired metaheuristics", IEEE Transactions On Reliability, 60(2), pp.381~393 (2011)
- S. L. Hakimi, "Optimum locations of switching centers and absolute centers and median of graph", Operations Research, 12(3), pp.450~459 (1964)
- Z. Drener, "Heuristic solution methods for two location problems with unreliable facilities", Journal of the Operational Research Society, 38(6), pp.509~514 (1987)
- L. D. Nel, "Locating a broadcast facility in an unreliable network", INFOR, 28(4), pp.363~379 (1990)
- E. Melachrinoudis, "A single facility location problem on a tree with unreliable edges", Networks, 27(3), pp.219~237 (1996)
- A. Nakaniwa, "Reliability-based optimal allocation of mirror servers for internet", IEEE Global Telecommunications Conference, pp.1571~1577 (2000)
- L. V. Snyder, "Reliability models for facility location : The expected failure cost case", Transportation Science, 39(3), pp.400~416 (2005)
- H. A. Eiselt, "Location of facilities on a network subject to a single-edge failure", Networks, 22(3), pp.231~246 (1992)
- M. Ball, "Complexity of network reliability computations", Networks, 10(2), pp.153~165 (1980)
- H. A. Eiselt, "Optimal location of facilities on a network with an unreliable node or link", Information Processing Letters, 58(2), pp.71~74 (1996)
- O. Berman, "Locating service facilities whose reliability is distance dependent", Computers and Operations Research, 30(11), pp.1683~1695 (2003)
- A. Nakaniwa, "Reliability-based mirroring of servers in distributed networks", IEICE Transactions on Communications, E85-B(2), pp.540~549 (2002)
- F. Glover, "Future paths for integer programming and links to artificial intelligence", Computers and Operations Research, 13(5), pp.533~549 (1986)
- W. C. Yeh, "A two-stage discrete PSO for the problem of multiple multi-level redundancy allocation in series systems", Expert Systems with Applications, 36(5), pp.9192~9200 (2009)
- R. C. Eberhart, "A new optimizer using particle swarwm theory", Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp.39~43 (1995)
- J. Kennedy, "Discrete binary version of the particle swarm algorithm", Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp.4104~4108 (1997)