Optimization Method for Departure Flight Scheduling Problem Based on Genetic Algorithm

Except for the bad weather or other uncontrollable reasons,a reasonable queue of departure and arrival flights is one of the important methods to reduce the delay on busy airports.Here focusing on the Pareto optimization of departure flights,the take-off sequencing is taken as a single machine scheduling problem with two objective functions,i.e.,the minimum of total weighted delayed number of departure flights and the latest delay time of delayed flight.And the integer programming model is established and solved by multi-objective genetic algorithm.The simulation results show that the method can obtain the better goal,and provide a variety of options for controllers considering the scene situation,thus improving the flexibility and effectivity of flight plan.

Task Scheduling Optimization in Cloud Computing Based on Genetic Algorithms

Task scheduling is the main problem in cloud computing that reduces system performance;it is an important way to arrange user needs and perform multiple goals.Cloud computing is the most popular technology nowadays and has many research potential in various areas like resource allocation,task scheduling,security,privacy,etc.To improve system performance,an efficient task-scheduling algorithm is required.Existing task-scheduling algorithms focus on task-resource requirements,CPU memory,execution time,and execution cost.In this paper,a task scheduling algorithm based on a Genetic Algorithm(GA)has been presented for assigning and executing different tasks.The proposed algorithm aims to minimize both the completion time and execution cost of tasks and maximize resource utilization.We evaluate our algorithm’s performance by applying it to two examples with a different number of tasks and processors.The first example contains ten tasks and four processors;the computation costs are generated randomly.The last example has eight processors,and the number of tasks ranges from twenty to seventy;the computation cost of each task on different processors is generated randomly.The achieved results show that the proposed approach significantly succeeded in finding the optimal solutions for the three objectives;completion time,execution cost,and resource utilization.

INTEGRATED OPERATOR GENETIC ALGORITHM FOR SOLVING MULTI-OBJECTIVE FLEXIBLE JOB-SHOP SCHEDULING

In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation （GOSR） and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm （IOGA） and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.

The Distribution Population-based Genetic Algorithm for Parameter Optimization PID Controller

Enlightened by distribution of creatures in natural ecology environment, the distributionpopulation-based genetic algorithm (DPGA) is presented in this paper. The searching capability ofthe algorithm is improved by competition between distribution populations to reduce the search zone.This method is applied to design of optimal parameters of PID controllers with examples, and thesimulation results show that satisfactory performances are obtained.

A Grafted Genetic Algorithm for the Job-Shop Scheduling Problem

The standard genetic algorithm has limitations of a low convergence rate and premature convergence in solving the job-shop scheduling problem.To overcome these limitations,this paper presents a new improved hybrid genetic algorithm on the basis of the idea of graft in botany.Through the introduction of a grafted population and crossover probability matrix,this algorithm accelerates the convergence rate greatly and also increases the ability to fight premature convergence.Finally,the approach is tested on a set of standard instances taken from the literature and compared with other approaches.The computation results validate the effectiveness of the proposed algorithm.

Extended Range Guided Munition Parameter Optimization Based on Genetic Algorithms

Many factors influencing range of extended range guided munition （ERGM） are analyzed. The definition domain of the most important three parameters are ascertained by preparatory mathematical simulation, the optimized mathematical model of ERGM maximum range with boundary conditions is created, and parameter optimization based on genetic algorithm （GA） is adopted. In the GA design, three-point crossover is used and the best chromosome is kept so that the convergence speed becomes rapid. Simulation result shows that GA is feasible, the result is good and it can be easy to attain global optimization solution, especially when the objective function is not the convex one for independent variables and it is a multi-parameter problem.

A Genetic Algorithm-based Approach to Scheduling of Batch Production with Maximum Profit

The optimal scheduling of multi-product batch process is studied and a new mathematics model targeting the maximum profit is proposed, which can be solved by the modified genetic algorithm (MGA) with mixed coding (sequence coding and decimal coding) developed by us. In which, the partially matched cross over (PMX) and reverse mutation are used for the sequence coding, whereas the arithmetic crossover and heteropic mutation are used for the decimal coding. In addition, the relationship between production scale and production cost is analyzed and the maximum profit is always a trade-off of the production scale and production cost. Two examples are solved to demonstrate the effectiveness of the method.

A Genetic Algorithm for the Flowshop Scheduling Problem

The flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within the same time.

Job-shop Scheduling with Multi-objectives Based on Genetic Algorithms

The technology of production planning and scheduling is one of the critical technologies that decide whether the automated manufacturing systems can get the expected economy. Job shop scheduling belongs to the special class of NP-hard problems. Most of the algorithms used to optimize this class of problems have an exponential time; that is, the computation time increases exponentially with problem size. In scheduling study, makespan is often considered as the main objective. In this paper, makespan, the due date request of the key jobs, the availability of the key machine, the average wait-time of the jobs, and the similarities between the jobs and so on are taken into account based on the application of mechanical engineering. The job shop scheduling problem with multi-objectives is analyzed and studied by using genetic algorithms based on the mechanics of genetics and natural selection. In this research, the tactics of the coding and decoding and the design of the genetic operators, along with the description of the mathematic model of the multi-objective functions, are presented. Finally an illu-strative example is given to testify the validity of this algorithm.

