An Adaptive Normalization based Constrained Handling Methodology with Hybrid Bi-Objective and Penalty Function Approach

被引:0
|
作者
Datta, Rituparna [1 ]
Deb, Kalyanmoy [1 ]
机构
[1] Indian Inst Technol, Dept Mech Engn, Kanpur 208018, Uttar Pradesh, India
关键词
EVOLUTIONARY ALGORITHMS; OPTIMIZATION;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A hybrid adaptive normalization based constraint handling approach is proposed in the present study. In most constrained optimization problems, constraints may be of different scale. Normalization of constraints is crucial for the efficient performance of a constraint handling algorithm. A growing number of researchers have proposed different strategies using bi-objective methodologies. Classical penalty function approach is another common method among both evolutionary and classical optimization research communities due to its simplicity and ease of implementation. In the present study, we propose a hybrid approach of both bi-objective method and the penalty function approach where constraints are normalized adaptively during the optimization process. The proposed bi-objective evolutionary method estimates the penalty parameter and the starting solution needed for the penalty function approach. We test and compare our algorithm on seven mathematical test problems and two engineering design problems taken from the literature. We compare our obtained results with our previous studies in terms of function evaluations and solution accuracy. The obtained optima are also compared with those of other standard algorithms. In many cases, our proposed methodology perform better than all algorithms considered in this study. Results are promising and motivate further application of the proposed adaptive normalization strategy.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Individual Penalty Based Constraint handling Using a Hybrid Bi-Objective and Penalty Function Approach
    Datta, Rituparna
    Deb, Kalyanmoy
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 2720 - 2727
  • [2] A bi-objective constrained optimization algorithm using a hybrid evolutionary and penalty function approach
    Deb, Kalyanmoy
    Datta, Rituparna
    ENGINEERING OPTIMIZATION, 2013, 45 (05) : 503 - 527
  • [3] A Bi-objective Hybrid Constrained Optimization (HyCon) Method Using a Multi-Objective and Penalty Function Approach
    Datta, Rituparna
    Deb, Kalyanmoy
    Segev, Aviv
    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 317 - 324
  • [4] A Fast and Accurate Solution of Constrained Optimization Problems Using a Hybrid Bi-Objective and Penalty Function Approach
    Deb, Kalyanmoy
    Datta, Rituparna
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [5] Constrained Engineering Design Optimization Using a Hybrid Bi-objective Evolutionary-Classical Methodology
    Datta, Rituparna
    SIMULATED EVOLUTION AND LEARNING, 2010, 6457 : 633 - 637
  • [6] A Bi-objective Based Hybrid Evolutionary-Classical Algorithm for Handling Equality Constraints
    Datta, Rituparna
    Deb, Kalyanmoy
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, 2011, 6576 : 313 - 327
  • [7] A Hybrid Evolutionary Algorithm Based on Dominated Clustering for Constrained Bi-Objective Optimization Problems
    Fan, Lei
    Liang, Yanfang
    Liu, Xiyang
    Gu, Xin
    PROCEEDINGS OF 2016 12TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2016, : 543 - 546
  • [8] A bi-objective approach for scheduling ground-handling vehicles in airports
    Padron, Silvia
    Guimarans, Daniel
    Jose Ramos, Juan
    Fitouri-Trabelsi, Salma
    COMPUTERS & OPERATIONS RESEARCH, 2016, 71 : 34 - 53
  • [9] Two-Stage Adaptive Constrained Particle Swarm Optimization Based on Bi-Objective Method
    Feng, Qian
    Li, Qing
    Wang, Heng
    Feng, Yongfeng
    Pan, Yichen
    IEEE ACCESS, 2020, 8 : 150647 - 150664
  • [10] Hybrid genetic algorithm for bi-objective resource-constrained project scheduling
    Fikri Kucuksayacigil
    Gündüz Ulusoy
    Frontiers of Engineering Management, 2020, 7 : 426 - 446