메뉴 건너뛰기




Volumn , Issue , 2011, Pages 362-369

Solving virtual machine packing with a Reordering Grouping Genetic Algorithm

Author keywords

Bin Packing; Genetic Algorithm; Virtualization

Indexed keywords

BIN PACKING; BIN PACKING PROBLEM; GROUPING GENETIC ALGORITHMS; MULTI-CONSTRAINTS; TEST SETS; VIRTUAL MACHINES; VIRTUALIZATIONS;

EID: 80051995797     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2011.5949641     Document Type: Conference Paper
Times cited : (67)

References (15)
  • 1
    • 3543061170 scopus 로고    scopus 로고
    • A hybrid improvment heuristic for the one-dimensional bin packing problem
    • F. Glover A. C. F. Alvim, C. C. Ribeiro and D. J. Aloise. A hybrid improvment heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10:4-27, 2004.
    • (2004) Journal of Heuristics , vol.10 , pp. 4-27
    • Glover, F.1    Alvim, A.C.F.2    Ribeiro, C.C.3    Aloise, D.J.4
  • 2
    • 0031185499 scopus 로고    scopus 로고
    • A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
    • R. Klein A. Scholl and C. J. Bison. A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers and Operations Research, 24(7):627-645, 1997.
    • (1997) Computers and Operations Research , vol.24 , Issue.7 , pp. 627-645
    • Klein, R.1    Scholl, A.2    Bison, C.J.3
  • 4
    • 0030174048 scopus 로고    scopus 로고
    • A hybrid grouping genetic algorithm for bin packing
    • E. Faulkenaeur. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30, 1996.
    • (1996) Journal of Heuristics , vol.2 , pp. 5-30
    • Faulkenaeur, E.1
  • 5
    • 0036604755 scopus 로고    scopus 로고
    • New heuristics for one-dimensional bin-packing
    • DOI 10.1016/S0305-0548(00)00082-4, PII S0305054800000824
    • K. Fleszar and K. S. Hindi. New heuristics for one-dimensional bin packing. Computers and Operations Research, 29:821-839, 2002. (Pubitemid 34135092)
    • (2002) Computers and Operations Research , vol.29 , Issue.7 , pp. 821-839
    • Fleszar, K.1    Hindi, K.S.2
  • 7
    • 34147175335 scopus 로고    scopus 로고
    • Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints
    • Washington, DC, USA, IEEE Computer Society
    • William Leinberger, George Karypis, and Vipin Kumar. Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints. In ICPP'99: Proceedings of the 1999 International Conference on Parallel Processing, page 404, Washington, DC, USA, 1999. IEEE Computer Society.
    • (1999) ICPP'99: Proceedings of the 1999 International Conference on Parallel Processing , pp. 404
    • Leinberger, W.1    Karypis, G.2    Kumar, V.3
  • 11
    • 34548090783 scopus 로고    scopus 로고
    • A genetic algorithm with exon shuffling crossover for hard bin packing problems
    • DOI 10.1145/1276958.1277213, Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference
    • P. Rohlfshagen and J. Bullinaria. A genetic algorithm with exon shuffling crossover for hard bin packing problems. Proceedings of Genetic And Evolutionary Computation Conference, 9:1365-1371, 2007. (Pubitemid 47291704)
    • (2007) Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference , pp. 1365-1371
    • Rohlfshagen, P.1    Bullinaria, J.A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.