Pub. online:28 Feb 2023Type:Research ArticleOpen Access
Journal:Informatica
Volume 34, Issue 2 (2023), pp. 415–448
Abstract
Multiple Criteria Decision-Making (MCDM) is one of the most reliable and applicable decision-making tools to address real-life complex and multi-dimensional problems in accordance with the concepts of sustainable development and circular economy. Although there have been several literature reviews on several MCDM methods, there is a research gap in conducting a literature review on the Multi-Attributive Border Approximation area Comparison (MABAC) as a useful technique to deal with intelligent decision-making systems. This study attempts to present a comprehensive literature review of 117 articles on recent developments and applications of MABAC. Future outlook is provided considering challenges and current trends.
Pub. online:29 Jan 2021Type:Research ArticleOpen Access
Journal:Informatica
Volume 32, Issue 1 (2021), pp. 85–118
Abstract
The data-driven approach is popular to automate learning of fuzzy rules and tuning membership function parameters in fuzzy inference systems (FIS) development. However, researchers highlight different challenges and issues of this FIS development because of its complexity. This paper evaluates the current state of the art of FIS development complexity issues in Computer Science, Software Engineering and Information Systems, specifically: 1) What complexity issues exist in the context of developing FIS? 2) Is it possible to systematize existing solutions of identified complexity issues? We have conducted a hybrid systematic literature review combined with a systematic mapping study that includes keyword map to address these questions. This review has identified the main FIS development complexity issues that practitioners should consider when developing FIS. The paper also proposes a framework of complexity issues and their possible solutions in FIS development.
Journal:Informatica
Volume 23, Issue 4 (2012), pp. 601–620
Abstract
Multidimensional scaling with city-block distances is considered in this paper. The technique requires optimization of an objective function which has many local minima and can be non-differentiable at minimum points. This study is aimed at developing a fast and effective global optimization algorithm spanning the whole search domain and providing good solutions. A multimodal evolutionary algorithm is used for global optimization to prevent stagnation at bad local optima. Piecewise quadratic structure of the least squares objective function with city-block distances has been exploited for local improvement. The proposed algorithm has been compared with other algorithms described in literature. Through a comprehensive computational study, it is shown that the proposed algorithm provides the best results. The algorithm with fine-tuned parameters finds the global minimum with a high probability.