Dissertation · 2011 · Open access

Progressively interactive evolutionary multiobjective optimization

Ankur Sinha

Aaltodoc (Aalto University) · Published 1 January 2011

Open PDFView at the publisherCite this paper

In brief

“Progressively interactive evolutionary multiobjective optimization” is a 2011 dissertation by Ankur Sinha, published in Aaltodoc (Aalto University). OpenAlex counts 14 citations as of 19 November 2026. It is open access: the full text is free to read at Aaltodoc (Aalto University).

Citations
14
Most cited in
2025 (3)
References
93
Authors
1

Abstract

A complete optimization procedure for a multi-objective problem essentially comprises of search and decision making. Depending upon how the search and decision making task is integrated, algorithms can be classified into various categories. Following `a decision making after search' approach, which is common with evolutionary multi-objective optimization algorithms, requires to produce all the possible alternatives before a decision can be taken. This, with the intricacies involved in producing the entire Pareto-front, is not a wise approach for high objective problems. Rather, for such kind of problems, the most preferred point on the front should be the target. In this study we propose and evaluate algorithms where search and decision making tasks work in tandem and the most preferred solution is the outcome. For the two tasks to work simultaneously, an interaction of the decision maker with the algorithm is necessary, therefore, preference information from the decision maker is accepted periodically by the algorithm and progress towards the most preferred point is made. \nTwo different progressively interactive procedures have been suggested in the dissertation which can be integrated with any existing evolutionary multi-objective optimization algorithm to improve its effectiveness in handling high objective problems by making it capable to accept preference information at the intermediate steps of the algorithm. A number of high objective un-constrained as well as constrained problems have been successfully solved using the procedures. One of the less explored and difficult domains, i.e., bilevel multiobjective optimization has also been targeted and a solution methodology has been proposed. Initially, the bilevel multi-objective optimization problem has been solved by developing a hybrid bilevel evolutionary multi-objective optimization algorithm. Thereafter, the progressively interactive procedure has been incorporated in the algorithm leading to an increased accuracy and savings in computational cost. The efficacy of using a progressively interactive approach for solving difficult multi-objective problems has, therefore, further been justified

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Sinha, A. (2011). Progressively interactive evolutionary multiobjective optimization. Aaltodoc (Aalto University). https://aaltodoc.aalto.fi/handle/123456789/11079

MLA 9

Sinha, Ankur. “Progressively interactive evolutionary multiobjective optimization.” Aaltodoc (Aalto University), 2011. https://aaltodoc.aalto.fi/handle/123456789/11079.

Chicago

Sinha, Ankur. 2011. “Progressively interactive evolutionary multiobjective optimization.” Aaltodoc (Aalto University). https://aaltodoc.aalto.fi/handle/123456789/11079.

Harvard

Sinha, A. (2011) ‘Progressively interactive evolutionary multiobjective optimization’, Aaltodoc (Aalto University). Available at: https://aaltodoc.aalto.fi/handle/123456789/11079.

IEEE

A. Sinha, “Progressively interactive evolutionary multiobjective optimization,” Aaltodoc (Aalto University), 2011.

BibTeX

@phdthesis{sinha2011progressively,
  title     = {{Progressively interactive evolutionary multiobjective optimization}},
  author    = {Sinha, Ankur},
  year      = {2011},
  url       = {https://aaltodoc.aalto.fi/handle/123456789/11079}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201322
201411
201611
201811
201911
202011
202322
202422
202533

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • multi-objective evolutionary algorithms
  • interactive optimization
  • preference data
  • decision-making
  • high-dimensional optimization
  • hybrid evolutionary algorithm
  • constrained optimization
  • Pareto front

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Sinha, A. (2011). Progressively interactive evolutionary multiobjective optimization. Aaltodoc (Aalto University). https://aaltodoc.aalto.fi/handle/123456789/11079

How many times has this paper been cited?

14 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Aaltodoc (Aalto University): sign in and open the PDF from this page.

Who wrote this paper?

Ankur Sinha.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.