scholarly journals Effect of the Profile of the Decision Maker in the Search for Solutions in the Decision-Making Process

2021 ◽  
Vol 26 (2) ◽  
pp. 28
Author(s):  
Mercedes Perez-Villafuerte ◽  
Laura Cruz-Reyes ◽  
Nelson Rangel-Valdez ◽  
Claudia Gomez-Santillan ◽  
Héctor Fraire-Huacuja
Keyword(s):  
Optimization Problems ◽  
Region Of Interest ◽  
Multi Objective Optimization ◽  
Ordinal Classification ◽  
Multi Objective ◽  
Portfolio Problem ◽  
Real Size ◽  
Early Phases ◽  
Incorporation Method

Many real-world optimization problems involving several conflicting objective functions frequently appear in current scenarios and it is expected they will remain present in the future. However, approaches combining multi-objective optimization with the incorporation of the decision maker’s (DM’s) preferences through multi-criteria ordinal classification are still scarce. In addition, preferences are rarely associated with a DM’s characteristics; the preference selection is arbitrary. This paper proposes a new hybrid multi-objective optimization algorithm called P-HMCSGA (preference hybrid multi-criteria sorting genetic algorithm) that allows the DM’s preferences to be incorporated in the optimization process’ early phases and updated into the search process. P-HMCSGA incorporates preferences using a multi-criteria ordinal classification to distinguish solutions as good and bad; its parameters are determined with a preference disaggregation method. The main feature of P-HMCSGA is the new method proposed to associate preferences with the characterization profile of a DM and its integration with ordinal classification. This increases the selective pressure towards the desired region of interest more in agreement with the DM’s preferences specified in realistic profiles. The method is illustrated by solving real-size multi-objective PPPs (project portfolio problem). The experimentation aims to answer three questions: (i) To what extent does allowing the DM to express their preferences through a characterization profile impact the quality of the solution obtained in the optimization? (ii) How sensible is the proposal to different profiles? (iii) How much does the level of robustness of a profile impact the quality of final solutions (this question is related with the knowledge level that a DM has about his/her preferences)? Concluding, the proposal fulfills several desirable characteristics of a preferences incorporation method concerning these questions.

A multi-objective evolutionary algorithm based on niche selection in solving irregular Pareto fronts

2021 ◽  
pp. 1-21
Author(s):  
Xin Li ◽  
Xiaoli Li ◽  
Kang Wang
Keyword(s):  
Evolutionary Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Benchmark Problems ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Environmental Selection ◽  
Optimal Solution Set ◽  
Pareto Fronts

The key characteristic of multi-objective evolutionary algorithm is that it can find a good approximate multi-objective optimal solution set when solving multi-objective optimization problems(MOPs). However, most multi-objective evolutionary algorithms perform well on regular multi-objective optimization problems, but their performance on irregular fronts deteriorates. In order to remedy this issue, this paper studies the existing algorithms and proposes a multi-objective evolutionary based on niche selection to deal with irregular Pareto fronts. In this paper, the crowding degree is calculated by the niche method in the process of selecting parents when the non-dominated solutions converge to the first front, which improves the the quality of offspring solutions and which is beneficial to local search. In addition, niche selection is adopted into the process of environmental selection through considering the number and the location of the individuals in its niche radius, which improve the diversity of population. Finally, experimental results on 23 benchmark problems including MaF and IMOP show that the proposed algorithm exhibits better performance than the compared MOEAs.

scholarly journals Comparison of synchronous and asynchronous parallelization of extreme surrogate-assisted multi-objective evolutionary algorithm

2020 ◽  
Author(s):  
Tomohiro Harada ◽  
Misaki Kaidan ◽  
Ruck Thawonmas
Keyword(s):  
Machine Learning ◽  
Evolutionary Algorithm ◽  
Optimization Problems ◽  
Computing Time ◽  
The Other ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Evaluation Time ◽  
Surrogate Function

Abstract This paper investigates the integration of a surrogate-assisted multi-objective evolutionary algorithm (MOEA) and a parallel computation scheme to reduce the computing time until obtaining the optimal solutions in evolutionary algorithms (EAs). A surrogate-assisted MOEA solves multi-objective optimization problems while estimating the evaluation of solutions with a surrogate function. A surrogate function is produced by a machine learning model. This paper uses an extreme learning surrogate-assisted MOEA/D (ELMOEA/D), which utilizes one of the well-known MOEA algorithms, MOEA/D, and a machine learning technique, extreme learning machine (ELM). A parallelization of MOEA, on the other hand, evaluates solutions in parallel on multiple computing nodes to accelerate the optimization process. We consider a synchronous and an asynchronous parallel MOEA as a master-slave parallelization scheme for ELMOEA/D. We carry out an experiment with multi-objective optimization problems to compare the synchronous parallel ELMOEA/D with the asynchronous parallel ELMOEA/D. In the experiment, we simulate two settings of the evaluation time of solutions. One determines the evaluation time of solutions by the normal distribution with different variances. On the other hand, another evaluation time correlates to the objective function value. We compare the quality of solutions obtained by the parallel ELMOEA/D variants within a particular computing time. The experimental results show that the parallelization of ELMOEA/D significantly reduces the computational time. In addition, the integration of ELMOEA/D with the asynchronous parallelization scheme obtains higher quality of solutions quicker than the synchronous parallel ELMOEA/D.

