A differential evolution algorithm for dynamic multi-objective optimization

Dynamic multi-objective optimization problems are widespread in real life. Artificial equivalents of the problems are abound in literature. Evolutionary algorithms are nature-inspired search algorithms used in finding optimal trade-off solutions of dynamic multi-objective optimization problems. This...

Full description

Saved in:
Bibliographic Details
Published in:SSCI : 2017 IEEE Symposium Series on Computational Intelligence : November 27, 2017-December 1, 2017 pp. 1 - 10
Main Authors: Adekunle, R. Adekoya, Helbig, Marde
Format: Conference Proceeding
Language:English
Published: IEEE 01.11.2017
Subjects:
Algorithm design and analysis
Heuristic algorithms
Optical fibers
Optimization
Sociology
Sorting
Statistics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Dynamic multi-objective optimization problems are widespread in real life. Artificial equivalents of the problems are abound in literature. Evolutionary algorithms are nature-inspired search algorithms used in finding optimal trade-off solutions of dynamic multi-objective optimization problems. This study proposes a new differential evolution algorithm, namely the Dynamic Differential Evolution Vector Evaluated Non-Dominated Sorting or 2DEVENS. 2DEVENS draws from the non-dominated sorting and the vector-evaluated procedures which are typical of search algorithms such as Dynamic Non-Dominated Sort Genetic Algorithm (DNSGA-II) and Dynamic Vector Evaluated Particle Swarm Optimization Algorithm (DVEPSO) respectively. Computing the target vector is a key operation in a differential evolution algorithm. The proposed algorithm, 2DEVENS, employs the vector-evaluated procedure of DVEPSO in computing the target vector, while the next generation vectors are computed using the non-dominated sorting procedure of DNSGA-II. The proposed algorithm is compared with DNSGA-Π and DVEPSO on different measures of performance, benchmark functions and for different experimental configurations. The ability of the proposed algorithm to track the changing Pareto Optimal Front, i.e. finding the various optimal trade-off solutions in objective space, is compared with DNSGA-II and DVEPSO. The results show that the proposed 2DEVENS algorithm compares very well with the established algorithms, such as DNSGA-II and DVEPSO, in computing the optimal trade-off solutions for the various dynamic multi-objective optimization problems studied in this paper. 2DE-VENS performs best for the two importance measures of accuracy and stability, making it a favourite in situations where accuracy and stability measures are critical in making choice of algorithms when solving dynamic multi-objective optimization problems.
AbstractList Dynamic multi-objective optimization problems are widespread in real life. Artificial equivalents of the problems are abound in literature. Evolutionary algorithms are nature-inspired search algorithms used in finding optimal trade-off solutions of dynamic multi-objective optimization problems. This study proposes a new differential evolution algorithm, namely the Dynamic Differential Evolution Vector Evaluated Non-Dominated Sorting or 2DEVENS. 2DEVENS draws from the non-dominated sorting and the vector-evaluated procedures which are typical of search algorithms such as Dynamic Non-Dominated Sort Genetic Algorithm (DNSGA-II) and Dynamic Vector Evaluated Particle Swarm Optimization Algorithm (DVEPSO) respectively. Computing the target vector is a key operation in a differential evolution algorithm. The proposed algorithm, 2DEVENS, employs the vector-evaluated procedure of DVEPSO in computing the target vector, while the next generation vectors are computed using the non-dominated sorting procedure of DNSGA-II. The proposed algorithm is compared with DNSGA-Π and DVEPSO on different measures of performance, benchmark functions and for different experimental configurations. The ability of the proposed algorithm to track the changing Pareto Optimal Front, i.e. finding the various optimal trade-off solutions in objective space, is compared with DNSGA-II and DVEPSO. The results show that the proposed 2DEVENS algorithm compares very well with the established algorithms, such as DNSGA-II and DVEPSO, in computing the optimal trade-off solutions for the various dynamic multi-objective optimization problems studied in this paper. 2DE-VENS performs best for the two importance measures of accuracy and stability, making it a favourite in situations where accuracy and stability measures are critical in making choice of algorithms when solving dynamic multi-objective optimization problems.
Author Helbig, Marde
Adekunle, R. Adekoya
Author_xml – sequence: 1
  givenname: R. Adekoya
  surname: Adekunle
  fullname: Adekunle, R. Adekoya
  email: adekunleadekoya@gmail.com
  organization: Dept. of Comput. Sci., Univ. of Pretoria, Pretoria, South Africa
– sequence: 2
  givenname: Marde
  surname: Helbig
  fullname: Helbig, Marde
  email: mhelbig@cs.up.ac.za
  organization: Dept. of Comput. Sci., Univ. of Pretoria, Pretoria, South Africa
