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 条
  • [21] An Objective Penalty Function-Based Method for Inequality Constrained Minimization Problem
    Lian, Shujun
    Meng, Sitong
    Wang, Yiju
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
  • [22] A GSA based hybrid algorithm for bi-objective workflow scheduling in cloud computing
    Choudhary, Anubhav
    Gupta, Indrajeet
    Singh, Vishakha
    Jana, Prasanta K.
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 83 : 14 - 26
  • [23] A bi-objective task scheduling approach in fog computing using hybrid fireworks algorithm
    Ashish Mohan Yadav
    Kuldeep Narayan Tripathi
    S. C. Sharma
    The Journal of Supercomputing, 2022, 78 : 4236 - 4260
  • [24] A bi-objective task scheduling approach in fog computing using hybrid fireworks algorithm
    Yadav, Ashish Mohan
    Tripathi, Kuldeep Narayan
    Sharma, S. C.
    JOURNAL OF SUPERCOMPUTING, 2022, 78 (03): : 4236 - 4260
  • [25] Augmented ε-constraint-based matheuristic methodology for Bi-objective production scheduling problems
    Fan, Jiaxin
    IET COLLABORATIVE INTELLIGENT MANUFACTURING, 2024, 6 (04)
  • [26] The Effect of Worker Learning on Scheduling Jobs in a Hybrid Flow Shop: A Bi-Objective Approach
    Farzad Pargar
    Mostafa Zandieh
    Osmo Kauppila
    Jaakko Kujala
    Journal of Systems Science and Systems Engineering, 2018, 27 : 265 - 291
  • [27] An Equivalent Penalty Coefficient Method: An Adaptive Penalty Approach for Population-Based Constrained Optimization
    Takahama, Tetsuyuki
    Sakai, Setsuko
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 1620 - 1627
  • [28] A bi-objective function optimization approach for multiple sequence alignment using genetic algorithm
    Biswanath Chowdhury
    Gautam Garai
    Soft Computing, 2020, 24 : 15871 - 15888
  • [29] A bi-objective function optimization approach for multiple sequence alignment using genetic algorithm
    Chowdhury, Biswanath
    Garai, Gautam
    SOFT COMPUTING, 2020, 24 (20) : 15871 - 15888
  • [30] A bi-objective optimization for finance-based and resource-constrained robust project scheduling
    Liu, Wanlin
    Zhang, Jingwen
    Liu, Cuifang
    Qu, Chunli
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 231