Grouping genetic algorithm for solving the server consolidation problem with conflicts

2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09

Volumn , Issue , 2009, Pages 1-8

  Agrawal, Shubham ^a   Bose, Sumit Kumar ^b   Sundarrajan, Srikanth ^b  

^a The University of Texas at Austin   (United States)

^b INFOSYS TECHNOLOGIES LTD   (India)

Author keywords

Enterprise grid; Grouping genetic algorithm; Incompatibility constraints; Vector packing problem with conflicts (VPC); Virtualization

Indexed keywords

ENTERPRISE GRID; GROUPING GENETIC ALGORITHM; INCOMPATIBILITY CONSTRAINTS; VECTOR PACKING PROBLEM WITH CONFLICTS (VPC); VIRTUALIZATION;

CALCULATIONS; GENETIC ALGORITHMS; MOBILE TELECOMMUNICATION SYSTEMS; SEMICONDUCTING GERMANIUM COMPOUNDS;

SERVERS;

EID: 67650699822     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1543834.1543836     Document Type: Conference Paper

References (17)

1. Phelps, J, "Server Consolidation can offer a range of benefits", White Paper, Gartner Inc, (2004).
2. Ajiro, Y., Tanaka, A., "A Combinatorial optimization algorithm for server consolidation", In: Proceedings of the 21st annual conference of the Japanese Society for Artificial Intelligence (2007)
3. Zhang, A., Safari, F., Beyer, D., "Applying Bin-packing algorithms to server consolidation", In: Proceedings of the Informs annual meeting in San Francisco (2005)
4. Gupta, R., Bose, S. K., Sundarrajan, S., Chebiyam, M., Chakrabarti, A., "A two stage heuristic algorithm for solving server consolidation problem with Item-Item and Bin-Item Incompatibility Constraints", In: Proceedings of IEEE Services Computing, Hawaii, USA, pp. 39 - 46 (2008)
5. Chu, C., La, R., "Variable-sized bin packing: Tight absolute worst case performance ratios for four approximation algorithms", SIAM journal of computing. 30, 2069-2083 (2001)
6. Kang, J., Park, S., "Algorithms for the variable sized bin packing problem", European Journal of Operational Research. 147, 365-372 (2003)
7. Gendreau, M., Laporte, G., Semet, F., "Heuristics and Lower bounds for the bin-packing problem with conflicts", Computers and Operations Research, 31, 347-358 (2004).
8. Epstein, L., Levin, A., "On bin packing with conflicts", math.haifa.ac.il/lea/bpc.pdf
9. Jansen, K., "An approximations scheme for bin-packing with conflicts", Journal of combinatorial optimization. 3, 363-377 (1999)
10. Falkenauer, E. Genetic Algorithms and Grouping Problems. John Wiley & Sons Ltd., (1998).
11. J. Holland. Adoption in natural and artificial systems. The MIT press, (1975).
12. H.P Schwefel, G. Rudolph., Contemporary evolution strategies. Advances in artificial life. 893 - 907 (1995)
13. Grefenstette, J., Gopal, R., Rosmaita, B. J., Van Gucht, D., "Genetic Algorithms for the Traveling Salesman Problem", In: Proceedings of the 1st International Conference on Genetic Algorithms, pp. 160-168 (1985)
14. Ahuja, R. K., Orlin, J. B., Tiwari, A., "A greedy genetic algorithm for the quadratic assignment problem", Computers and Operations Research. 27, 917-934 (2000)
15. Cheng, R., Genb, M., Tsujimura, Y., "A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies", Computers and Industrial Engineering. 36, 343-364 (1999)
16. Goldberg, D. E. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co. Boston, MA, USA (1989).
17. Falkenauer, E., "A hybrid grouping genetic algorithm for bin packing", Journal of Heuristics. 2, 5-30 (2004).