Abstract
The continuous Constrained Optimization Problem (COP) often occurs in industrial applications. In this study, we compare three novel algorithms developed for solving the COP.The first approach consists of an Interval Partitioning Algorithm (IPA) that is exhaustive in covering the whole feasible space. IPA has the capability of discarding sub-spaces that are sub-optimal and/or infeasible, similar to available Branch and Bound techniques. The difference of IPA lies in its use of Interval Arithmetic rather than conventional bounding techniques described in the literature. The second approach tested here is the novel dual-sequence Simulated Annealing (SA) algorithm that eliminates the use of penalties for constraint handling. Here, we also introduce a hybrid algorithm that integrates SA in IPA (IPA-SA) and compare its performance with stand-alone SA and IPA algorithms. All three methods have a local COP solver, Feasible Sequential Quadratic Programming (FSQP) incorporated so as to identify feasible stationary points. The performances of these three methods are tested on a suite of COP benchmarks and the results are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
