메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1675-1682

Multi-objective combinatorial optimisation with coincidence algorithm

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE SOLUTION; COMBINATORIAL OPTIMISATION; MULTI OBJECTIVE; MULTI-OBJECTIVE PROBLEM; OPTIMIZATION ALGORITHMS; PROBABILISTIC MODELS; SELECTION METHODS;

EID: 70450015259     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4983143     Document Type: Conference Paper
Times cited : (25)

References (22)
  • 3
    • 4243898698 scopus 로고    scopus 로고
    • Combining multiple optimization runs with optimal dependency trees
    • Carnegie Melon University
    • Baluja, S. and Davies, S.: Combining Multiple Optimization Runs with Optimal Dependency Trees. Technical Report CMU-CS-97-157, Carnegie Melon University (1997).
    • (1997) Technical Report CMU-CS-97-157
    • Baluja, S.1    Davies, S.2
  • 5
    • 0003984832 scopus 로고
    • Population based incremental learning: A method for integrating genetic search-based function optimization and competitive learning
    • Baluja, S.: Population Based Incremental Learning: A Method for Integrating Genetic Search-Based Function Optimization and Competitive Learning. Technical Report CMU-CS-94-163, Carnegie Mellon University (1994).
    • (1994) Technical Report CMU-CS-94-163, Carnegie Mellon University
    • Baluja, S.1
  • 6
    • 0346254780 scopus 로고    scopus 로고
    • Fast probabilistic modeling for combinatorial optimization
    • Baluja, S. and Davies, S.: Fast Probabilistic Modeling for Combinatorial Optimization. In AAAI-98 (1998).
    • (1998) AAAI-98
    • Baluja, S.1    Davies, S.2
  • 7
    • 84933530882 scopus 로고
    • Approximating discrete probability distributions with dependency trees
    • Chow, C. and Liu, C.: Approximating Discrete Probability Distributions with Dependency trees. IEEE Transactions on Information Theory, 14: 462-467. (1967).
    • (1967) IEEE Transactions on Information Theory , vol.14 , pp. 462-467
    • Chow, C.1    Liu, C.2
  • 9
    • 36849087310 scopus 로고    scopus 로고
    • Combining bayesian classifiers and estimation of distribution algorithms for optimization in continuous domains
    • T. Miquelez, E. Bengoetxea, A. Mendiburu, P. Larrañaga Combining Bayesian classifiers and estimation of distribution algorithms for optimization in continuous domains. Connection Science, 19(4), 297-319. (2007).
    • (2007) Connection Science , vol.19 , Issue.4 , pp. 297-319
    • Miquelez, T.1    Bengoetxea, E.2    Mendiburu, A.3    Larrañaga, P.4
  • 12
    • 40249102027 scopus 로고    scopus 로고
    • RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm
    • Q. Zhang, A. Zhou, and Y. Jin, RM-MEDA: A Regularity Model- Based Multiobjective Estimation of Distribution Algorithm, IEEE Trans. Evoutionaryl.Computation., vol.21, no.1, pp. 41-63, (2008).
    • (2008) IEEE Trans. Evoutionaryl.Computation. , vol.21 , Issue.1 , pp. 41-63
    • Zhang, Q.1    Zhou, A.2    Jin, Y.3
  • 14
    • 0031215849 scopus 로고    scopus 로고
    • The equation for response to selection and its use for prediction
    • Mühlenbein, H.: The Equation for Response to Selection and Its Use for Prediction. Evolutionary Computation, 5: 303-346. (1998).
    • (1998) Evolutionary Computation , vol.5 , pp. 303-346
    • Mühlenbein, H.1
  • 15
    • 0002307386 scopus 로고    scopus 로고
    • Global optimization with bayesian networks
    • CIMAF99. Special Session on Distributions and Evolutionary Optimization
    • Etxeberria, R. and Larranga, P.: Global Optimization with Bayesian Networks. In II Symposium on Artificial Intelligence. CIMAF99. Special Session on Distributions and Evolutionary Optimization, pages 322-339. (1999).
    • (1999) II Symposium on Artificial Intelligence , pp. 322-339
    • Etxeberria, R.1    Larranga, P.2
  • 18
    • 0039397863 scopus 로고    scopus 로고
    • Genetic algorithms for the travelling salesman problem: A review of representations and operators
    • Larrañaga, P., Kujipers, C.M. H., Murga, R.H., Inza, I., and Dizdarevic, S.: Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13: 129-170. (1999).
    • (1999) Artificial Intelligence Review , vol.13 , pp. 129-170
    • Larrañaga, P.1    Kujipers, C.M.H.2    Murga, R.H.3    Inza, I.4    Dizdarevic, S.5
  • 20
    • 0000804223 scopus 로고
    • A computing procedure for a line balancing problem management
    • Jackson, J.R.: A Computing Procedure for a Line Balancing Problem. Management Science. Vol.2, No.3: pp.261-271. (1956).
    • (1956) Science , vol.2 , Issue.3 , pp. 261-271
    • Jackson, J.R.1
  • 21
    • 70450065207 scopus 로고    scopus 로고
    • A multi-decision genetic approach for workload balancing of mixed-model U-shaped assembly line systems
    • Hwang, R. and H. Katayama, A Multi-Decision Genetic Approach for Workload Balancing of Mixed-Model U-shaped Assembly Line Systems, International Journal of Production Research: 1-26 (2007).
    • (2007) International Journal of Production Research , pp. 1-26
    • Hwang, R.1    Katayama, H.2
  • 22
    • 70449957481 scopus 로고    scopus 로고
    • th)
    • th, 2008).
    • (2008) TSPLIB


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