Show simple item record

dc.contributor.authorOjalehto, Vesa
dc.contributor.authorPodkopaev, Dmitry
dc.contributor.authorMiettinen, Kaisa
dc.date.accessioned2015-07-06T09:44:23Z
dc.date.available2017-06-01T21:45:03Z
dc.date.issued2015
dc.identifier.citationOjalehto, V., Podkopaev, D., & Miettinen, K. (2015). Agent assisted interactive algorithm for computationally demanding multiobjective optimization problems. <i>Computers and Chemical Engineering</i>, <i>77</i>(9 June), 105-115. <a href="https://doi.org/10.1016/j.compchemeng.2015.03.004" target="_blank">https://doi.org/10.1016/j.compchemeng.2015.03.004</a>
dc.identifier.otherCONVID_24684805
dc.identifier.otherTUTKAID_66020
dc.identifier.urihttps://jyx.jyu.fi/handle/123456789/46475
dc.description.abstractWe generalize the applicability of interactive methods for solving computationally demanding, that is, time-consuming, multiobjective optimization problems. For this purpose we propose a new agent assisted interactive algorithm. It employs a computationally inexpensive surrogate problem and four different agents that intelligently update the surrogate based on the preferences specified by a decision maker. In this way, we decrease the waiting times imposed on the decision maker during the interactive solution process and at the same time decrease the amount of preference information expected from the decision maker. The agent assisted algorithm is not specific to any interactive method or surrogate problem. As an example we implement our algorithm for the interactive NIMBUS method and the PAINT method for constructing the surrogate. This implementation was applied to support a real decision maker in solving a two-stage separation problem.fi
dc.language.isoeng
dc.publisherPergamon
dc.relation.ispartofseriesComputers and Chemical Engineering
dc.subject.othermultiple objective programming
dc.subject.otherinteractive methods
dc.subject.otheragent-based optimization
dc.subject.othersurrogate problem NIMBUS PAINT
dc.titleAgent assisted interactive algorithm for computationally demanding multiobjective optimization problems
dc.typearticle
dc.identifier.urnURN:NBN:fi:jyu-201506252442
dc.contributor.laitosTietotekniikan laitosfi
dc.contributor.laitosDepartment of Mathematical Information Technologyen
dc.contributor.oppiaineTietotekniikkafi
dc.contributor.oppiaineMathematical Information Technologyen
dc.type.urihttp://purl.org/eprint/type/JournalArticle
dc.date.updated2015-06-25T09:15:15Z
dc.type.coarjournal article
dc.description.reviewstatuspeerReviewed
dc.format.pagerange105-115
dc.relation.issn0098-1354
dc.relation.numberinseries9 June
dc.relation.volume77
dc.type.versionacceptedVersion
dc.rights.copyright© Elsevier Ltd. This is a final draft version of an article whose final and definitive form has been published by Elsevier.
dc.rights.accesslevelopenAccessfi
dc.relation.doi10.1016/j.compchemeng.2015.03.004


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record