Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Genetic algorithms optimization for normalized normal constraint method under Pareto construction

From MaRDI portal
Publication:1005565
Jump to:navigation, search

DOI10.1016/j.advengsoft.2008.04.004zbMath1159.65330OpenAlexW1997743401WikidataQ59202412 ScholiaQ59202412MaRDI QIDQ1005565

Javier Sanchis, Xavier Blasco, Sergio García-Nieto, Miguél Martínez

Publication date: 9 March 2009

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2008.04.004


zbMATH Keywords

numerical examplesnonlinear optimizationgenetic algorithmsmultiobjective optimizationengineeringPareto frontier


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Stochastic programming (90C15)


Related Items (1)

Cost optimization of feed mixes by genetic algorithms


Uses Software

  • Genocop


Cites Work

  • The normalized normal constraint method for generating the Pareto frontier
  • Generating well-distributed sets of Pareto points for engineering design using physical programming
  • Defectiveness of weighting method in multicriterion optimization of structures
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Genetic algorithms optimization for normalized normal constraint method under Pareto construction

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1005565&oldid=12997964"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 21:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki