coPSSA - Constrained Parallel Stretched Simulated Annealing

Parallel Stretched Simulated Annealing (PSSA) solves unconstrained multilocal programming optimization problems in distributed memory clusters, by applying the Stretched Simulated Annealing optimization method, in parallel, to multiple sub-domains of the original feasible region. This work presents coPSSA (constrained Parallel Stretched Simulated Annealing), an hybrid application that combines shared memory based parallelism with PSSA, in order to efficiently solve constrained multilocal programming problems. We devise and evaluate two different parallel strategies for the search of solutions to these problems. Evaluation results from a small set of test problems often reach superlinear speedup in the solution search time, thus proving the merit of the coPSSA parallelization approach.

[1]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[2]  M. N. Vrahatis,et al.  Objective function “stretching” to alleviate convergence to local minima , 2001 .

[3]  C. J. Price,et al.  Numerical experiments in semi-infinite programming , 1996, Comput. Optim. Appl..

[4]  Patrick Siarry,et al.  A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions , 2000, J. Heuristics.

[5]  Saïd Salhi,et al.  A hybrid algorithm for identifying global and local minima when optimizing functions with many minima , 2004, Eur. J. Oper. Res..

[6]  Jasbir S. Arora,et al.  A comparison of global optimization algorithms applied to a ride comfort optimization problem , 2002 .

[7]  Christodoulos A. Floudas,et al.  Recent advances in global optimization for process synthesis, design and control: Enclosure of all solutions , 1999 .

[8]  L. Ingber.  Very fast simulated re-annealing , 1989 .

[9]  Ana I. Pereira,et al.  Constrained Multi-global Optimization using a Penalty Stretched Simulated Annealing Framework , 2009 .

[10]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[11]  Zhun Fan,et al.  Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique , 2009 .

[12]  José Rufino,et al.  PSSA: Parallel Stretched Simulated Annealing , 2011 .

[13]  Elena Kiseleva,et al.  On the Efficiency of a Global Non-differentiable Optimization Algorithm Based on the Method of Optimal Set Partitioning , 2003, J. Glob. Optim..

[14]  Teresa León,et al.  A multi-local optimization algorithm , 1998 .

[15]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

[16]  I. Lagaris,et al.  Gradient–Controlled, Typical–Distance Clustering for Global Optimization , 2022 .

[17]  Ana I. Pereira,et al.  Multilocal Programming and Applications , 2013, Handbook of Optimization.

[18]  Stephen J. Wright,et al.  Numerical Optimization (Springer Series in Operations Research and Financial Engineering) , 2000 .

[19]  José Rufino,et al.  Solving Multilocal Optimization Problems with a Recursive Parallel Search of the Feasible Region , 2014, ICCSA.

[20]  R. W. Mayne,et al.  Studies of multi‐start clustering for global optimization , 2002 .