A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://ai.vub.ac.be/sites/default/files/adaptiveIEEE_v4.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ytoro7uhpvfojcamm6db7sb5si" style="color: black;">2013 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM)</a>
Searching in multi-objective search spaces is considered a challenging problem. Pareto local search (PLS) searches directly into the multi-objective search space maintaining an archive of best non-dominated solutions found so far, the nondominated archive. PLS' advantage is the exploitation of relationships between solutions in the non-dominated archive at the cost of high maintenance costs of the archive. The scalarized local search (SLS) uses scalarization functions to transform the<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mcdm.2013.6595442">doi:10.1109/mcdm.2013.6595442</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cimcdm/Drugan13.html">dblp:conf/cimcdm/Drugan13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sk7bz7kfjjguvdxjewtf65r4sa">fatcat:sk7bz7kfjjguvdxjewtf65r4sa</a> </span>
more »... tive search space into a single objective search space. SLS is faster because it is searching in a single objective search space but the independent scalarization functions do not systematic exploit the structure of the multi-objective search space. We improve the performance of SLS algorithms by allowing interactions between scalarization functions. The adaptive scalarization functions select frequently the scalarization function that generates well performing SLS. The genetic scalarization functions assume that the scalarization functions have commonalities that can be exploited using genetic like operators. We experimentally show that the proposed techniques can improve the performance of local search algorithms on correlated bi-objective QAP instances.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200709143431/https://ai.vub.ac.be/sites/default/files/adaptiveIEEE_v4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d9/2d/d92d5073fc5a8e62d750871313eef6d863b9ae1a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mcdm.2013.6595442"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>