{"id":"https://openalex.org/W4285153855","doi":"https://doi.org/10.34028/iajit/19/3a/2","title":"An Efficient Parallel Version of Dynamic Multi-Objective Evolutionary Algorithm","display_name":"An Efficient Parallel Version of Dynamic Multi-Objective Evolutionary Algorithm","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4285153855","doi":"https://doi.org/10.34028/iajit/19/3a/2"},"language":"en","primary_location":{"id":"doi:10.34028/iajit/19/3a/2","is_oa":true,"landing_page_url":"https://doi.org/10.34028/iajit/19/3a/2","pdf_url":null,"source":{"id":"https://openalex.org/S100666833","display_name":"The International Arab Journal of Information Technology","issn_l":"1683-3198","issn":["1683-3198","2309-4524"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4362726017","host_organization_name":"Zarqa University","host_organization_lineage":["https://openalex.org/P4362726017"],"host_organization_lineage_names":["Zarqa University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Arab Journal of Information Technology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.34028/iajit/19/3a/2","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031541321","display_name":"Maroua Grid","orcid":"https://orcid.org/0009-0005-2503-8325"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maroua Grid","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045281563","display_name":"Leyla Belaiche","orcid":"https://orcid.org/0000-0003-1128-0725"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leila Belaiche","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052087453","display_name":"La\u00efd Kahloul","orcid":"https://orcid.org/0000-0002-9739-7715"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laid Kahloul","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5001877199","display_name":"Saber Benharzallah","orcid":"https://orcid.org/0000-0002-3870-4383"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saber Benharzallah","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6085,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70381724,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"19","issue":"3A","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9824000000953674,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7878884673118591},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7462215423583984},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.733816385269165},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6767281889915466},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5684298276901245},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5613847970962524},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.515863835811615},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.46068599820137024},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.42311742901802063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4023086428642273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20933374762535095},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1827073097229004}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7878884673118591},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7462215423583984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.733816385269165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6767281889915466},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5684298276901245},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5613847970962524},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.515863835811615},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.46068599820137024},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.42311742901802063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4023086428642273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20933374762535095},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1827073097229004},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.34028/iajit/19/3a/2","is_oa":true,"landing_page_url":"https://doi.org/10.34028/iajit/19/3a/2","pdf_url":null,"source":{"id":"https://openalex.org/S100666833","display_name":"The International Arab Journal of Information Technology","issn_l":"1683-3198","issn":["1683-3198","2309-4524"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4362726017","host_organization_name":"Zarqa University","host_organization_lineage":["https://openalex.org/P4362726017"],"host_organization_lineage_names":["Zarqa University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Arab Journal of Information Technology","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.34028/iajit/19/3a/2","is_oa":true,"landing_page_url":"https://doi.org/10.34028/iajit/19/3a/2","pdf_url":null,"source":{"id":"https://openalex.org/S100666833","display_name":"The International Arab Journal of Information Technology","issn_l":"1683-3198","issn":["1683-3198","2309-4524"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4362726017","host_organization_name":"Zarqa University","host_organization_lineage":["https://openalex.org/P4362726017"],"host_organization_lineage_names":["Zarqa University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Arab Journal of Information Technology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1994686097","https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2001591765","https://openalex.org/W2073147994","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W2384474142"],"abstract_inverted_index":{"Multi-objective":[0],"optimization":[1,13],"evolutionary":[2,143],"algorithms":[3,144],"(MOEAs)":[4],"belong":[5],"to":[6,37,43,95,109,125,201,228,230],"heuristic":[7],"methods":[8],"proposed":[9,85],"for":[10,20,29],"solving":[11],"multi-objective":[12,142],"problems":[14],"(MOPs).":[15],"In":[16],"fact,":[17],"MOEAs":[18,35],"search":[19],"a":[21,30,73,87,210],"uniformly":[22],"distributed,":[23],"near-optimal,":[24],"and":[25,122,134,150,167,199,222],"near-complete":[26],"Pareto":[27,152],"front":[28],"given":[31],"MOP.":[32],"However,":[33],"several":[34],"fail":[36],"achieve":[38],"their":[39,44],"aim":[40],"completely":[41],"due":[42],"fixed":[45],"population":[46,67,204],"size.":[47,205],"To":[48,77],"overcome":[49],"this":[50],"shortcoming,":[51],"Dynamic":[52,89],"Multi-Objective":[53,90],"Evolutionary":[54,91,153],"Algorithm":[55,92,148,154],"(DMOEA)":[56],"[20]":[57],"was":[58],"proposed.":[59],"Although":[60],"DMOEA":[61,139,166,185],"has":[62],"the":[63,80,104,127,170,176,192,196,202,207,214,223,231],"distinction":[64],"of":[65,120,129,163,172,178,188,217,225],"dynamic":[66],"size,":[68],"it":[69,123],"still":[70],"suffers":[71],"from":[72],"long":[74],"execution":[75,101],"time.":[76],"deal":[78],"with":[79,140],"last":[81],"disadvantage,":[82],"we":[83,158],"have":[84],"previously":[86],"Parallel":[88],"(PDMOEA)":[93],"[10]":[94,121],"obtain":[96],"efficient":[97],"results":[98],"in":[99,107,186,220],"less":[100],"time":[102],"than":[103],"sequential":[105],"counterparts,":[106],"order":[108],"tackle":[110],"more":[111,132],"complex":[112],"problems.":[113],"This":[114],"paper":[115,208],"is":[116],"an":[117,160],"extended":[118],"version":[119],"aims":[124],"demonstrate":[126],"efficiency":[128,177],"PDMOEA":[130,164,183],"through":[131],"experimentations":[133],"comparisons.":[135],"We":[136],"firstly":[137],"compare":[138],"other":[141],"Non-Dominated":[145],"Sorting":[146],"Genetic":[147],"(NSGA-II)":[149],"Strength":[151],"(":[155],"SPEA-II),":[156],"then":[157],"present":[159],"exhaustive":[161],"comparison":[162],"versus":[165],"discuss":[168],"how":[169],"number":[171,216,224],"used":[173],"processors":[174],"influences":[175],"PDMOEA.":[179],"As":[180],"experimental":[181],"results,":[182],"enhances":[184],"terms":[187],"three":[189],"criteria:":[190],"improving":[191],"objective":[193],"space,":[194],"minimizing":[195],"computational":[197],"time,":[198],"converging":[200],"desired":[203],"Finally,":[206],"establishes":[209],"new":[211],"formula":[212],"relating":[213],"suitable":[215],"processes,":[218],"required":[219],"PDMOEA,":[221],"necessary":[226],"generations":[227],"converge":[229],"optimal":[232],"solutions.":[233]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}