Wind Turbine Optimal Preventive Maintenance Scheduling Using Fibonacci Search and Genetic Algorithm

Maintenance scheduling is essential and crucial for wind turbines (WTs) to avoid breakdowns andreduce maintenance costs. Many maintenance models have been developed for WTs’ maintenance planning, suchas corrective, preventive, and predictive maintenance. Due to communities’ dependence on WTs for electricityneeds, preventive maintenance is the most widely used method for maintenance scheduling. The downside tousing this approach is that preventive maintenance (PM) is often done in fixed intervals, which is inefficient. In thispaper, a more detailed maintenance plan for a 2 MW WT has been developed. The paper’s focus is to minimize aWT’s maintenance cost based on a WT’s reliability model. This study uses a two-layer optimization framework:Fibonacci and genetic algorithm. The first layer in the optimization method (Fibonacci) finds the optimal numberof PM required for the system. In the second layer, the optimal times for preventative maintenance and optimalcomponents to maintain have been determined to minimize maintenance costs. The Monte Carlo simulationestimates WT component failure times using their lifetime distributions from the reliability model. The estimatedfailure times are then used to determine the overall corrective and PM costs during the system’s lifetime. Finally,an optimal PM schedule is proposed for a 2 MW WT using the presented method. The method used in this papercan be expanded to a wind farm or similar engineering systems.

Research on Flexible Job Shop Scheduling Based on Improved Two-Layer Optimization Algorithm

To improve the productivity,the resource utilization and reduce the production cost of flexible job shops,this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization problem of flexible job shop considering workpiece batching.Firstly,a mathematical model is established to minimize the maximum completion time.Secondly,an improved two-layer optimization algorithm is designed:the outer layer algorithm uses an improved PSO(Particle Swarm Optimization)to solve the workpiece batching problem,and the inner layer algorithm uses an improved GA(Genetic Algorithm)to solve the dual-resource scheduling problem.Then,a rescheduling method is designed to solve the task disturbance problem,represented by machine failures,occurring in the workshop production process.Finally,the superiority and effectiveness of the improved two-layer optimization algorithm are verified by two typical cases.The case results show that the improved two-layer optimization algorithm increases the average productivity by 7.44% compared to the ordinary two-layer optimization algorithm.By setting the different numbers of AGVs(Automated Guided Vehicles)and analyzing the impact on the production cycle of the whole order,this paper uses two indicators,the maximum completion time decreasing rate and the average AGV load time,to obtain the optimal number of AGVs,which saves the cost of production while ensuring the production efficiency.This research combines the solved problem with the real production process,which improves the productivity and reduces the production cost of the flexible job shop,and provides new ideas for the subsequent research.

Optimization of projectile aerodynamic parameters based on hybrid genetic algorithm

Aerodynamic parameters are important factors that affect projectile flight movement. To obtain accurate aerodynamic parameters, a hybrid genetic algorithm is proposed to identify and optimize the aerodynamic parameters of projectile. By combining the traditional simulated annealing method that is easy to fall into local optimum solution but hard to get global parameters with the genetic algorithm that has good global optimization ability but slow local optimization ability, the hybrid genetic algo- rithm makes full use of the advantages of the two algorithms for the optimization of projectile aerodynamic parameters. The simulation results show that the hybrid genetic algorithm is better than a single algorithm.

Optimization of Processing Parameters of Power Spinning for Bushing Based on Neural Network and Genetic Algorithms

A neural network model of key process parameters and forming quality is developed based on training samples which are obtained from the orthogonal experiment and the finite element numerical simulation. Optimization of the process parameters is conducted using the genetic algorithm (GA). The experimental results have shown that a surface model of the neural network can describe the nonlinear implicit relationship between the parameters of the power spinning process:the wall margin and amount of expansion. It has been found that the process of determining spinning technological parameters can be accelerated using the optimization method developed based on the BP neural network and the genetic algorithm used for the process parameters of power spinning formation. It is undoubtedly beneficial towards engineering applications.

Parameters Optimization of the Heating Furnace Control Systems Based on BP Neural Network Improved by Genetic Algorithm

The heating technological requirement of the conventional PID control is difficult to guarantee which based on the precise mathematical model,because the heating furnace for heating treatment with the big inertia,the pure time delay and nonlinear time-varying.Proposed one kind optimized variable method of PID controller based on the genetic algorithm with improved BP network that better realized the completely automatic intelligent control of the entire thermal process than the classics critical purporting(Z-N)method.A heating furnace for the object was simulated with MATLAB,simulation results show that the control system has the quicker response characteristic,the better dynamic characteristic and the quite stronger robustness,which has some promotional value for the control of industrial furnace.

Optimization and Simulation of Plastic Injection Process using Genetic Algorithm and Moldflow

