Taguchi's method is a quality design technique whose applications in numerical single-objective optimization have been recently exploited. In this article, a novel multi-objective (MO) algorithm based on Taguchi's technique is illustrated and its performances assessed. Validation is performed through a comparison between the presented algorithm and a MO genetic algorithm (GA) based optimization, first on different sets of test functions and then on a practical antenna array synthesis problem. Results indicate a generally better behavior of the proposed algorithm in terms of convergence and spreading over the Pareto front with respect to the GA benchmark.

Taguchi's method for multi-objective optimization problems / E. Agastra; G. Pelosi; S. Selleri; R. Taddei. - In: INTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING. - ISSN 1096-4290. - STAMPA. - 23:(2013), pp. 357-366. [10.1002/mmce.20680]

Taguchi's method for multi-objective optimization problems

PELOSI, GIUSEPPE;SELLERI, STEFANO;TADDEI, RUGGERO
2013

Abstract

Taguchi's method is a quality design technique whose applications in numerical single-objective optimization have been recently exploited. In this article, a novel multi-objective (MO) algorithm based on Taguchi's technique is illustrated and its performances assessed. Validation is performed through a comparison between the presented algorithm and a MO genetic algorithm (GA) based optimization, first on different sets of test functions and then on a practical antenna array synthesis problem. Results indicate a generally better behavior of the proposed algorithm in terms of convergence and spreading over the Pareto front with respect to the GA benchmark.
2013
23
357
366
E. Agastra; G. Pelosi; S. Selleri; R. Taddei
File in questo prodotto:
File Dimensione Formato  
IJRFCAE_Taguchi_23_3_2013.pdf

Accesso chiuso

Tipologia: Pdf editoriale (Version of record)
Licenza: Tutti i diritti riservati
Dimensione 271.05 kB
Formato Adobe PDF
271.05 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/771100
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 31
  • ???jsp.display-item.citation.isi??? 26
social impact