TY - JOUR AU - Yeomans, Julian Scott PY - 2018/11/03 Y2 - 2024/03/29 TI - An Algorithm for Generating Sets of Maximally Different Alternatives Using Population-Based Metaheuristic Procedures JF - Transactions on Engineering and Computing Sciences JA - TECS VL - 6 IS - 5 SE - Articles DO - 10.14738/tmlai.65.5184 UR - https://journals.scholarpublishing.org/index.php/TMLAI/article/view/5184 SP - 01 AB - <p style="margin: 0cm 0cm 6pt;"><span lang="EN-US"><span style="font-family: Calibri; font-size: medium;">“Real world” problems typically possess complex performance conditions peppered with inconsistent performance requirements. This situation occurs because multifaceted problems are often riddled with incompatible performance objectives and contradictory design requirements which can be difficult – if not impossible – to specify when the requisite decision models are formulated. Thus, it is often desirable to generate a set of disparate alternatives that provide diverse approaches to the problem. These dissimilar options should be close-to-optimal with respect to any specified objective(s), but remain maximally different from all other solutions in the decision space. The approach for creating maximally different sets of solutions is referred to as modelling-to-generate-alternatives (MGA). This paper outlines an MGA algorithmic approach that can simultaneously generate a set of maximally different alternatives using any population-based metaheuristic.</span></span></p> ER -