Constraint Handling Using the Self-Adaptive Penalty Function (SAPF) Approach

2021 ◽  
pp. 49-59
Author(s):  
Ishaan R. Kale ◽  
Anand J. Kulkarni
2014 ◽  
Vol 5 (2) ◽  
pp. 54-79 ◽  
Author(s):  
Ahmad Mozaffari ◽  
Mehrzad Ebrahimnejad

In this investigation, the authors intend to demonstrate the applicability of a recent spotlighted metaheuristic called the great salmon run (TGSR) algorithm for shape and size design of truss structures. The algorithmic functioning of TGSR emulates the annual migration of salmons together with dangers laid through their pathways. In a previous study by the authors, it has been proved that the method is as effective as most of the state-of-the-art metaheuristics for a wide range of numerical benchmark problems. Here, the authors utilize TGSR together with some rival metaheuristics, i.e. bee algorithm (BA), scale factor local search differential evolutionary algorithm (SFLSDEA), chaotic particle swarm optimization (CPSO) algorithm, self adaptive penalty function genetic algorithm (SAPFGA) and mutable smart bee algorithm (MSBA), for optimal design of truss structures with dynamic frequency constraints. To effectively handle the constraints, the authors take the advantage of self-adaptive penalty function (SAPF) constraint handling technique to free the user from any priori penalty coefficient tuning. Therefore, an algorithm for automation of constraint shape and size design of truss structures is proposed here. Furthermore, for more elaboration, the authors consider the results of some previous reports for same problems to find out whether TGSR is capable of yielding comparative results as compared to other metaheuristics. Through the experiments, the exploration/exploitation capabilities of TGSR for truss design are investigated. It is proved that TGSR is not only able to handle the nonlinearities and decision making difficulties associated with shape and size optimization of truss structures but also can show comparative results as compared to powerful state-of-the-art metaheuristics.


Author(s):  
Ishaan R. Kale ◽  
Anand J. Kulkarni

AbstractRecently, several socio-/bio-inspired algorithms have been proposed for solving a variety of problems. Generally, they perform well when applied for solving unconstrained problems; however, their performance degenerates when applied for solving constrained problems. Several types of penalty function approaches have been proposed so far for handling linear and non-linear constraints. Even though the approach is quite easy to understand, the precise choice of penalty parameter is very much important. It may further necessitate significant number of preliminary trials. To overcome this limitation, a new self-adaptive penalty function (SAPF) approach is proposed and incorporated into socio-inspired Cohort Intelligence (CI) algorithm. This approach is referred to as CI–SAPF. Furthermore, CI–SAPF approach is hybridized with Colliding Bodies Optimization (CBO) algorithm referred to as CI–SAPF–CBO algorithm. The performance of the CI–SAPF and CI–SAPF–CBO algorithms is validated by solving discrete and mixed variable problems from truss structure domain, design engineering domain, and several problems of linear and nonlinear in nature. Furthermore, the applicability of the proposed techniques is validated by solving two real-world applications from manufacturing engineering domain. The results obtained from CI–SAPF and CI–SAPF–CBO are promising and computationally efficient when compared with other nature inspired optimization algorithms. A non-parametric Wilcoxon’s rank sum test is performed on the obtained statistical solutions to examine the significance of CI–SAPF–CBO. In addition, the effect of the penalty parameter on pseudo-objective function, penalty function and constrained violations is analyzed and discussed along with the advantages over other algorithms.


2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Geng Lin ◽  
Wenxing Zhu ◽  
M. Montaz Ali

Hardware/software (HW/SW) partitioning is to determine which components of a system are implemented on hardware and which ones on software. It is one of the most important steps in the design of embedded systems. The HW/SW partitioning problem is an NP-hard constrained binary optimization problem. In this paper, we propose a tabu search-based memetic algorithm to solve the HW/SW partitioning problem. First, we convert the constrained binary HW/SW problem into an unconstrained binary problem using an adaptive penalty function that has no parameters in it. A memetic algorithm is then suggested for solving this unconstrained problem. The algorithm uses a tabu search as its local search procedure. This tabu search has a special feature with respect to solution generation, and it uses a feedback mechanism for updating the tabu tenure. In addition, the algorithm integrates a path relinking procedure for exploitation of newly found solutions. Computational results are presented using a number of test instances from the literature. The algorithm proves its robustness when its results are compared with those of two other algorithms. The effectiveness of the proposed parameter-free adaptive penalty function is also shown.


Author(s):  
Xinghuo Yu ◽  
◽  
Baolin Wu

In this paper, we propose a novel adaptive penalty function method for constrained optimization problems using the evolutionary programming technique. This method incorporates an adaptive tuning algorithm that adjusts the penalty parameters according to the population landscape so that it allows fast escape from a local optimum and quick convergence toward a global optimum. The method is simple and computationally effective in the sense that only very few penalty parameters are needed for tuning. Simulation results of five well-known benchmark problems are presented to show the performance of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document