scholarly journals A Simple Proposal for Including Designer Preferences in Multi-Objective Optimization Problems

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 991
Author(s):  
Xavier Blasco ◽  
Gilberto Reynoso-Meza ◽  
Enrique A. Sánchez-Pérez ◽  
Juan Vicente Sánchez-Pérez ◽  
Natalia Jonard-Pérez
Keyword(s):  
Decision Making ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Region Of Interest ◽  
Underlying Structure ◽  
Multi Objective Optimization ◽  
Number Of Solutions ◽  
Multi Objective ◽  
Objective Space ◽  
Definition Of

Including designer preferences in every phase of the resolution of a multi-objective optimization problem is a fundamental issue to achieve a good quality in the final solution. To consider preferences, the proposal of this paper is based on the definition of what we call a preference basis that shows the preferred optimization directions in the objective space. Associated to this preference basis a new basis in the objective space—dominance basis—is computed. With this new basis the meaning of dominance is reinterpreted to include the designer’s preferences. In this paper, we show the effect of changing the geometric properties of the underlying structure of the Euclidean objective space by including preferences. This way of incorporating preferences is very simple and can be used in two ways: by redefining the optimization problem and/or in the decision-making phase. The approach can be used with any multi-objective optimization algorithm. An advantage of including preferences in the optimization process is that the solutions obtained are focused on the region of interest to the designer and the number of solutions is reduced, which facilitates the interpretation and analysis of the results. The article shows an example of the use of the preference basis and its associated dominance basis in the reformulation of the optimization problem, as well as in the decision-making phase.

BAT and Hybrid BAT Meta-Heuristic for Quality of Service-Based Web Service Selection

2017 ◽  
Vol 26 (1) ◽  
pp. 123-137 ◽  
Author(s):  
Prashanth Podili ◽  
K.K. Pattanaik ◽  
Prashanth Singh Rana
Keyword(s):  
Service Composition ◽  
Optimization Problems ◽  
Service Selection ◽  
Multi Objective Optimization ◽  
Data Set ◽  
Multi Objective ◽  
Heuristic Techniques ◽  
Web Service Selection ◽  
Discrete Pso

AbstractEfficient QoS-based service selection from a pool of functionally substitutable web services (WS) for constructing composite WS is important for an efficient business process. Service composition based on diverse QoS requirements is a multi-objective optimization problem. Meta-heuristic techniques such as genetic algorithm (GA), particle swarm optimization (PSO), and variants of PSO have been extensively used for solving multi-objective optimization problems. The efficiency of any such meta-heuristic techniques lies with their rate of convergence and execution time. This article evaluates the efficiency of BAT and Hybrid BAT algorithms against the existing GA and Discrete PSO techniques in the context of service selection problems. The proposed algorithms are tested on the QWS data set to select the best fit services in terms of maximum aggregated end-to-end QoS parameters. Hybrid BAT is found to be efficient for service composition.

scholarly journals CORAL-DMOEA: Correlation Alignment-Based Information Transfer for Dynamic Multi-Objective Optimization (Student Abstract)

2020 ◽  
Vol 34 (10) ◽  
pp. 13765-13766
Author(s):  
Li Chen ◽  
Hua Xu
Keyword(s):  
Information Transfer ◽  
Optimization Problems ◽  
Optimization Process ◽  
Transfer Model ◽  
Initial Population ◽  
Multi Objective Optimization ◽  
Essential Characteristic ◽  
Multi Objective ◽  
Highly Correlated

One essential characteristic of dynamic multi-objective optimization problems is that Pareto-Optimal Front/Set (POF/POS) varies over time. Tracking the time-dependent POF/POS is a challenging problem. Since continuous environments are usually highly correlated, past information is critical for the next optimization process. In this paper, we integrate CORAL methodology into a dynamic multi-objective evolutionary algorithm, named CORAL-DMOEA. This approach employs CORAL to construct a transfer model which transfer past well-performed solutions to form an initial population for the next optimization process. Experimental results demonstrate that CORAL-DMOEA can effectively improve the quality of solutions and accelerate the evolution process.

Sign in / Sign up

Export Citation Format

Share Document