BookMark eNotj91KwzAYQCMo6OYeQLzJC7Tmr2lyOYq64cCL6fVImi_6jbYZbTaYTy_irs7VOXBm5HpIAxDywFnJObNP222zLgXjdWmEYVbqKzLjlTRa1EKrW7KYpj1jjFttVC3vyNuSBowRRhgyuo7CKXXHjGmgrvtKI-bvnsY00nAeXI8t7Y9dxiL5PbQZT0DTIWOPP-5PuSc30XUTLC6ck8-X549mVWzeX9fNclOg4CYXra5VCEzxGKxjbe1MrBy3lWaKMcO99LISCrz3HFoba2NiAA9aC-WFN0rOyeN_FwFgdxixd-N5d_mVv0TfTvA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SSCI.2017.8280936
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Statistics
Computer Science
EISBN 1538627264
9781538627266
EndPage 10
ExternalDocumentID 8280936
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i218t-c674dd041fd9a0c7a8f5a1956040081b3b3524ebbb1ec9f788fdebe6624b2b843
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000428251402084&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:51:29 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i218t-c674dd041fd9a0c7a8f5a1956040081b3b3524ebbb1ec9f788fdebe6624b2b843
OpenAccessLink http://hdl.handle.net/10072/414946
PageCount 10
ParticipantIDs ieee_primary_8280936
PublicationCentury 2000
PublicationDate 2017-Nov.
PublicationDateYYYYMMDD 2017-11-01
PublicationDate_xml – month: 11
  year: 2017
  text: 2017-Nov.
PublicationDecade 2010
PublicationTitle SSCI : 2017 IEEE Symposium Series on Computational Intelligence : November 27, 2017-December 1, 2017
PublicationTitleAbbrev SSCI
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001968473
Score 1.6567162
Snippet Dynamic multi-objective optimization problems are widespread in real life. Artificial equivalents of the problems are abound in literature. Evolutionary...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Algorithm design and analysis
Heuristic algorithms
Optical fibers
Optimization
Sociology
Sorting
Statistics
Title A differential evolution algorithm for dynamic multi-objective optimization
URI https://ieeexplore.ieee.org/document/8280936
WOSCitedRecordID wos000428251402084&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fa8IwED5U9uCTmzr2mzzscdXWxqR5HDLZGIjgBr5Jk1w2h9oh6t-_S1uVwV72VgpH4a539yW5Lx_AvaUulAqlgj6PLS1QdBzolIsAJRK-D40wQudiE3I0SqZTNa7Aw4ELg4j58Bl2_GN-lm8zs_VbZV1vrWJRhaqUouBqHfdTlKBCG5cHl1GoupPJ4MXPbslOafdLQCXvH8PG_758Cu0jEY-NDy3mDCq4akJjr8TAysRsQt1jxuLK5Ra8PrK97Aml74Lhrvy9WLr4yNbzzeeSEVRlthCjZ_lMYZDpr6L2sYyqyLKkZ7bhffj0NngOSs2EYE7NehMYIbm1IY-cVWloZJq4fuo5gT5ZCaLGmhAXR611hEY5WgA7S3EUosd1Tyc8PofaKlvhBTDuOFn0BJrEc0iUQkfYyaEmUOliEV1Cyztq9l1cizErfXT19-trqPtYFDS-G6ht1lu8hROzI--s7_JY_gDlZqGD
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Na8JAEB2sLdSTrVr63T302Ghi1k32WKSiaEXQgjfJfrUWNUXU39_ZZKsUeuktBIbATGbm7e68fQCPCrtQwjj3WjRUuEARoScSyjwdacT3vmSSiUxsIhoO4-mUjwrwtOfCaK2z4TNdt4_ZWb5K5dZulTWsNQ_ZERxb5SzH1jrsqHCGpTZ0R5eBzxvjcbtnp7eiurP8JaGSdZBO-X_fPoPagYpHRvsmcw4FvapA-UeLgbjUrEDJosb80uUq9J_Jj_AJJvCC6J37wUiyeE_X883HkiBYJSqXoyfZVKGXis-8-pEU68jSETRr8NZ5mbS7nlNN8ObYrjeeZBFVyqeBUTzxZZTEppVYVqBNVwSpoUDMRbUQItCSG1wCG4WRZKxJRVPENLyA4ipd6Usg1FC0aDItY8si4Vwb9LvRAmGlCVlwBVXrqNlXfjHGzPno-u_XD3DanbwOZoPesH8DJRuXnNR3C8XNeqvv4ETu0FPr-yyu33zcpMw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=SSCI+%3A+2017+IEEE+Symposium+Series+on+Computational+Intelligence+%3A+November+27%2C+2017-December+1%2C+2017&rft.atitle=A+differential+evolution+algorithm+for+dynamic+multi-objective+optimization&rft.au=Adekunle%2C+R.+Adekoya&rft.au=Helbig%2C+Marde&rft.date=2017-11-01&rft.pub=IEEE&rft.spage=1&rft.epage=10&rft_id=info:doi/10.1109%2FSSCI.2017.8280936&rft.externalDocID=8280936