Embedding a Repair Operator in Evolutionary Single and Multi-objective Algorithms - An Exploitation-Exploration Perspective

2021 ◽  
pp. 89-101
Author(s):  
Kalyanmoy Deb ◽  
Sukrit Mittal ◽  
Dhish Kumar Saxena ◽  
Erik D. Goodman
Keyword(s):  
Multi Objective ◽  
Repair Operator

Reliability-Based Robust Design Optimization in Consideration of Manufacturing Tolerance by Multi-Objective Evolutionary Optimization with Repair Algorithm

2021 ◽  
pp. 2150005
Author(s):  
Gang Li ◽  
Ye Liu ◽  
Gang Zhao ◽  
Yan Zeng
Keyword(s):  
Design Optimization ◽  
Robust Design ◽  
Robust Design Optimization ◽  
Manufacturing Cost ◽  
Multi Objective Optimization ◽  
Random Design ◽  
Multi Objective ◽  
Design Variables ◽  
Objective Robustness ◽  
Repair Operator

There are inherently various uncertainties in practical engineering, and reliability-based design optimization (RBDO) and robust design optimization (RDO) are two well-established methodologies when considering the uncertainties. Naturally, reliability-based robust design optimization (RBRDO) is a methodology developed recently by combining RBDO and RDO, in which the tolerances of random design variables are always assumed as constants. However, the tolerance of random design variables is a key factor for the objective robustness and manufacturing cost, and the tolerance allocation is the core problem in mechanical manufacturing. Inspired by the cost–tolerance relationship in mechanical manufacturing, this paper presents an integrated framework to simultaneously find the optimal design variable and the corresponding tolerance in the multi-objective RBRDO, with the trade-off between objective robustness and manufacturing cost. The failure mechanism of the constraint handling strategy of the constrained reference vector-guided evolutionary algorithm (C-RVEA) is discussed to solve the multi-objective optimization formulation. Then the robust repair operator and reliability-based repair operator are proposed to transform unfeasible solutions to the feasible ones under reliability constraints. Numerical results reveal that the proposed repair algorithm is effective. By solving the integrated multi-objective optimization problem, the Pareto front with the compromised solutions between the objective robustness and manufacturing cost could be obtained, from which decision makers can select the satisfying solution conveniently according to the preferred requirements.

scholarly journals A coevolutionary algorithm based on the auxiliary population for constrained large-scale multi-objective supply chain network

2021 ◽  
Vol 19 (1) ◽  
pp. 271-286
Author(s):  
Xin Zhang ◽  
◽  
Zhaobin Ma ◽  
Bowen Ding ◽  
Wei Fang ◽  
...  
Keyword(s):  
Supply Chain ◽  
Large Scale ◽  
Complex Problem ◽  
Supply Chain Network ◽  
Multi Objective ◽  
Coevolutionary Algorithm ◽  
Two Populations ◽  
Operation Cost ◽  
Repair Operator ◽  
Operation And Management

<abstract> <p>Supply chain network is important for the enterprise to improve the operation and management, but has become more complicated to optimize in reality. With the consideration of multiple objectives and constraints, this paper proposes a constrained large-scale multi-objective supply chain network (CLMSCN) optimization model. This model is to minimize the total operation cost (including the costs of production, transportation, and inventory) and to maximize the customer satisfaction under the capacity constraints. Besides, a coevolutionary algorithm based on the auxiliary population (CAAP) is proposed, which uses two populations to solve the CLMSCN problem. One population is to solve the original complex problem, and the other population is to solve the problem without any constraints. If the infeasible solutions are generated in the first population, a linear repair operator will be used to improve the feasibility of these solutions. To validate the effectivity of the CAAP algorithm, the experiment is conducted on the randomly generated instances with three different problem scales. The results show that the CAAP algorithm can outperform other compared algorithms, especially on the large-scale instances.</p> </abstract>

Fuzzy multi-objective decision making approach for nuclear power plant installation

2020 ◽  
Vol 39 (5) ◽  
pp. 6339-6350
Author(s):  
Esra Çakır ◽  
Ziya Ulukan
Keyword(s):  
Linear Programming ◽  
Power Plant ◽  
Nuclear Power Plant ◽  
Energy Supply ◽  
Energy Demand ◽  
Nuclear Power ◽  
Power Plants ◽  
Total Duration ◽  
Objective Functions ◽  
Multi Objective

Due to the increase in energy demand, many countries suffer from energy poverty because of insufficient and expensive energy supply. Plans to use alternative power like nuclear power for electricity generation are being revived among developing countries. Decisions for installation of power plants need to be based on careful assessment of future energy supply and demand, economic and financial implications and requirements for technology transfer. Since the problem involves many vague parameters, a fuzzy model should be an appropriate approach for dealing with this problem. This study develops a Fuzzy Multi-Objective Linear Programming (FMOLP) model for solving the nuclear power plant installation problem in fuzzy environment. FMOLP approach is recommended for cases where the objective functions are imprecise and can only be stated within a certain threshold level. The proposed model attempts to minimize total duration time, total cost and maximize the total crash time of the installation project. By using FMOLP, the weighted additive technique can also be applied in order to transform the model into Fuzzy Multiple Weighted-Objective Linear Programming (FMWOLP) to control the objective values such that all decision makers target on each criterion can be met. The optimum solution with the achievement level for both of the models (FMOLP and FMWOLP) are compared with each other. FMWOLP results in better performance as the overall degree of satisfaction depends on the weight given to the objective functions. A numerical example demonstrates the feasibility of applying the proposed models to nuclear power plant installation problem.

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Solving Fully Fuzzy Multi-Objective Linear Programming Problems

2012 ◽  
Vol 3 (4) ◽  
pp. 1-6 ◽  
Author(s):  
M.Jayalakshmi M.Jayalakshmi ◽  
◽  
P.Pandian P.Pandian
Keyword(s):  
Linear Programming ◽  
Multi Objective ◽  
Linear Programming Problems
Sign in / Sign up

Export Citation Format

Share Document