scholarly journals Optimal Selective Maintenance Decision-Making for Consecutive-Mission Systems with Variable Durations and Limited Maintenance Time

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Huiying Gao ◽  
Xiaoqiang Zhang ◽  
Xiaoqiang Yang ◽  
Bo Zheng
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Great Influence ◽  
Maintenance Strategy ◽  
Maintenance Time ◽  
Selective Maintenance ◽  
Maintenance Decision ◽  
Set Up ◽  
Maintenance Model ◽  
Repairable Components

Maintenance is inevitable for repairable components or systems in modern industries. Since the maintenance effectiveness has a great influence on the subsequent operations and in addition, different maintenance options are possible for the components of the system during the break between any two successive missions, the optimal selective maintenance strategy needs to be determined for a system performing successive missions. A number of selective maintenance models were set up on the basis that the durations of each mission are predetermined, the maintenance time is negligible, and the states of the components at the end of the previous mission can be accurately obtained. However, in the actual industrial and military missions, these premises may not always hold. In this paper, a novel selective maintenance model under uncertainties and limited maintenance time is proposed to improve these deficiencies. The genetic algorithm is selected to solve the optimization problem, and an illustrative example is presented to demonstrate the proposed method. The optimal selective maintenance decision without the constraint of maintenance time is used for comparison.

Research on the Application of Using Genetic Algorithm in Military Materials Delivery

2013 ◽  
Vol 785-786 ◽  
pp. 1399-1402
Author(s):  
Wu Jun Zhang
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
New Technology ◽  
Basic Theory ◽  
Complicated System ◽  
Set Up ◽  
The Military ◽  
Living Creature

Military materials delivery is new technology of logistics, and can help the army to easily and accurately deliver the military materials to every point to be guaranteed. Military materials delivery is gradually used; the optimization problem of the delivery process had been appeared. Genetic algorithm is imitate living creature environment in of a kind of orientation overall situation of the genetic, can be professional at solving complicated system or the huge problem. Thus, the paper firstly introduced the basic theory of military materials delivery, including the definition, principle, factors to set up the model of military materials delivery; then analyzed the process of genetic algorithm, using it to optimize the military materials delivery, example was given out.

Selective maintenance of multi-state series systems considering maintenance quality uncertainty and failure effects

2021 ◽  
pp. 095440892199693
Author(s):  
Xinlong Li ◽  
Yan Ran ◽  
Genbao Zhang ◽  
Hui Yu
Keyword(s):  
Decision Maker ◽  
Engineering Practice ◽  
Quality Uncertainty ◽  
Equipment Operation ◽  
System Maintenance ◽  
Selective Maintenance ◽  
Maintenance Decision ◽  
Series Systems ◽  
Maintenance Model

In order to improve the lifetime and reliability of equipment operation stage, it is necessary to carry out maintenance for components. The typical selective maintenance model does not consider the maintenance quality uncertainty and the failure effects, which may make the decision-maker overestimates the reliability of completing the next task after system maintenance, resulting in incorrect maintenance decision and prone to serious consequences of failure. In this paper, the potential discrepancy between the target maintenance quality and the actual maintenance quality of the decision maker is considered. At the same time, a multi-state FMECA is proposed to measure the failure effects under different states. Finally, the selective maintenance model of the multi-state series systems is established and solved by the genetic algorithm. The results show that considering the effect of component failure and the uncertainty of maintenance quality has an influence on maintenance decision. The maintenance decision made in this way is more consistent with the engineering practice.

Application of Improved Genetic Algorithm in Maintenance Decision for Turbine-Generator Unit

2010 ◽  
Vol 44-47 ◽  
pp. 2940-2944
Author(s):  
Qing He ◽  
Jian Ding Zhang
Keyword(s):  
Genetic Algorithm ◽  
Heuristic Algorithms ◽  
Maintenance Scheduling ◽  
Improved Genetic Algorithm ◽  
Turbine Generator ◽  
Executive Process ◽  
Generator Unit ◽  
Maintenance Decision ◽  
Constrained Conditions ◽  
Operating Unit

The complicated function relations are more prone to appear in the maintenance scheduling of steam-turbine generator unit. Many constrained conditions are often attendant with these function relations. In these situations, the traditional method often can not obtain the exact value. The genetic algorithm (GA), a kind of the heuristic algorithms, does not need the function own good analytic properties. In addition, as the operating unit of GA is the group, so it applies to the parallel computing process. In GA executive process, the offspring continually inherit the genes from the parents, so it is more prone to be involved in the local convergence. An improved genetic algorithm is proposed and used in the model of maintenance decision of turbine-generator unit under. The goal of the model is to seek to the rational maintenance scheduling of the generator unit, so as to minimize the sum of the maintenance expense, the loss of the profit on the generated energy, and the loss of the penalty. It is proved by the example that IGA is highly efficient.

scholarly journals The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics

2020 ◽  
Vol 12 (23) ◽  
pp. 9818
Author(s):  
Gabriel Fedorko ◽  
Vieroslav Molnár ◽  
Nikoleta Mikušová
Keyword(s):  
Genetic Algorithm ◽  
Simulation Model ◽  
Optimization Problem ◽  
Software Tool ◽  
Time Saving ◽  
General Validity ◽  
Resistance Function ◽  
Genetic Algorithm Method ◽  
Working Day ◽  
Enterprise Logistics

