Browse > Article
http://dx.doi.org/10.5916/jkosme.2014.38.10.1340

Metaheuristics for reliable server assignment problems  

Jang, Kil-Woong (Department of Data Information)
Kim, Jae-Hwan (Department of Data Information, Korea Maritime and Ocean University)
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 nonlinear integer programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure of service availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliable server assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all test problems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind of reliability optimization problems including reliable sever assignment and e-Navigation system.
Keywords
Reliable server assignment; Tabu search; Particle swarm optimization;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. A. Eiselt, M. Gendreau, and G. Laporte, "Optimal location of facilities on a network with an unreliable node or link," Information Processing Letters, vol. 58, no. 2, pp. 71-74, 1996.   DOI   ScienceOn
2 O. Berman, Z. Drezner, and G. O. Wesolowsky, "Locating service facilities whose reliability is distance dependent," Computers and Operations Research, vol. 30, no. 11, pp. 1683-1695, 2003.   DOI   ScienceOn
3 A. Nakaniwa, J. Takahashi, H. Ebara, and H. Okada, "Reliability-based mirroring of servers in distributed networks," IEICE Transactions on Communications, vol. E85-B, no. 2, pp. 540-549, 2002.
4 F. Glover, "Future paths for integer programming and links to artificial intelligence," Computers and Operations Research, vol. 13, no. 5, pp. 533-549, 1986   DOI   ScienceOn
5 W. C. Yeh, "A two-stage discrete PSO for the problem of multiple multi-level redundancy allocation in series systems," Expert Systems with Applications, vol. 36, no. 5, pp. 9192-9200, 2009.   DOI   ScienceOn
6 R. C. Eberhart and J. Kennedy, "A new optimizer using particle swarwm theory," Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39-43, 1995.
7 J. Kennedy and R. C. Eberhart, "Discrete binary version of the particle swarm algorithm," Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 4104-4108, 1997.
8 A. Konak and S. Kulturel-Konak, "Reliable sever assignment in networks using nature inspired metaheuristics," IEEE Transactions On Reliability, vol. 60, no. 2, pp. 381-393, 2011.   DOI   ScienceOn
9 S. L. Hakimi, "Optimum locations of switching centers and absolute centers and median of graph," Operations Research, vol. 12, no. 3, pp .450-459, 1964.   DOI   ScienceOn
10 Z. Drener, "Heuristic solution methods for two location problems with unreliable facilities," Journal of the Operational Research Society, vol. 38, no. 6, pp. 509-514, 1987.   DOI
11 L. D. Nel and C. J. Colbourn, "Locating a broadcast facility in an unreliable network," INFOR, vol. 28, no. 4, pp. 363-379, 1990.
12 E. Melachrinoudis and M. E. Helander, "A single facility location problem on a tree with unreliable edges," Networks, vol. 27, no. 3, pp. 219-237, 1996.   DOI
13 A. Nakaniwa, J. Takahashi, H. ebara, and H. Okada, "Reliability-based optimal allocation of mirror servers for internet," IEEE Global Telecommunications Conference, pp. 1571-1577, 2000.
14 L. V. Snyder and M. S. Daskin, "Reliability models for facility location: The expected failure cost case," Transportation Science, vol. 39, no. 3, pp. 400-416, 2005.   DOI   ScienceOn
15 H. A. Eiselt, M. Gendreau, and G. Laporte, "Location of facilities on a network subject to a single-edge failure," Networks, vol. 22, no. 3, pp. 231-246. 1992.   DOI
16 M. Ball, "Complexity of network reliability computations," Networks, vol. 10, no. 2, pp. 153-165, 1980.   DOI