Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Ergebnis 20 von 69
International journal of computational intelligence systems, 2022-08, Vol.15 (1), p.1-11, Article 57
2022
Volltextzugriff (PDF)

Details

Autor(en) / Beteiligte
Titel
On Performance of a Simple Multi-objective Evolutionary Algorithm on the Constrained Minimum Spanning Tree Problem
Ist Teil von
  • International journal of computational intelligence systems, 2022-08, Vol.15 (1), p.1-11, Article 57
Ort / Verlag
Dordrecht: Springer Netherlands
Erscheinungsjahr
2022
Quelle
Free E-Journal (出版社公開部分のみ)
Beschreibungen/Notizen
  • The constrained optimization problems can be transformed into multi-objective optimization problems, and thus can be optimized by multi-objective evolutionary algorithms. This method has been successfully used to solve the constrained optimization problems. However, little theoretical work has been done on the performance of multi-objective evolutionary algorithms for the constrained optimization problems. In this paper, we theoretically analyze the performance of a multi-objective evolutionary algorithms on the constrained minimum spanning tree problem. First, we theoretically prove that the multi-objective evolutionary algorithm is capable of finding a (2,1)-approximation solution for the constrained minimum spanning tree problem in a pseudopolynomial runtime. Then, this simple multi-objective evolutionary algorithm is shown to be efficient on a constructed instance of the problem.
Sprache
Englisch
Identifikatoren
ISSN: 1875-6883
eISSN: 1875-6883
DOI: 10.1007/s44196-022-00111-7
Titel-ID: cdi_doaj_primary_oai_doaj_org_article_c4aa08ca59ee4fd9b9f5a8eca777f32d

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX