A surrogate-assisted (SA) evolutionary algorithm for Multiobjective Optimization Problems (MOOPs) is presented as a contribution to Soft Computing (SC) in Artificial Intelligence (AI). Such algorithm is grounded on the cooperation between a “pure” evolutionary algorithm and a Kriging based algorithm featuring the Expected Hyper-Volume Improvement (EHVI) metric. Comparison with state-of-art pure and Kriging-assisted algorithms over two- and three-objective test functions have demonstrated that the proposed algorithm can achieve high performance in the approximation of the Pareto-optimal front mitigating the drawbacks of its parent algorithms.
A Kriging-assisted multiobjective evolutionary algorithm
	
	
	
		
		
		
		
		
	
	
	
	
	
	
	
	
		
		
		
		
		
			
			
			
		
		
		
		
			
			
				
				
					
					
					
					
						
							
						
						
					
				
				
				
				
				
				
				
				
				
				
				
			
			
		
			
			
				
				
					
					
					
					
						
							
						
						
					
				
				
				
				
				
				
				
				
				
				
				
			
			
		
			
			
				
				
					
					
					
					
						
						
							
							
						
					
				
				
				
				
				
				
				
				
				
				
				
			
			
		
		
		
		
	
Venturelli, GiovanniWriting – Review & Editing
;Benini, Ernesto
						
						
						
							Methodology
;
	
		
		
	
			2017
Abstract
A surrogate-assisted (SA) evolutionary algorithm for Multiobjective Optimization Problems (MOOPs) is presented as a contribution to Soft Computing (SC) in Artificial Intelligence (AI). Such algorithm is grounded on the cooperation between a “pure” evolutionary algorithm and a Kriging based algorithm featuring the Expected Hyper-Volume Improvement (EHVI) metric. Comparison with state-of-art pure and Kriging-assisted algorithms over two- and three-objective test functions have demonstrated that the proposed algorithm can achieve high performance in the approximation of the Pareto-optimal front mitigating the drawbacks of its parent algorithms.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.




