{"id":"https://openalex.org/W2726747380","doi":"https://doi.org/10.1109/cec.2017.7969411","title":"Dynamic Distance Minimization Problems for dynamic multi-objective optimization","display_name":"Dynamic Distance Minimization Problems for dynamic multi-objective optimization","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2726747380","doi":"https://doi.org/10.1109/cec.2017.7969411","mag":"2726747380"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2017.7969411","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2017.7969411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010316655","display_name":"Heiner Zille","orcid":"https://orcid.org/0000-0002-7262-9487"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Heiner Zille","raw_affiliation_strings":["Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001775154","display_name":"Andre Kottenhahn","orcid":null},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andre Kottenhahn","raw_affiliation_strings":["Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064569017","display_name":"Sanaz Mostaghim","orcid":"https://orcid.org/0000-0002-9917-5227"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sanaz Mostaghim","raw_affiliation_strings":["Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95793202"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"952","last_page":"959"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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":1.0,"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.9975000023841858,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7259541749954224},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6874658465385437},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6604872345924377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6233663558959961},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.5535364151000977},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5084666013717651},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4871234893798828},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4854014813899994},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.46410998702049255},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.44428667426109314},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4419423043727875},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4177539050579071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.228351891040802}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7259541749954224},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6874658465385437},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6604872345924377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6233663558959961},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.5535364151000977},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5084666013717651},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4871234893798828},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4854014813899994},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.46410998702049255},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.44428667426109314},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4419423043727875},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4177539050579071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.228351891040802},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2017.7969411","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2017.7969411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1484287363","https://openalex.org/W1496927484","https://openalex.org/W1500125712","https://openalex.org/W1574490530","https://openalex.org/W1602164347","https://openalex.org/W1608317386","https://openalex.org/W1846834309","https://openalex.org/W1963550655","https://openalex.org/W2023343291","https://openalex.org/W2062166073","https://openalex.org/W2097366597","https://openalex.org/W2104017154","https://openalex.org/W2118693290","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2126273906","https://openalex.org/W2142844925","https://openalex.org/W2147573707","https://openalex.org/W2283815454","https://openalex.org/W6634354838","https://openalex.org/W6638887577","https://openalex.org/W6678949850","https://openalex.org/W6681320592","https://openalex.org/W6681791072","https://openalex.org/W6695799952"],"related_works":["https://openalex.org/W1963790170","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W2090178682","https://openalex.org/W2586328217","https://openalex.org/W2049264236","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W1588199609"],"abstract_inverted_index":{"In":[0,74],"this":[1],"article":[2],"we":[3],"propose":[4],"a":[5,19,39,81,123],"new":[6],"dynamic":[7,12,23,45,108,128,140],"multi-objective":[8,24,46],"optimization":[9,25],"problem.":[10],"This":[11],"Distance":[13],"Minimization":[14],"Problem":[15],"(dDMP)":[16],"functions":[17],"as":[18],"benchmark":[20],"problem":[21,69,77],"for":[22,44],"and":[26,42,104,110,113,133],"is":[27,78],"based":[28,79],"on":[29,80],"the":[30,34,50,53,57,65,68,76,91,98,102,106,116,127,139],"static":[31],"versions":[32],"from":[33],"literature.":[35],"The":[36],"dDMP":[37],"introduces":[38],"useful":[40,88],"property":[41],"challenge":[43],"algorithms.":[47,95],"Not":[48],"only":[49],"positions":[51],"of":[52,67,94,101,115,126],"Pareto-optimal":[54,117],"solutions":[55],"in":[56],"search":[58,92],"space":[59],"change":[60],"over":[61],"time,":[62],"but":[63],"also":[64],"complexity":[66],"can":[70,130],"be":[71,131],"adjusted":[72],"dynamically.":[73],"addition":[75],"simple":[82],"geometric":[83],"structure,":[84],"which":[85],"makes":[86],"it":[87],"to":[89,138],"visualize":[90],"behaviour":[93],"We":[96],"describe":[97],"basic":[99],"principles":[100],"problem,":[103],"introduce":[105],"possible":[107,124],"changes":[109],"their":[111],"implementation":[112],"effects":[114],"areas.":[118],"Our":[119],"experiments":[120],"show":[121],"how":[122,134],"instance":[125],"DMP":[129],"defined":[132],"different":[135],"algorithms":[136],"react":[137],"changes.":[141]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}