Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem

Sagar S. De; Satchidananda Dehuri; Sung Bae Cho

doi:10.1109/ICIT.2017.45

Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem

Sagar S. De, Satchidananda Dehuri, Sung Bae Cho

College of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

Revealing the non-dominated solutions is one of the vital and essential part of multi-objective optimization algorithms. However, the process of identifying non-dominated solutions in the case of multi-objective optimization problems is computationally very expensive even though properties of dominance relation adhered very strictly. In many multi-objective optimization problems, to identify all non-dominated solutions from a set of N solutions with K objectives naïve and slow approach is commonly accepted with O(KN²) computation time. Realizing this problem as the heart of multi-objective optimization problem, we attempt here a new effective and comparatively better approach for revealing all non-dominated solutions based on divide-and-conquer technique by enjoying O(K N log₂ N) computation time. Our experimental results in many benchmark multi-objective optimization problems confirm the aforementioned claim.

Original language	English
Title of host publication	Proceedings - 2017 International Conference on Information Technology, ICIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	143-151
Number of pages	9
ISBN (Print)	9781538629246
DOIs	https://doi.org/10.1109/ICIT.2017.45
Publication status	Published - 2018 Jul 31
Event	16th International Conference on Information Technology, ICIT 2017 - Bhubaneswar, Odisha, India Duration: 2017 Dec 21 → 2017 Dec 23

Publication series

Name	Proceedings - 2017 International Conference on Information Technology, ICIT 2017

Other

Other	16th International Conference on Information Technology, ICIT 2017
Country/Territory	India
City	Bhubaneswar, Odisha
Period	17/12/21 → 17/12/23

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

All Science Journal Classification (ASJC) codes

Safety, Risk, Reliability and Quality
Computer Networks and Communications
Computer Science Applications
Software
Information Systems and Management

Access to Document

10.1109/ICIT.2017.45

Cite this

De, S. S., Dehuri, S., & Cho, S. B. (2018). Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem. In Proceedings - 2017 International Conference on Information Technology, ICIT 2017 (pp. 143-151). [8423898] (Proceedings - 2017 International Conference on Information Technology, ICIT 2017). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICIT.2017.45

De, Sagar S. ; Dehuri, Satchidananda ; Cho, Sung Bae. / Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem. Proceedings - 2017 International Conference on Information Technology, ICIT 2017. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 143-151 (Proceedings - 2017 International Conference on Information Technology, ICIT 2017).

@inproceedings{496c278bd6e24bb2925b6e40cd98bbfb,

title = "Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem",

abstract = "Revealing the non-dominated solutions is one of the vital and essential part of multi-objective optimization algorithms. However, the process of identifying non-dominated solutions in the case of multi-objective optimization problems is computationally very expensive even though properties of dominance relation adhered very strictly. In many multi-objective optimization problems, to identify all non-dominated solutions from a set of N solutions with K objectives na{\"i}ve and slow approach is commonly accepted with O(KN2) computation time. Realizing this problem as the heart of multi-objective optimization problem, we attempt here a new effective and comparatively better approach for revealing all non-dominated solutions based on divide-and-conquer technique by enjoying O(K N log2 N) computation time. Our experimental results in many benchmark multi-objective optimization problems confirm the aforementioned claim.",

author = "De, {Sagar S.} and Satchidananda Dehuri and Cho, {Sung Bae}",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 16th International Conference on Information Technology, ICIT 2017 ; Conference date: 21-12-2017 Through 23-12-2017",

year = "2018",

month = jul,

day = "31",

doi = "10.1109/ICIT.2017.45",

language = "English",

isbn = "9781538629246",

series = "Proceedings - 2017 International Conference on Information Technology, ICIT 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "143--151",

booktitle = "Proceedings - 2017 International Conference on Information Technology, ICIT 2017",

address = "United States",

}

De, SS, Dehuri, S & Cho, SB 2018, Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem. in Proceedings - 2017 International Conference on Information Technology, ICIT 2017., 8423898, Proceedings - 2017 International Conference on Information Technology, ICIT 2017, Institute of Electrical and Electronics Engineers Inc., pp. 143-151, 16th International Conference on Information Technology, ICIT 2017, Bhubaneswar, Odisha, India, 17/12/21. https://doi.org/10.1109/ICIT.2017.45

Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem. / De, Sagar S.; Dehuri, Satchidananda; Cho, Sung Bae.

Proceedings - 2017 International Conference on Information Technology, ICIT 2017. Institute of Electrical and Electronics Engineers Inc., 2018. p. 143-151 8423898 (Proceedings - 2017 International Conference on Information Technology, ICIT 2017).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem

AU - De, Sagar S.

AU - Dehuri, Satchidananda

AU - Cho, Sung Bae

PY - 2018/7/31

Y1 - 2018/7/31

N2 - Revealing the non-dominated solutions is one of the vital and essential part of multi-objective optimization algorithms. However, the process of identifying non-dominated solutions in the case of multi-objective optimization problems is computationally very expensive even though properties of dominance relation adhered very strictly. In many multi-objective optimization problems, to identify all non-dominated solutions from a set of N solutions with K objectives naïve and slow approach is commonly accepted with O(KN2) computation time. Realizing this problem as the heart of multi-objective optimization problem, we attempt here a new effective and comparatively better approach for revealing all non-dominated solutions based on divide-and-conquer technique by enjoying O(K N log2 N) computation time. Our experimental results in many benchmark multi-objective optimization problems confirm the aforementioned claim.

AB - Revealing the non-dominated solutions is one of the vital and essential part of multi-objective optimization algorithms. However, the process of identifying non-dominated solutions in the case of multi-objective optimization problems is computationally very expensive even though properties of dominance relation adhered very strictly. In many multi-objective optimization problems, to identify all non-dominated solutions from a set of N solutions with K objectives naïve and slow approach is commonly accepted with O(KN2) computation time. Realizing this problem as the heart of multi-objective optimization problem, we attempt here a new effective and comparatively better approach for revealing all non-dominated solutions based on divide-and-conquer technique by enjoying O(K N log2 N) computation time. Our experimental results in many benchmark multi-objective optimization problems confirm the aforementioned claim.

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

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

U2 - 10.1109/ICIT.2017.45

DO - 10.1109/ICIT.2017.45

M3 - Conference contribution

AN - SCOPUS:85051581454

SN - 9781538629246

T3 - Proceedings - 2017 International Conference on Information Technology, ICIT 2017

SP - 143

EP - 151

BT - Proceedings - 2017 International Conference on Information Technology, ICIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 16th International Conference on Information Technology, ICIT 2017

Y2 - 21 December 2017 through 23 December 2017

ER -

De SS, Dehuri S, Cho SB. Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem. In Proceedings - 2017 International Conference on Information Technology, ICIT 2017. Institute of Electrical and Electronics Engineers Inc. 2018. p. 143-151. 8423898. (Proceedings - 2017 International Conference on Information Technology, ICIT 2017). doi: 10.1109/ICIT.2017.45

Divide-and-Conquer Approach for Revealing the Non-dominated Solutions in Multi-objective Optimization Problem

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this