This paper examines the use of computer simulation methods to streamline the process of picking materials within warehouse logistics. The article describes the use of a genetic algorithm to optimize the storage of materials in shelving positions, in accordance with the method of High-Runner Strategy. The goal is to minimize the time needed for picking. The presented procedure enables the creation of a software tool in the form of an optimization model that can be used for the needs of the optimization of warehouse logistics processes within various types of production processes. There is a defined optimization problem in the form of a resistance function, which is of general validity. The optimization is represented using the example of 400 types of material items in 34 categories, stored in six rack rows. Using a simulation model, a comparison of a normal and an optimized state is realized, while a time saving of 48 min 36 s is achieved. The mentioned saving was achieved within one working day. However, the application of an approach based on the use of optimization using a genetic algorithm is not limited by the number of material items or the number of categories and shelves. The acquired knowledge demonstrates the application possibilities of the genetic algorithm method, even for the lowest levels of enterprise logistics, where the application of this approach is not yet a matter of course but, rather, a rarity.

scholarly journals An Improved MOEA/D Based on Reference Distance for Software Project Portfolio Optimization

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jing Xiao ◽  
Jing-Jing Li ◽  
Xi-Xi Hong ◽  
Min-Mei Huang ◽  
Xiao-Min Hu ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Experimental Comparison ◽  
Software Project ◽  
Project Portfolio ◽  
Multiobjective Evolutionary Algorithms ◽  
Reference Distance ◽  
Nondominated Sorting

As it is becoming extremely competitive in software industry, large software companies have to select their project portfolio to gain maximum return with limited resources under many constraints. Project portfolio optimization using multiobjective evolutionary algorithms is promising because they can provide solutions on the Pareto-optimal front that are difficult to be obtained by manual approaches. In this paper, we propose an improved MOEA/D (multiobjective evolutionary algorithm based on decomposition) based on reference distance (MOEA/D_RD) to solve the software project portfolio optimization problems with optimizing 2, 3, and 4 objectives. MOEA/D_RD replaces solutions based on reference distance during evolution process. Experimental comparison and analysis are performed among MOEA/D_RD and several state-of-the-art multiobjective evolutionary algorithms, that is, MOEA/D, nondominated sorting genetic algorithm II (NSGA2), and nondominated sorting genetic algorithm III (NSGA3). The results show that MOEA/D_RD and NSGA2 can solve the software project portfolio optimization problem more effectively. For 4-objective optimization problem, MOEA/D_RD is the most efficient algorithm compared with MOEA/D, NSGA2, and NSGA3 in terms of coverage, distribution, and stability of solutions.

ONE IMPROVED AGENT GENETIC ALGORITHM — RING-LIKE AGENT GENETIC ALGORITHM FOR GLOBAL NUMERICAL OPTIMIZATION

2009 ◽  
Vol 26 (04) ◽  
pp. 479-502 ◽  
Author(s):  
BIN LIU ◽  
TEQI DUAN ◽  
YONGMING LI
Keyword(s):  
Genetic Algorithm ◽  
Numerical Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Genetic Operators ◽  
Global Numerical Optimization ◽  
Candidate Solution ◽  
Low Dimension ◽  
Multi Agent ◽  
Agent Structure

In this paper, a novel genetic algorithm — dynamic ring-like agent genetic algorithm (RAGA) is proposed for solving global numerical optimization problem. The RAGA combines the ring-like agent structure and dynamic neighboring genetic operators together to get better optimization capability. An agent in ring-like agent structure represents a candidate solution to the optimization problem. Any agent interacts with neighboring agents to evolve. With dynamic neighboring genetic operators, they compete and cooperate with their neighbors, and they can also use knowledge to increase energies. Global numerical optimization problems are the most important ones to verify the performance of evolutionary algorithm, especially of genetic algorithm and are mostly of interest to the corresponding researchers. In the corresponding experiments, several complex benchmark functions were used for optimization, several popular GAs were used for comparison. In order to better compare two agents GAs (MAGA: multi-agent genetic algorithm and RAGA), the several dimensional experiments (from low dimension to high dimension) were done. These experimental results show that RAGA not only is suitable for optimization problems, but also has more precise and more stable optimization results.

Optimal Placement of Horizontal- and Vertical-Axis Wind Turbines in a Wind Farm for Maximum Power Generation Using a Genetic Algorithm

2011 ◽  
Author(s):  
Xiaomin Chen ◽  
Ramesh Agarwal
Keyword(s):  
Genetic Algorithm ◽  
Wind Turbines ◽  
Wind Farm ◽  
Optimization Problem ◽  
Vertical Axis ◽  
Optimal Placement ◽  
Vertical Axis Wind Turbines ◽  
Wake Effects ◽  
Horizontal Axis Wind Turbines ◽  
Wake Model

In this paper, we consider the Wind Farm layout optimization problem using a genetic algorithm. Both the Horizontal–Axis Wind Turbines (HAWT) and Vertical-Axis Wind Turbines (VAWT) are considered. The goal of the optimization problem is to optimally place the turbines within the wind farm such that the wake effects are minimized and the power production is maximized. The reasonably accurate modeling of the turbine wake is critical in determination of the optimal layout of the turbines and the power generated. For HAWT, two wake models are considered; both are found to give similar answers. For VAWT, a very simple wake model is employed.

Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm

2021 ◽  
Author(s):  
Ovidiu Cosma ◽  
Petrică C Pop ◽  
Cosmin Sabo
Keyword(s):  
Genetic Algorithm ◽  
Supply Chain ◽  
Network Design ◽  
Design Problem ◽  
Optimization Problem ◽  
Hybrid Genetic Algorithm ◽  
Network Design Problem ◽  
Supply Chain Network Design ◽  
Supply Chain Network ◽  
Fixed Costs

Abstract In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature.

Sign in / Sign up

Export Citation Format

Share Document