An Evolutionary Sequential Sampling Algorithm for Multi-Objective Optimization

Aristotelis E. Thanos, Nurcin Celik, Juan P. Sáenz

Research output: Contribution to journalArticle

Abstract

In this paper, we present a novel sequential sampling methodology for solving multi-objective optimization problems. Random sequential sampling is performed using the information from within the non-dominated solution set generated by the algorithm, while resampling is performed using the extreme points of the non-dominated solution set. The proposed approach has been benchmarked against well-known multi-objective optimization algorithms that exist in the literature through a series of problem instances. The proposed algorithm has been demonstrated to perform at least as good as the alternatives found in the literature in problems where the Pareto front presents convexity, nonconvexity, or discontinuity; while producing very promising results in problem instances where there is multi-modality or nonuniform distribution of the solutions along the Pareto front.

Original languageEnglish (US)
Article number1650006
JournalAsia-Pacific Journal of Operational Research
Volume33
Issue number1
DOIs
StatePublished - Feb 1 2016

Fingerprint

Evolutionary
Multi-objective optimization
Sampling
Pareto
Resampling
Optimization problem
Non-convexity
Multimodality
Methodology
Discontinuity
Convexity

Keywords

  • evolutionary algorithms
  • Multi-criterion decision-making
  • multi-objective optimization
  • Pareto optimality
  • sequential sampling

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

An Evolutionary Sequential Sampling Algorithm for Multi-Objective Optimization. / Thanos, Aristotelis E.; Celik, Nurcin; Sáenz, Juan P.

In: Asia-Pacific Journal of Operational Research, Vol. 33, No. 1, 1650006, 01.02.2016.

Research output: Contribution to journalArticle

@article{bbd80276759e4dd2aa76b0b036497275,
title = "An Evolutionary Sequential Sampling Algorithm for Multi-Objective Optimization",
abstract = "In this paper, we present a novel sequential sampling methodology for solving multi-objective optimization problems. Random sequential sampling is performed using the information from within the non-dominated solution set generated by the algorithm, while resampling is performed using the extreme points of the non-dominated solution set. The proposed approach has been benchmarked against well-known multi-objective optimization algorithms that exist in the literature through a series of problem instances. The proposed algorithm has been demonstrated to perform at least as good as the alternatives found in the literature in problems where the Pareto front presents convexity, nonconvexity, or discontinuity; while producing very promising results in problem instances where there is multi-modality or nonuniform distribution of the solutions along the Pareto front.",
keywords = "evolutionary algorithms, Multi-criterion decision-making, multi-objective optimization, Pareto optimality, sequential sampling",
author = "Thanos, {Aristotelis E.} and Nurcin Celik and S{\'a}enz, {Juan P.}",
year = "2016",
month = "2",
day = "1",
doi = "10.1142/S0217595916500068",
language = "English (US)",
volume = "33",
journal = "Asia-Pacific Journal of Operational Research",
issn = "0217-5959",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

TY - JOUR

T1 - An Evolutionary Sequential Sampling Algorithm for Multi-Objective Optimization

AU - Thanos, Aristotelis E.

AU - Celik, Nurcin

AU - Sáenz, Juan P.

PY - 2016/2/1

Y1 - 2016/2/1

N2 - In this paper, we present a novel sequential sampling methodology for solving multi-objective optimization problems. Random sequential sampling is performed using the information from within the non-dominated solution set generated by the algorithm, while resampling is performed using the extreme points of the non-dominated solution set. The proposed approach has been benchmarked against well-known multi-objective optimization algorithms that exist in the literature through a series of problem instances. The proposed algorithm has been demonstrated to perform at least as good as the alternatives found in the literature in problems where the Pareto front presents convexity, nonconvexity, or discontinuity; while producing very promising results in problem instances where there is multi-modality or nonuniform distribution of the solutions along the Pareto front.

AB - In this paper, we present a novel sequential sampling methodology for solving multi-objective optimization problems. Random sequential sampling is performed using the information from within the non-dominated solution set generated by the algorithm, while resampling is performed using the extreme points of the non-dominated solution set. The proposed approach has been benchmarked against well-known multi-objective optimization algorithms that exist in the literature through a series of problem instances. The proposed algorithm has been demonstrated to perform at least as good as the alternatives found in the literature in problems where the Pareto front presents convexity, nonconvexity, or discontinuity; while producing very promising results in problem instances where there is multi-modality or nonuniform distribution of the solutions along the Pareto front.

KW - evolutionary algorithms

KW - Multi-criterion decision-making

KW - multi-objective optimization

KW - Pareto optimality

KW - sequential sampling

UR - http://www.scopus.com/inward/record.url?scp=84960436092&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84960436092&partnerID=8YFLogxK

U2 - 10.1142/S0217595916500068

DO - 10.1142/S0217595916500068

M3 - Article

AN - SCOPUS:84960436092

VL - 33

JO - Asia-Pacific Journal of Operational Research

JF - Asia-Pacific Journal of Operational Research

SN - 0217-5959

IS - 1

M1 - 1650006

ER -