scholarly journals A New Approach to Identifying a Multi-Criteria Decision Model Based on Stochastic Optimization Techniques

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1551 ◽  
Author(s):  
Bartłomiej Kizielewicz ◽  
Wojciech Sałabun

Many scientific papers are devoted to solving multi-criteria problems. Researchers solve these problems, usually using methods that find discrete solutions and with the collaboration of domain experts. In both symmetrical and asymmetrical problems, the challenge is when new decision-making variants emerge. Unfortunately, discreet identification of preferences makes it impossible to determine the preferences for new alternatives. In this work, we propose a new approach to identifying a multi-criteria decision model to address this challenge. Our proposal is based on stochastic optimization techniques and the characteristic objects method (COMET). An extensive work comparing the use of hill-climbing, simulated annealing, and particle swarm optimization algorithms are presented in this paper. The paper also contains preliminary studies on initial conditions. Finally, our approach has been demonstrated using a simple numerical example.

Algorithms ◽  
2020 ◽  
Vol 13 (5) ◽  
pp. 108
Author(s):  
Alexey Vakhnin ◽  
Evgenii Sopov

Many modern real-valued optimization tasks use “black-box” (BB) models for evaluating objective functions and they are high-dimensional and constrained. Using common classifications, we can identify them as constrained large-scale global optimization (cLSGO) tasks. Today, the IEEE Congress of Evolutionary Computation provides a special session and several benchmarks for LSGO. At the same time, cLSGO problems are not well studied yet. The majority of modern optimization techniques demonstrate insufficient performance when confronted with cLSGO tasks. The effectiveness of evolution algorithms (EAs) in solving constrained low-dimensional optimization problems has been proven in many scientific papers and studies. Moreover, the cooperative coevolution (CC) framework has been successfully applied for EA used to solve LSGO problems. In this paper, a new approach for solving cLSGO has been proposed. This approach is based on CC and a method that increases the size of groups of variables at the decomposition stage (iCC) when solving cLSGO tasks. A new algorithm has been proposed, which combined the success-history based parameter adaptation for differential evolution (SHADE) optimizer, iCC, and the ε-constrained method (namely ε-iCC-SHADE). We investigated the performance of the ε-iCC-SHADE and compared it with the previously proposed ε-CC-SHADE algorithm on scalable problems from the IEEE CEC 2017 Competition on constrained real-parameter optimization.


2017 ◽  
Vol 7 (3) ◽  
pp. 365-375 ◽  
Author(s):  
Aiqing Ruan ◽  
Yinao Wang

Purpose Grey target decision making is one of the important problems of decision-making theory. It is critical to express uncertain information effectively and depose them in a reasonable and simple way. The purpose of this paper is to solve the grey target problem by the grey potential degree method without whiten value and without distribution function. Furthermore, this new approach has an advantage of realizing both comparing and standardization work during the process of treating the data. Design/methodology/approach First, this paper makes a brief overview of the existing method for grey target decision. Then, the conception of a grey potential degree system is introduced and the conception of standard grey potential degree is build up, and a new grey potential-based method based on the grey target multiple attribute decision method is proposed. At the same time, the standard grey potential and its application in multiple resource data are studied. Findings At the same time the standard grey potential and its application in multiple resource data are studied. Standard grey potential is presented by means of three examples together with the comparison with the existing method to demonstrate that the grey potential-based method could be used to solve the problem of grey target decision conveniently and effectively. Originality/value It is very important to compare grey numbers to obtain scientific and reasonable results for a grey target decision-making problem. However, in the actual application of grey numbers, it is difficult to find out the probability density function or the whiten function of grey numbers. When grey numbers are compared and deposed through the whiten value, much information regarding grey numbers will be lost and, at the same time, the value of grey numbers in uncertainty is partly lost. The method discussed in this paper is reasonable and feasible.


2019 ◽  
pp. 125-133
Author(s):  
Duong Truong Thi Thuy ◽  
Anh Pham Thi Hoang

Banking has always played an important role in the economy because of its effects on individuals as well as on the economy. In the process of renovation and modernization of the country, the system of commercial banks has changed dramatically. Business models and services have become more diversified. Therefore, the performance of commercial banks is always attracting the attention of managers, supervisors, banks and customers. Bank ranking can be viewed as a multi-criteria decision model. This article uses the technique for order of preference by similarity to ideal solution (TOPSIS) method to rank some commercial banks in Vietnam.


Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1795
Author(s):  
Manuel Cedillo-Hernandez ◽  
Antonio Cedillo-Hernandez ◽  
Francisco J. Garcia-Ugalde

Robust digital image watermarking is an information security technique that has been widely used to solve several issues related mainly with copyright protection as well as ownership authentication. In general terms, robust watermarking conceals a small signal called a “watermark” in a host image in a form imperceptible to human vision. The efficiency of conventional robust watermarking based on frequency domain depend directly on the results of performance in terms of robustness and imperceptibility. According to the application scenario and the image dataset, it is common practice to adjust the key parameters used by robust watermarking methods in an experimental form; however, this manual adjustment may involve exhaustive tasks and at the same time be a drawback in practical scenarios. In recent years, several optimization techniques have been adopted by robust watermarking to allowing adjusting in an automatic form its key operation parameters, improving thus its performance. In this context, this paper proposes an improved robust watermarking algorithm in discrete Fourier transform via spread spectrum, optimizing the key operation parameters, particularly the amounts of bands and coefficients of frequency as well as the watermark strength factor using particle swarm optimization in conjunction with visual information fidelity and bit correct rate criteria. Experimental results obtained in this research show improved robustness against common signal processing and geometric distortions, preserving a high visual quality in color images. Performance comparison with conventional discrete Fourier transform proposal is provided, as well as with the current state-of-the-art of particle swarm optimization applied to image watermarking.


Sign in / Sign up

Export Citation Format

Share Document