Elitist Multi-objective Particle Swarm Optimization with Fuzzy Multi-attribute Decision Making for Power Dispatch

2012 ◽  
Vol 40 (14) ◽  
pp. 1562-1585 ◽  
Author(s):  
Saksorn Chalermchaiarbha ◽  
Weerakorn Ongsakul
2014 ◽  
Vol 4 (1) ◽  
pp. 48 ◽  
Author(s):  
Abdorrahman Haeri ◽  
Kamran Rezaie ◽  
Seyed Morteza Hatefi

In recent years, integration between companies, suppliers or organizational departments attracted much attention. Decision making about integration encounters with major concerns. One of these concerns is which units should be integrated and what is the effect of integration on performance measures. In this paper the problem of decision making unit (DMU) integration is considered. It is tried to integrate DMUs so that the considered criteria are satisfied. In this research two criteria are considered that are mean of efficiencies of DMUs and the difference between DMUs that have largest and smallest efficiencies. For this purpose multi objective particle swarm optimization (MOPSO) is applied. A case with 17 DMUs is considered. The results show that integration has increased both considered criteria effectively.  Additionally this approach can presents different alternatives for decision maker (DM) that enables DM to select the final decision for integration.


Author(s):  
Javad Ansarifar ◽  
Reza Tavakkoli-Moghaddam ◽  
Faezeh Akhavizadegan ◽  
Saman Hassanzadeh Amin

This article formulates the operating rooms considering several constraints of the real world, such as decision-making styles, multiple stages for surgeries, time windows for resources, and specialty and complexity of surgery. Based on planning, surgeries are assigned to the working days. Then, the scheduling part determines the sequence of surgeries per day. Moreover, an integrated fuzzy possibilistic–stochastic mathematical programming approach is applied to consider some sources of uncertainty, simultaneously. Net revenues of operating rooms are maximized through the first objective function. Minimizing a decision-making style inconsistency among human resources and maximizing utilization of operating rooms are considered as the second and third objectives, respectively. Two popular multi-objective meta-heuristic algorithms including Non-dominated Sorting Genetic Algorithm and Multi-Objective Particle Swarm Optimization are utilized for solving the developed model. Moreover, different comparison metrics are applied to compare the two proposed meta-heuristics. Several test problems based on the data obtained from a public hospital located in Iran are used to display the performance of the model. According to the results, Non-dominated Sorting Genetic Algorithm-II outperforms the Multi-Objective Particle Swarm Optimization algorithm in most of the utilized metrics. Moreover, the results indicate that our proposed model is more effective and efficient to schedule and plan surgeries and assign resources than manual scheduling.


Author(s):  
Rahul Roy ◽  
Satchidananda Dehuri ◽  
Sung Bae Cho

The Combinatorial problems are real world decision making problem with discrete and disjunctive choices. When these decision making problems involve more than one conflicting objective and constraint, it turns the polynomial time problem into NP-hard. Thus, the straight forward approaches to solve multi-objective problems would not give an optimal solution. In such case evolutionary based meta-heuristic approaches are found suitable. In this paper, a novel particle swarm optimization based meta-heuristic algorithm is presented to solve multi-objective combinatorial optimization problems. Here a mapping method is considered to convert the binary and discrete values (solution encoded as particles) to a continuous domain and update it using the velocity and position update equation of particle swarm optimization to find new set of solutions in continuous domain and demap it to discrete values. The performance of the algorithm is compared with other evolutionary strategy like SPEA and NSGA-II on pseudo-Boolean discrete problems and multi-objective 0/1 knapsack problem. The experimental results confirmed the better performance of combinatorial particle swarm optimization algorithm.


Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2211
Author(s):  
Na Wei ◽  
Mingyong Liu ◽  
Weibin Cheng

This paper proposes a multi-objective decision-making model for underwater countermeasures based on a multi-objective decision theory and solves it using the multi-objective discrete particle swarm optimization (MODPSO) algorithm. Existing decision-making models are based on fully allocated assignment without considering the weapon consumption and communication delay, which does not conform to the actual naval combat process. The minimum opponent residual threat probability and minimum own-weapon consumption are selected as two functions of the multi-objective decision-making model in this paper. Considering the impact of the communication delay, the multi-objective discrete particle swarm optimization (MODPSO) algorithm is proposed to obtain the optimal solution of the distribution scheme with different weapon consumptions. The algorithm adopts the natural number coding method, and the particle corresponds to the confrontation strategy. The simulation result shows that underwater communication delay impacts the decision-making selection. It verifies the effectiveness of the proposed model and the proposed multi-objective discrete particle swarm optimization algorithm.


Sign in / Sign up

Export Citation Format

Share Document