메뉴 건너뛰기




Volumn 18, Issue 7, 2014, Pages 1383-1397

Improved RM-MEDA with local learning

Author keywords

Estimation of distribution algorithm; Local learning; Multi objective optimization problem

Indexed keywords

ALGORITHMS; PARETO PRINCIPLE;

EID: 84902356973     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-013-1151-2     Document Type: Article
Times cited : (19)

References (53)
  • 3
    • 77957584426 scopus 로고    scopus 로고
    • The r-dominance: a new dominance relation for interactive evolutionary multicriteria decision making
    • BenSaid L, Bechikh S, Ghedira K (2010) The r-dominance: a new dominance relation for interactive evolutionary multicriteria decision making. IEEE Trans Evol Comput 14(5): 801-818.
    • (2010) IEEE Trans Evol Comput , vol.14 , Issue.5 , pp. 801-818
    • BenSaid, L.1    Bechikh, S.2    Ghedira, K.3
  • 4
    • 24344484399 scopus 로고    scopus 로고
    • The 3rd international conference on evolutionary multi-criterion optimization (EMO 2005), LNCS, Springer, Berlin
    • Bosman PAN, Thierens D (2005) The naive MIDEA: a base line multi-objective EA. The 3rd international conference on evolutionary multi-criterion optimization (EMO 2005), LNCS, vol 3410. Springer, Berlin, pp 428-442.
    • (2005) The naive MIDEA: A base line multi-objective EA , vol.3410 , pp. 428-442
    • Bosman, P.A.N.1    Thierens, D.2
  • 7
    • 0003050299 scopus 로고    scopus 로고
    • The Pareto-envelope based selection algorithm for multiobjective optimization
    • Lecture notes in computer science, Springer, Berlin
    • Corne DW, Knowles J, Oates M (2000a) The Pareto-envelope based selection algorithm for multiobjective optimization. In: Parallel problem solving from nature (PPSN-VI). Lecture notes in computer science, vol 1917. Springer, Berlin, pp 869-878.
    • (2000) Parallel problem solving from nature (PPSN-VI) , vol.1917 , pp. 869-878
    • Corne, D.W.1    Knowles, J.2    Oates, M.3
  • 12
  • 15
    • 78049295629 scopus 로고    scopus 로고
    • An ant colony optimization algorithm for the biobjective shortest path problem
    • Ghoseiria K, Nadjari B (2010) An ant colony optimization algorithm for the biobjective shortest path problem. Appl Soft Comput 10(4): 1237-1246.
    • (2010) Appl Soft Comput , vol.10 , Issue.4 , pp. 1237-1246
    • Ghoseiria, K.1    Nadjari, B.2
  • 18
    • 0032141635 scopus 로고    scopus 로고
    • A multi-objective genetic local search algorithm and its application to flowshop scheduling
    • Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybern Part C Appl Rev 28(3): 392-403.
    • (1998) IEEE Trans Syst Man Cybern Part C Appl Rev , vol.28 , Issue.3 , pp. 392-403
    • Ishibuchi, H.1    Murata, T.2
  • 19
    • 84858073966 scopus 로고    scopus 로고
    • Multi-objective biogeography based optimization for optimal PMU placement
    • Jamuna K, Swarup KS (2012) Multi-objective biogeography based optimization for optimal PMU placement. Appl Soft Comput 12(5): 1457-1620.
    • (2012) Appl Soft Comput , vol.12 , Issue.5 , pp. 1457-1620
    • Jamuna, K.1    Swarup, K.S.2
  • 20
    • 0037116765 scopus 로고    scopus 로고
    • Genetic local search for multiple objective combinatorial optimization
    • Jaszkiewicz A (2002) Genetic local search for multiple objective combinatorial optimization. Eur J Oper Res 137(1): 50-71.
    • (2002) Eur J Oper Res , vol.137 , Issue.1 , pp. 50-71
    • Jaszkiewicz, A.1
  • 21
    • 0038612886 scopus 로고    scopus 로고
    • Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem
    • Jaszkiewicz A (2003) Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem. IEEE Trans Evol Comput 7(2): 133-143.
    • (2003) IEEE Trans Evol Comput , vol.7 , Issue.2 , pp. 133-143
    • Jaszkiewicz, A.1
  • 22
    • 0348139702 scopus 로고    scopus 로고
    • Dimension reduction by local principal component analysis
    • Kambhatla N, Leen TK (1997) Dimension reduction by local principal component analysis. Neural Comput 9: 1493-1516.
    • (1997) Neural Comput , vol.9 , pp. 1493-1516
    • Kambhatla, N.1    Leen, T.K.2
  • 24
    • 0034199912 scopus 로고    scopus 로고
    • Approximating the non-dominated front using the Pareto archived evolution strategy
    • Knowles JD, Corne DW (2000) Approximating the non-dominated front using the Pareto archived evolution strategy. Evol Comput 8: 149-172.
    • (2000) Evol Comput , vol.8 , pp. 149-172
    • Knowles, J.D.1    Corne, D.W.2
  • 28
    • 84944313970 scopus 로고    scopus 로고
    • Bayesian optimization algorithm for multi-objective optimization
    • Lecture notes in computer science, Springer, Berlin
    • Laumanns M, Ocenasek J (2002) Bayesian optimization algorithm for multi-objective optimization. In: Parallel problem solving from nature (PPSN-VII). Lecture notes in computer science, vol 2439, pp 298-307. Springer, Berlin.
    • (2002) Parallel problem solving from nature (PPSN-VII) , vol.2439 , pp. 298-307
    • Laumanns, M.1    Ocenasek, J.2
  • 29
    • 0036715683 scopus 로고    scopus 로고
    • Combining convergence and diversity in evolutionary multi-objective optimization
    • Laumanns M, Thiele L, Deb K, Zitzler E (2002) Combining convergence and diversity in evolutionary multi-objective optimization. Evol Comput 10(3): 263-282.
    • (2002) Evol Comput , vol.10 , Issue.3 , pp. 263-282
    • Laumanns, M.1    Thiele, L.2    Deb, K.3    Zitzler, E.4
  • 30
    • 67349108023 scopus 로고    scopus 로고
    • Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II
    • Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 12(2): 284-302.
    • (2009) IEEE Trans Evol Comput , vol.12 , Issue.2 , pp. 284-302
    • Li, H.1    Zhang, Q.2
  • 34
    • 0000448376 scopus 로고
    • Genetic algorithms, tournament selection, and the effects of noise
    • Miller BL, Goldberg DE (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Syst 9(3): 193-212.
    • (1995) Complex Syst , vol.9 , Issue.3 , pp. 193-212
    • Miller, B.L.1    Goldberg, D.E.2
  • 35
    • 84958959530 scopus 로고    scopus 로고
    • From recombination of genes to the estimation of distributions I. Binary parameters
    • Lecture notes in computer science, Springer, Berlin
    • Mühlenbein H, Paass G (1996) From recombination of genes to the estimation of distributions I. Binary parameters. In: Parallel problem solving from nature (PPSN-IV). Lecture notes in computer science, vol 1141, pp 178-187. Springer, Berlin.
    • (1996) Parallel problem solving from nature (PPSN-IV) , vol.1141 , pp. 178-187
    • Mühlenbein, H.1    Paass, G.2
  • 37
    • 0034547299 scopus 로고    scopus 로고
    • A survey of optimization by building and using probabilistic model
    • Pelikan M, Goldberg D, Lobo F (2000a) A survey of optimization by building and using probabilistic model. Proc Am Control Conf 5: 3289-3293.
    • (2000) Proc Am Control Conf , vol.5 , pp. 3289-3293
    • Pelikan, M.1    Goldberg, D.2    Lobo, F.3
  • 38
    • 0034276591 scopus 로고    scopus 로고
    • Linkage problem, distribution estimation, and Bayesian networks
    • Pelikan M, Goldberg DE, Cantu-Paz E (2000b) Linkage problem, distribution estimation, and Bayesian networks. Evol Comput 8: 311-340.
    • (2000) Evol Comput , vol.8 , pp. 311-340
    • Pelikan, M.1    Goldberg, D.E.2    Cantu-Paz, E.3
  • 41
    • 33847647183 scopus 로고    scopus 로고
    • Co-evolving memetic algorithms: a review and progress report
    • Smith J (2007) Co-evolving memetic algorithms: a review and progress report. IEEE Trans Syst Man Cybern Part B Cybern 37(1): 6-17.
    • (2007) IEEE Trans Syst Man Cybern Part B Cybern , vol.37 , Issue.1 , pp. 6-17
    • Smith, J.1
  • 42
    • 0000852513 scopus 로고
    • Multiobjective optimization using non-dominated sorting in genetic algorithms
    • Srinivas N, Deb K (1994) Multiobjective optimization using non-dominated sorting in genetic algorithms. Evol Comput 2: 221-248.
    • (1994) Evol Comput , vol.2 , pp. 221-248
    • Srinivas, N.1    Deb, K.2
  • 44
    • 84865853865 scopus 로고    scopus 로고
    • A regularity model-based multiobjective estimation of distribution algorithm with reducing redundant cluster operator
    • Wang Y, Xiang J, Cai ZX (2012) A regularity model-based multiobjective estimation of distribution algorithm with reducing redundant cluster operator. Appl Soft Comput 12(11): 3526-3538.
    • (2012) Appl Soft Comput , vol.12 , Issue.11 , pp. 3526-3538
    • Wang, Y.1    Xiang, J.2    Cai, Z.X.3
  • 45
    • 17644405107 scopus 로고    scopus 로고
    • An Evolutionary algorithm with guided mutation for the maximum clique problem
    • Zhang Q, Sun J, Tsang E (2005) An Evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans Evol Comput 9(2): 192-200.
    • (2005) IEEE Trans Evol Comput , vol.9 , Issue.2 , pp. 192-200
    • Zhang, Q.1    Sun, J.2    Tsang, E.3
  • 46
    • 33847649620 scopus 로고    scopus 로고
    • Evolutionary algorithms refining a heuristic: a hybrid method for shared-path protections in WDM networks under SRLG constraints
    • Zhang Q, Sun J, Xiao G, Tsang E (2007a) Evolutionary algorithms refining a heuristic: a hybrid method for shared-path protections in WDM networks under SRLG constraints. IEEE Trans Syst Man Cybern Part B Cybern 37: 51-61.
    • (2007) IEEE Trans Syst Man Cybern Part B Cybern , vol.37 , pp. 51-61
    • Zhang, Q.1    Sun, J.2    Xiao, G.3    Tsang, E.4
  • 48
    • 40249102027 scopus 로고    scopus 로고
    • RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm
    • Zhang Q, Zhou A, Jin Y (2008) RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12: 41-63.
    • (2008) IEEE Trans Evol Comput , vol.12 , pp. 41-63
    • Zhang, Q.1    Zhou, A.2    Jin, Y.3
  • 51
    • 0033318858 scopus 로고    scopus 로고
    • Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
    • Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3: 257-271.
    • (1999) IEEE Trans Evol Comput , vol.3 , pp. 257-271
    • Zitzler, E.1    Thiele, L.2
  • 52
    • 0034199979 scopus 로고    scopus 로고
    • Comparison of multiobjective evolution algorithms: empirical results
    • Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolution algorithms: empirical results. IEEE Trans Evol Comput 8: 173-195.
    • (2000) IEEE Trans Evol Comput , vol.8 , pp. 173-195
    • Zitzler, E.1    Deb, K.2    Thiele, L.3


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