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(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.
| 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 | |
| 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 |
Other
| Other | 16th International Conference on Information Technology, ICIT 2017 |
|---|---|
| Country | India |
| City | Bhubaneswar, Odisha |
| Period | 17/12/21 → 17/12/23 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Safety, Risk, Reliability and Quality
- Computer Networks and Communications
- Computer Science Applications
- Software
- Information Systems and Management
Cite this
}
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.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
SP - 143
EP - 151
BT - Proceedings - 2017 International Conference on Information Technology, ICIT 2017
PB - Institute of Electrical and Electronics Engineers Inc.
ER -