E-dyNSGA-III: A Multi-Objective Algorithm for Handling Pareto Optimality over Time

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td class="align_left">RPOOT problem</td><td class="align_center">Characteristics</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td class="align_left">F<sub>7</sub>: Farina-deb-amato 4 (FDA4) in [<a href="/journals/mpe/2022/4418706/#B16" target="_blank">16</a>]</td><td class="align_center">3 time-dependent objective functions. Has dynamic non-dominated set and fixed Pareto front</td></tr><tr><td class="align_left">F<sub>8</sub>: FDA5 in [<a href="/journals/mpe/2022/4418706/#B16" target="_blank">16</a>]</td><td class="align_center">3 time-dependent objective functions. Has dynamic non-dominated set and Pareto front</td></tr><tr><td class="align_left">F<sub>10</sub>: Unconstrained dynamicfunction 4 (UDF4) in [<a href="/journals/mpe/2022/4418706/#B23" target="_blank">23</a>]</td><td class="align_center">3 time-dependent objective functions. Has dynamic non-dominated set and Pareto front</td></tr><tr><td class="align_left">F<sub>11</sub>: UDF7 in [<a href="/journals/mpe/2022/4418706/#B23" target="_blank">23</a>]</td><td class="align_center">Has complicated Pareto optimal solutions with dynamic non-dominated set and Pareto front</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>RPOOT problem characteristics.</div>

Mathematical Problems in Engineering

tab2

Table 2

Table 2: E-dyNSGA-III: A Multi-Objective Algorithm for Handling Pareto Optimality over Time 