The use of plastic-based products is continuously increasing. The increasing demands for thinner products, lower production costs, yet higher product quality has triggered an increase in the number of research projects on plastic molding processes. An important branch of such research is focused on mold cooling system. Conventional cooling systems are most widely used because they are easy to make by using conventional machining processes. However, the non-uniform cooling processes are considered as one of their weaknesses. Apart from the conven- tional systems, there are also conformal cooling systems that are designed for faster and more uniform plastic mold cooling. In this study, the conformal cooling system is applied for the production of bowl-shaped product made of PP AZ564. Optimization is conducted to initiate machine setup parameters, namely, the melting temperature, injection pressure, holding pressure and holding time. The genetic algorithm method and Moldflow were used to optimize the injection process parameters at a minimum cycle time. It is found that, an optimum injection molding processes could be obtained by setting the parameters to the following values： TM=180℃; Pinj = 20MPa; Phold= 16MPa and thold=8s, with a cycle time of 14.11 s. Experiments using the conformal cooling system yielded an average cycle time of 14.19 s. The studied conformal cooling system yielded a volumetric shrinkage of 5.61% and the wall shear stress was found at 0.17 MPa. The difference between the cycle time obtained through simulations and experiments using the conformal cooling system was insignificant （below 1%）. Thus, combining process parameters optimization and simulations by using genetic algorithm method with Moldflow can be considered as valid.

Inverse procedure for determining model parameter of soils using real-coded genetic algorithm

The hybrid genetic algorithm is utilized to facilitate model parameter estimation.The tri-dimensional compression tests of soil are performed to supply experimental data for identifying nonlinear constitutive model of soil.In order to save computing time during parameter inversion,a new procedure to compute the calculated strains is presented by multi-linear simplification approach instead of finite element method(FEM).The real-coded hybrid genetic algorithm is developed by combining normal genetic algorithm with gradient-based optimization algorithm.The numerical and experimental results for conditioned soil are compared.The forecast strains based on identified nonlinear constitutive model of soil agree well with observed ones.The effectiveness and accuracy of proposed parameter estimation approach are validated.

A Cross Entropy-Genetic Algorithm for m-Machines No-Wait Job-ShopScheduling Problem

No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Several methods have been proposed to solve this problem, both exact (i.e. integer programming) and metaheuristic methods. Cross entropy (CE), as a new metaheuristic, can be an alternative method to solve NWJSS problem. This method has been used in combinatorial optimization, as well as multi-external optimization and rare-event simulation. On these problems, CE implementation results an optimal value with less computational time in average. However, using original CE to solve large scale NWJSS requires high computational time. Considering this shortcoming, this paper proposed a hybrid of cross entropy with genetic algorithm (GA), called CEGA, on m-machines NWJSS. The results are compared with other metaheuritics: Genetic Algorithm-Simulated Annealing (GASA) and hybrid tabu search. The results showed that CEGA providing better or at least equal makespans in comparison with the other two methods.

Genetic algorithm for short-term scheduling of make-and-pack batch production process

This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.

Multi-objective parameter optimization for a single-shaft series-parallel plug-in hybrid electric bus using genetic algorithm

Recently, the single-shaft series-parallel powertrain of Plug-in Hybrid Electric Bus （PHEB） has become one of the most popu- lar powertrains due to its alterable operating modes, excellent fuel economy and strong adaptability for driving cycles. Never- theless, for configuring the PHEB with single-shaft series-parallel powertrain in the development stage, it still faces greater challenge than other configurations when choosing and matching the main component parameters. Motivated by this issue, a comprehensive multi-objectives optimization strategy based on Genetic Algorithm （GA） is developed for the PHEB with the typical powertrain. First, considering repeatability and regularity of bus route, the methods of off-line data processing and mathematical statistics are adopted, to obtain a representative driving cycle, which could well reflect the general characteristic of the real-world bus route. Then, the economical optimization objective is defined, which is consist of manufacturing costs of the key components and energy consumption, and combined with the dynamical optimization objective, a multi-objective op- timization function is put forward. Meanwhile, GA algorithm is used to optimize the parameters, for the optimal components combination of the novel series-parallel powertrain. Finally, a comparison with the prototype is carried out to verify the per- formance of the optimized powertrain along driving cycles. Simulation results indicate that the parameters of powertrain com- ponents obtained by the proposed comprehensive multi-objectives optimization strategy might get better fuel economy, meanwhile ensure the dynamic performance of PHEB. In contrast to the original, the costs declined by 18%. Hence, the strat- egy would provide a theoretical guidance on parameter selection for PHEB manufacturers.

Research on Parameter Optimization in Collaborative Filtering Algorithm

Collaborative filtering algorithm is the most widely used and recommended algorithm in major e-commerce recommendation systems nowadays. Concerning the problems such as poor adaptability and cold start of traditional collaborative filtering algorithms, this paper is going to come up with improvements and construct a hybrid collaborative filtering algorithm model which will possess excellent scalability. Meanwhile, this paper will also optimize the process based on the parameter selection of genetic algorithm and demonstrate its pseudocode reference so as to provide new ideas and methods for the study of parameter combination optimization in hybrid collaborative filtering algorithm.