On the Landscape of a Problem of Finding Satisfactory Metaheuristics - PowerPoint PPT Presentation

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work On the Landscape of a Problem of Finding Satisfactory Metaheuristics Jos´ e M. Cecilia, Baldomero Imbern´ on Bioinformatics and High Performance Computing Research Group (BIO-HPC), Polytechnic School, Universidad Cat´ olica San Antonio of Murcia (UCAM), Spain Jos´ e-Mat´ ıas Cutillas-Lozano, Domingo Gim´ enez Department of Computing and Systems, University of Murcia, Spain XIII Congreso Espa˜ nol de Metaheur´ ısticas, Algoritmos Evolutivos y Bioinspirados, Granada, 24 octubre 2018

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Outline Motivation 1 The underlying problems 2 The hyperheuristic 3 Experiments 4 Conclusions and future work 5

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Motivation Hyperheuristic on top of a metaheuristic scheme: repeated application of metaheuristics to the optimization problem to be solved → high computational cost. Landscape analysis to guide the hyperheuristic. Two problems as case studies: Molecule-Docking Problem (MDP). Determination of Kinetic Constants in a chemical reaction (KCP).

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Molecule-Docking Problem Virtual screening processes based on the calculation of a scoring function to measure the interaction between a set of chemical compounds ( ligands ) and a protein ( receptor ). Several points in the receptor ( spots ), where ligands may independently couple.

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Molecule-Docking Problem Fitness or scoring function calculates the binding energy between the atoms of the protein and the ligand, e.g. the Lennard-Jones potential: �� � 6 � � 12 � σ σ V ( i , j ) = 4 ǫ − r ( i , j ) r ( i , j ) where σ and ǫ are empirical constants of the model, and r ( i , j ) is the distance between atoms i and j . The search space is determined by the degrees of freedom of the protein and the ligand (six, three for translation and three for the rotation movements of the ligand) and the flexibility junctions of the ligand.

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Determination of Kinetic Constants The search for the kinetic parameters of a chemical reaction in heterogeneous phase. Depending on the pH, three main ways in which the dissolution of calcium carbonate occurs: By reaction with acetic acid. CaCO 3 + H 3 O + ↔ Ca 2+ + HCO − 3 + H 2 O By reaction with carbonic acid. CaCO 3 + H 2 CO 3 ↔ Ca 2+ + 2 · HCO − 3 And by the hydrolysis reaction. CaCO 3 + H 2 O ↔ Ca 2+ + HCO − 3 + OH −

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Determination of Kinetic Constants When the reaction occurs in several independent pathways, the overall rate is simply the sum of all the individual rates. So, the kinetic of dissolution of calcium carbonate is a function of the concentration of carbonic acid in the solution, the pH and the mass transfer area: 1 dN Ca 2+ H 3 O + � n 2 − k 2 a n 3 [ H 2 CO 3 ] n 4 − k 3 = − k 1 a n 1 � V dt k 1 , k 2 and k 3 are the combined reaction rate constants. n 1 , n 2 , n 3 and n 4 are the reaction orders. a is the area of the tablet.

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Determination of Kinetic Constants An individual is represented by a real vector of size seven, which contains the set of kinetic constants. The ranges of values for the constants are set according to empirical criteria. Every time the fitness of an individual is calculated, the whole chemical system is solved: for i = 0 → N do Calculate at instant i : Ca 2+ � , a , [ H 3 O + ] , [ HCO − ] , [ H 2 CO 3 ] , pH cal , ∆ Ca 2+ � � � , [ CH 3 COOH ] , [ CH 3 COO − ] Fitness = Fitness + ( pH exp , i − pH cal , i ) 2 end for

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Parameterized metaheuristic schema Initialize( S ,ParamIni) while ( not EndCondition( S ,ParamEnd)) SS = Select( S ,ParamSel) SS 1 = Combine( SS ,ParamCom) SS 2 = Improve( SS 1,ParamImp) S = Include( SS 2,ParamInc) The values of the metaheuristic parameters determine the metaheuristic or combination of metaheuristics. Hyperheuristics are implemented with the same schema, and search for satisfactory metaheuristics implemented with the schema (satisfactory values of the metaheuristic parameters).

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Structure of the hyperheuristic

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Metaheuristic parameters routine parameter meaning MDP KCP Initialize INEIni Initial Number of Elements X X PEIIni Percentage of Elements to Improve X X IIEIni Intensification in the Improvement of Elements X X IIEFlex Intensification due to Flexibility X NBEIni Number of Best Elements for the next iterations X X NWEIni Number of Worst Elements for the next iterations X Select NBESel Number of Best Elements for combination X X NWESel Number of Worst Elements for combination X X Combine NBBCom Number of Best-Best elements combinations X X NBWCom Number of Best-Worst elements combinations X X NWWCom Number of Worst-Worst elements combinations X X Improve PEIImp Percentage of Elements generated to be Improved X X IIEImp Intensification in the Improvement of Elements generated X X IIEFlex same value as in Initialize X PEDImp Percentage of Elements to be Diversified and improved X X IIDImp Intensification in the Improvement of Elements Diversified X X IIEFlex same value as in Initialize X Include NBEInc Number of Best Elements to include in the reference set X X

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Basic functions Initialize: In MDP one set per spot. In MDP selection of the best and worst elements for the next iterations. In KCP selection of the best elements, and the reference set is completed with elements selected randomly. Combine: MDP: an element obtained as the mean of the parameters of the parents. KCP: crossing at a middle point. Improvement functions: The same parameter IIEFlex is used in the three improvement functions of MDP to search for neighbors by rotation on the junctions.

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Hyperheuristic implementation Metaheuristic parameters: MDP: INEIni between 20 and 200, for other parameters between 0 and 100. KCP: INEIni and FNEIni between 20 and 200; intensification parameters between 0 and 50; other parameters between 0 and 100. Fitness obtained through the application of each metaheuristic to just one instance of the problem (for low experimentation time). The hyperheuristic with the same parameterized schema, with smaller values for the parameters. Combination crossing at a middle point. When an invalid configuration is generated, it is discarded. Neighbors obtained by adding or subtracting 1 in one position of the vector of metaheuristic parameters. Diversification generating a random value for one position on the vector.

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Experiments set-up For each problem, analysis of the fitness for three instances of the problem and 100 metaheuristics. Instances for MDP: pair #atoms receptor #atoms ligand #junctions ACE 9198 59 13 GPB 13261 29 1 PARP 5588 32 3 Fitness recorded at intervals of 30 seconds, from 30 to 600, for MDP 5 seconds, from 5 to 100, for KCP.

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Aspects to be analyzed We want to reduce the execution time of the hyperheuristic. We analyze: Influence of each parameter on the fitness (could reduce the search interval of the parameters). Variation of the influence of the parameters with the execution time (could limit the application time of metaheuristics). Comparison of the results with different problems (the number of training problems could be reduced).

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Evolution of the fitness with the distance to the best metaheuristic Variation of the fitness with the distance to the optimum vector. � � � p | v i − w i | i =1 u i − l i d ( v , w ) = p p is the number of parameters, u i and l i the upper and lower values of the range for the generation of parameter i . Dotted: single metaheuristics; Thick: in groups of ten metaheuristics. MDP and PARP, after 600 seconds. KCP and EXP1, after 100 seconds.

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Evolution of the correlation coefficient of the parameters with the fitness, MDP

Motivation The underlying problems The hyperheuristic Experiments Conclusions and future work Evolution of the correlation coefficient of the parameters with the fitness, MDP The most influential parameters: NEIFlex for the configurations with more flexible junctions;