Dissertation · 2019 · Open access
Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems
Research Repository (Delft University of Technology) · Published 1 January 2019
In brief
“Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems” is a 2019 dissertation by Derk Kappelle, published in Research Repository (Delft University of Technology). OpenAlex counts 0 citations as of 19 November 2026. It is open access: the full text is free to read at Research Repository (Delft University of Technology).
- Citations
- 0
- References
- 32
- Authors
- 1
Abstract
When considering techniques for producing the Pareto front of a Multi-Objective Optimization Problem (MOOP), there exists a trade-off between the effectiveness of the method in obtaining the Pareto front and the computational cost required to achieve that. For a method to be effective, the generated solutions must result in a true representation of the Pareto front. Frequently used techniques are the Genetic Algorithms (GAs). These methods are designed to be effective but are known to be computationally expensive. This is problematic when applied to also expensive MOOPs, which is often the case in engineering applications, as it makes them impractical to use. To solve expensive MOOPs, the applied method should be both effective and computational cost-efficient. Depending on its use, multiple run (MR) methods have been proven to achieve an appropriate level of effectiveness at a significantly lower computational cost compared to GAs. In this paper we present the \\textit{Pareto Set Extrapolation} (PSE) method, which is a modification of the general MR technique and is designed to be more effective and cost-efficient than the existing MR method. In this first phase of its development, the approach is limited to solving constrained bi-Objective Optimization Problems (BOOPs) with a continuous Pf as its solution, but could be extended to MOOPs with relatively small effort and has possible use in solving discontinuous problems. The PSE method is proven to perform favorably over multiple test problems on both effectiveness and cost-efficiency, compared to the Non-dominated Sorting Genetic Algorithm (NSGA-II) and Normal Constraint (NC) method, representing the GAs and MR techniques, respectively.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Kappelle, D. (2019). Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems. Research Repository (Delft University of Technology). http://resolver.tudelft.nl/uuid:4c5f10f5-4707-4763-bb42-1db42faaaa2f
MLA 9
Kappelle, Derk. “Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems.” Research Repository (Delft University of Technology), 2019. http://resolver.tudelft.nl/uuid:4c5f10f5-4707-4763-bb42-1db42faaaa2f.
Chicago
Kappelle, Derk. 2019. “Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems.” Research Repository (Delft University of Technology). http://resolver.tudelft.nl/uuid:4c5f10f5-4707-4763-bb42-1db42faaaa2f.
Harvard
Kappelle, D. (2019) ‘Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems’, Research Repository (Delft University of Technology). Available at: http://resolver.tudelft.nl/uuid:4c5f10f5-4707-4763-bb42-1db42faaaa2f.
IEEE
D. Kappelle, “Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems,” Research Repository (Delft University of Technology), 2019.
BibTeX
@phdthesis{kappelle2019pareto,
title = {{Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems}},
author = {Kappelle, Derk},
year = {2019},
url = {http://resolver.tudelft.nl/uuid:4c5f10f5-4707-4763-bb42-1db42faaaa2f}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- Pareto front approximation
- multi-objective optimization
- NSGA-II
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Kappelle, D. (2019). Pareto Set Extrapolation method: an efficient solving technique for multi-objective optimization problems. Research Repository (Delft University of Technology). http://resolver.tudelft.nl/uuid:4c5f10f5-4707-4763-bb42-1db42faaaa2f
How many times has this paper been cited?
0 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 Research Repository (Delft University of Technology): sign in and open the PDF from this page.
Who wrote this paper?
Derk Kappelle.
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.