Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
NAUTILUS Method: An Interactive Technique in Multiobjective Optimization based on the Nadir Point
Dept. of Mathematical Information Technology, University of Jyväskylä.
University of Malaga.
University of Malaga.
(Dept. of Mathematical Information Technology, University of Jyväskylä)
2010 (English)In: European Journal of Operational Research, ISSN 0377-2217, E-ISSN 1872-6860, Vol. 206, no 2, 426-434 p.Article in journal (Refereed) Published
Abstract [en]

Most interactive methods developed for solving multiobjective optimization problems sequentially generate Pareto optimal or nondominated vectors and the decision maker must always allow impairment in at least one objective function to get a new solution. The NAUTILUS method proposed is based on the assumptions that past experiences affect decision makers’ hopes and that people do not react symmetrically to gains and losses. Therefore, some decision makers may prefer to start from the worst possible objective values and to improve every objective step by step according to their preferences. In NAUTILUS, starting from the nadir point, a solution is obtained at each iteration which dominates the previous one. Although only the last solution will be Pareto optimal, the decision maker never looses sight of the Pareto optimal set, and the search is oriented so that (s)he progressively focusses on the preferred part of the Pareto optimal set. Each new solution is obtained by minimizing an achievement scalarizing function including preferences about desired improvements in objective function values. NAUTILUS is specially suitable for avoiding undesired anchoring effects, for example in negotiation support problems, or just as a means of finding an initial Pareto optimal solution for any interactive procedure. An illustrative example demonstrates how this new method iterates.

Place, publisher, year, edition, pages
Elsevier, 2010. Vol. 206, no 2, 426-434 p.
Keyword [en]
Multiple objective programming; Interactive methods; Reference point methods; Preference information; Pareto optimality
National Category
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-72316DOI: 10.1016/j.ejor.2010.02.041ISI: 000277873300015OAI: oai:DiVA.org:kth-72316DiVA: diva2:487503
Note
QC 20120209Available from: 2012-02-09 Created: 2012-01-31 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textSciencedirect

Search in DiVA

By author/editor
Miettinen, Kaisa
In the same journal
European Journal of Operational Research
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 22 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf