mk:wsc3

Summary

Multiobjective Optimization by Nessy Algorithm. Mario Köppen and Stephan Rudlof. In Advances in Soft Computing, pages 357-368, 1998.

Abstract

This paper presents the extension of the Neural Evolutional Strategy System (Nessy) to the multiobjective optimization case. The neural architecture of the Nessy algorithm is extended by using more than one output neuron, one neuron for each objective. The learning law of Nessy is modified according to the presence of multiple measures of performance. Each hidden neuron of the generation layer randomly selects an objective for one cycle of the network. From this, the multiobjective ranking of the population (or neurons of the solutions layer) is stochastically approximated. The modified Nessy algorithm (Monessy) is able to search for the Pareto set of a multiobjective optimization problem. A test function from literature with well-known Pareto and trade-off set is examined. The newly proposed algorithm effectively searches for the Pareto set by switching between explorational and exploitational search phases. This was compared with random search, which did not hit the Pareto set as nearly as often as the Monessy algorithm. Also, the replacement of a weighted-sum matching measure with multiple matching measures in a framework for texture filter design is considered as a second example.

Bibtex entry

@INPROCEEDINGS { mk:wsc3,
    ABSTRACT = { This paper presents the extension of the Neural Evolutional Strategy System (Nessy) to the multiobjective optimization case. The neural architecture of the Nessy algorithm is extended by using more than one output neuron, one neuron for each objective. The learning law of Nessy is modified according to the presence of multiple measures of performance. Each hidden neuron of the generation layer randomly selects an objective for one cycle of the network. From this, the multiobjective ranking of the population (or neurons of the solutions layer) is stochastically approximated. The modified Nessy algorithm (Monessy) is able to search for the Pareto set of a multiobjective optimization problem. A test function from literature with well-known Pareto and trade-off set is examined. The newly proposed algorithm effectively searches for the Pareto set by switching between explorational and exploitational search phases. This was compared with random search, which did not hit the Pareto set as nearly as often as the Monessy algorithm. Also, the replacement of a weighted-sum matching measure with multiple matching measures in a framework for texture filter design is considered as a second example. },
    AUTHOR = { Mario Köppen and Stephan Rudlof },
    BOOKTITLE = { Advances in Soft Computing },
    MODIFIED = { 2008-02-28 16:43:13 +0900 },
    EDITOR = { R.~Roy and Takeshi Furuhashi and P.K.~Chawdhry },
    HASABSTRACT = { Yes },
    PAGES = { 357--368 },
    PDF = { wsc3.pdf },
    PUBLISHER = { Springer, London, Berlin, Heidelberg a.o. },
    TITLE = { Multiobjective Optimization by Nessy Algorithm },
    YEAR = { 1998 },
}