A genetic scheduling methodology for virtual cellular manufacturing systems: an industrial application

Effective solutions to the cell formation and the production scheduling problems are vital in the design of virtual cellular manufacturing systems (VCMSs). This paper presents a new mathematical model and a scheduling algorithm based on the techniques of genetic algorithms for solving such problems. The objectives are: (1) to minimize the total materials and components travelling distance incurred in manufacturing the products, and (2) to minimize the sum of the tardiness of all products. The proposed algorithm differs from the canonical genetic algorithms in that the populations of candidate solutions consist of individuals of different age groups, and that each individual's birth and survival rates are governed by predefined aging patterns. The condition governing the birth and survival rates is developed to ensure a stable search process. In addition, Markov Chain analysis is used to investigate the convergence properties of the genetic search process theoretically. The results obtained indicate that if the individual representing the best candidate solution obtained is maintained throughout the search process, the genetic search process converges to the global optimal solution exponentially.

The proposed methodology is applied to design the manufacturing system of a company in China producing component parts for internal combustion engines. The performance of the proposed age-based genetic algorithm is compared with that of the conventional genetic algorithm based on this industrial case. The results show that the methodology proposed in this paper provides a simple, effective and efficient method for solving the manufacturing cell formation and production scheduling problems for VCMSs.     

A hybrid optimization model for proficient bidding strategies with no Karush–Kuhn–Tucker optimality conditions

The computational complexity behind the bi‐level optimization problem has led the researchers to adopt Karush–Kuhn–Tucker (KKT) optimality conditions. However, the problem function has more number of complex constraints to be satisfied. Classical optimization algorithms are impotent to handle the function. This paper presents a simplified minimization function, in which both the profit maximization problem and the ISO market clearance problem are considered, but with no KKT optimality conditions. Subsequently, this paper solves the minimization function using a hybrid optimization algorithm. The hybrid optimization algorithm is developed by combining the operations of group search optimizer (GSO) and genetic algorithm (GA). The hybridization enables the dispersion process of GSO to be a new mutated dispersion process for improving the convergence rate. We evaluate the methodology by experimenting on IEEE 14 and IEEE 30 bus systems. The obtained results are compared with the outcomes of bidding strategies that are based on GSO, PSO, and GA. The results demonstrate that the hybrid optimization algorithm solves the minimization function better than PSO, GA, and GSO. Hence, the profit maximization in the proposed methodology is relatively better than that of the conventional algorithms. Copyright © 2015 John Wiley & Sons, Ltd.     

Weight optimisation of a salient pole synchronous generator by a new genetic algorithm validated by finite element analysis

In this study, a new approach for genetic algorithm (GA) is proposed and compared with conventional GA (CGA) in the weight optimisation of a 2-MVA salient pole synchronous machine. The main differences between the two algorithms are that, in the newly proposed method, individuals are paired and crossed over based on the Mendelian rules of genetics, and the mutation operator is omitted. The rules concern the segregation of Alleles and the independent assortment of Alleles. This approach is comprehensive and conceptually accurate since its framework uses Mendelian population genetics. The operation CPU time is longer in the new approach when compared to the conventional one but can be ignored in electric machine design since it is not a real-time process. The results of the analytic solution and the new and CGA implementation methods are compared in terms of weight, efficiency and temperature. The results obtained are similar to those of the conventional ones and even better in some cases. A finite element analysis (FEA) is done to realise the machine designs optimised by the new GA (NGA) and CGA for the case of a fixed 24-pole design. Hence the improvement over CGA achieved by NGA has been validated through FEA.     

An introduction of dominant genes in genetic algorithm for FMS

This paper proposes a new idea, namely genetic algorithms with dominant genes (GADG) in order to deal with FMS scheduling problems with alternative production routing. In the traditional genetic algorithm (GA) approach, crossover and mutation rates should be pre-defined. However, different rates applied in different problems will directly influence the performance of genetic search. Determination of optimal rates in every run is time-consuming and not practical in reality due to the infinite number of possible combinations. In addition, this crossover rate governs the number of genes to be selected to undergo crossover, and this selection process is totally arbitrary. The selected genes may not represent the potential critical structure of the chromosome. To tackle this problem, GADG is proposed. This approach does not require a defined crossover rate, and the proposed similarity operator eliminates the determination of the mutation rate. This idea helps reduce the computational time remarkably and improve the performance of genetic search. The proposed GADG will identify and record the best genes and structure of each chromosome. A new crossover mechanism is designed to ensure the best genes and structures to undergo crossover. The performance of the proposed GADG is testified by comparing it with other existing methodologies, and the results show that it outperforms other approaches.     

Multiscale multiresolution genetic algorithm with a golden sectioned population composition

A new genetic algorithm (GA) strategy called the multiscale multiresolution GA is proposed for expediting solution convergence by orders of magnitude. The motivation for this development was to apply GAs to a certain class of large optimization problems, which are otherwise nearly impossible to solve. For the algorithm, standard binary design variables are binary wavelet transformed to multiscale design variables. By working with the multiscale variables, evolution can proceed in multiresolution; converged solutions at a low resolution are reused as a part of individuals of the initial population for the next resolution evolution. It is shown that the best solution convergence can be achieved if three initial population groups having different fitness levels are mixed at the golden section ratio. An analogy between cell division and the proposed multiscale multiresolution strategy is made. The specific applications of the developed method are made in topology optimization problems. Copyright © 2007 John Wiley & Sons, Ltd.     

A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems

This paper addresses a dynamic capacitated production planning (CPP) problem with consideration of outsourcing. Specifically, the outsourcing problem considered in this paper has the following features: (1) all demands are met by production or outsourcing without postponement or backlog, (2) production, inventory, and outsourcing levels all have a limit, and (3) the cost functions are considered arbitrarily and time-varying. These features come together, leading to a so-called general outsourcing CPP problem. In our previous work, an algorithm with pseudo-polynomial time complexity was developed, which includes a formation of a feasible solution region and then a search procedure using dynamic programming techniques. Due to the computational complexity with such an approach, only small and medium problems can be solved in a practical sense. In this paper, we present a genetic algorithm (GA) approach to the same problem. The novelty of this GA approach is that the idea of the feasible solution region is used as a heuristic to guide the searching process. We present a computational experiment to show the effectiveness of the proposed approach.     

钢铁企业副产煤气优化调度问题模型及算法

考虑钢铁企业副产煤气优化调度问题,在分析问题特征的基础上,建立了数学规划模型。针对模型特点,将遗传算法与混沌理论相结合进行模型求解,在初始种群中引入基于启发式规则生成的优良个体来提高收敛速度;通过建立个体精英库防止最优值的丢失;引入基于混沌序列的邻域搜索以提高算法的寻优效率。通过仿真实验验证了模型与算法的可行性和有效性。     

求解约束优化问题的退火遗传算法

针对基于罚函数遗传算法求解实际约束优化问题的困难与缺点,提出了求解约束优化问题的退火遗传算法。对种群中的个体定义了不可行度,并设计退火遗传选择操作。算法分三阶段进行,首先用退火算法搜索产生初始种群体,随后利用遗传算法使搜索逐渐收敛于可行的全局最优解或较优解,最后用退火优化算法对解进行局部优化。两个典型的仿真例子计算结果证明该算法能极大地提高计算稳定性和精度。     

A guided search genetic algorithm using mined rules for optimal affective product design

Affective design is an important aspect of new product development, especially for consumer products, to achieve a competitive edge in the marketplace. It can help companies to develop new products that can better satisfy the emotional needs of customers. However, product designers usually encounter difficulties in determining the optimal settings of the design attributes for affective design. In this article, a novel guided search genetic algorithm (GA) approach is proposed to determine the optimal design attribute settings for affective design. The optimization model formulated based on the proposed approach applied constraints and guided search operators, which were formulated based on mined rules, to guide the GA search and to achieve desirable solutions. A case study on the affective design of mobile phones was conducted to illustrate the proposed approach and validate its effectiveness. Validation tests were conducted, and the results show that the guided search GA approach outperforms the GA approach without the guided search strategy in terms of GA convergence and computational time. In addition, the guided search optimization model is capable of improving GA to generate good solutions for affective design.     

Optimizing the Hot Isostatic Pressing Process

A genetic algorithm (GA) is used to optimize the hot isostatic pressing (HIPing) process for beryllium powder. The GA evaluates a HIPing model with different processing schedules in an effort to minimize temperature, pressure, processing time, ramp rates, grain growth, and distance to target relative density. It is shown that this is a constrained, multiobjective, noisy, optimization problem to which the GA is able to evolve a large number of viable solutions. However, for the GA to work in such a large multidimensional search space, it is suggested that the constraints be treated as objectives and then penalize the Pareto ranking for each constraint violated. This approach is necessary because a large-dimensional objective space naturally results in most members being Pareto rank 1.     

The dynamics of a changing range genetic algorithm

The formalism is presented for modelling of a genetic algorithm (GA) with an adjustment of a search space size, which assumes that the environment and the population form a unique system; it establishes a dynamic balance and convergence towards an optimal solution. The paper describes the effect of an adjustment of a search space size of GA on the macroscopic statistical properties of population such as the average fitness and the variance fitness of population. The equations of motion were derived for the one‐max problem that expressed the macroscopic statistical properties of population after reproductive genetic operators and an adjustment of a search space size in terms of those prior to the operation. Predictions of the theory are compared with experiments and are shown to predict the average fitness and the variance fitness of the final population accurately. Copyright © 2009 John Wiley & Sons, Ltd.     

基于Lévy Flight的混合GA在柔性作业车间调度问题中的性能分析

近年来,柔性作业车间调度问题(FJSP)由于其NP难特性与在制造系统中的广泛应用被大量关注。为提高该类问题求解效率,本文在标准Lévy flight的基础上提出了一种新的离散Lévy flight搜索策略,并将该策略与遗传算法框架结合,形成一种离散Lévy flight策略的混合遗传算法。该混合算法通过使用离散Lévy flight搜索策略对每代精英种群进行变步长搜索,提高了算法的局部搜索能力,增强了种群多样性。本文通过将CS、GA和TLBO等经典算法作为对比算法,对不同规模的54个FJSP算例进行实验,证明了所提出的算法具备更好的收敛效果与稳定性,适合于求解大规模FJSP。     

基于批量划分的无等待流水车间订单接受问题研究

在无等待流水车间环境下,考虑订单分批量加工策略的订单接受问题,建立问题的数学模型。由于问题的NP难特性,提出改进的遗传算法对模型进行求解。改进的算法采用正向和反向NEH算法与随机方法产生初始种群,在算法更新过程中将禁忌搜索算法嵌入到遗传算法中来实现局部搜索,避免算法陷入局部最优。最后,算例表明批量划分策略能够有效减少订单的完成时间,实现订单总收益的最大化。通过算法对比,说明了改进遗传算法具有较好的求解效果。     

遗传算法在桁架结构优化设计中的应用

本文提出桁架结构系统优化设计的新方法—遗传算法。它与常规化算法的不同之处在于从多个初始点开始寻优，并采用交迭和变异算子避免过早地收敛到局部最优解，可获得全局最优解，且不受初始值影响。该算法不必求导计算，编程简单、快捷，尤其适用于具有离散变量的结构优化设计问题。     

A new hybrid real-coded genetic algorithm and its application to parameters identification of soils

Inverse analysis using an optimization method based on a genetic algorithm (GA) is a useful tool for obtaining soil parameters in geotechnical fields. However, the performance of the optimization in identifying soil parameters mainly depends on the search ability of the GA used. This study aims to develop a new efficient hybrid real-coded genetic algorithm (RCGA) being applied to identify parameters of soils. In this new RCGA, a new hybrid strategy is proposed by adopting two crossovers with outstanding ability, namely the Simulated Binary Crossover and the simplex crossover. In order to increase the convergence speed, a chaotic local search technique is used conditionally. The performance of the proposed RCGA is first validated by optimizing mathematical benchmark functions. The results demonstrate that the RCGA has an outstanding search ability and faster convergence speed compared to other hybrid RCGAs. The proposed new hybrid RCGA is then further evaluated by identifying soil parameters based on both laboratory tests and field tests, for different soil models. All the comparisons demonstrate that the proposed RCGA has an excellent performance of inverse analysis in identifying soil parameters, and is thus recommended for use based on all the evaluations carried out in this paper.     

遗传禁忌搜索算法在混流装配线排序中的应用

针对混流装配线排序问题，提出了一种混合遗传禁忌搜索算法，在每一代遗传演化之后，按一定比例随机选择部分解进行禁总搜索，以提高算法的全局搜索能力和收敛性。通过一个混流装配线排序实验，分别利用遗传算法和遗传禁忌搜索算法进行求解，结果表明遗传禁忌搜索算法具有更好的全局搜索能力和收敛性能。     

Genetic algorithm with adaptive and dynamic penalty functions for the selection of cleaner production measures: a constrained optimization problem

This paper presents a new approach of genetic algorithm (GA) to solve the constrained optimization problem. In a constrained optimization problem, feasible and infeasible regions occupy the search space. The infeasible regions consist of the solutions that violate the constraint. Oftentimes classical genetic operators generate infeasible or invalid chromosomes. This situation takes a turn for the worse when infeasible chromosomes alone occupy the whole population. To address this problem, dynamic and adaptive penalty functions are proposed for the GA search process. This is a novel strategy because it will attempt to transform the constrained problem into an unconstrained problem by penalizing the GA fitness function dynamically and adaptively. New equations describing these functions are presented and tested. The effects of the proposed functions developed have been investigated and tested using different GA parameters such as mutation and crossover. Comparisons of the performance of the proposed adaptive and dynamic penalty functions with traditional static penalty functions are presented. The result from the experiments show that the proposed functions developed are more accurate, efficient, robust and easy to implement. The algorithms developed in this research can be applied to evaluate environmental impacts from process operations.     

Darwinian approach for dynamic spectrum allocation in next generation systems

The authors present the use of a genetic algorithm (GA) model as a solution approach to the dynamic spectrum allocation (DSA) problem considered as a difficult combinatorial optimisation problem. The proposed multi-objective GA model enhances overall spectral efficiency of the network, while optimising its own spectrum utilisation to generate accessible spectrum opportunities for other radio technologies. A novel two-dimensional encoding technique is defined to represent solutions in the problem domain and the technique enables significantly shorter convergence times. A simulation tool has been developed to model the GA-based DSA and to compare the new scheme with the conventional fixed spectrum allocation (FSA) scheme under both uniform and non-uniform traffic distributions. The proposed scheme significantly outperformed the FSA scheme both in terms of spectral efficiency gain and spectral utilisation.     

基于混沌分组教与学优化算法锅炉NOx模型优化研究

为了平衡教与学优化算法的全局和局部搜索能力,提出一种混沌分组教与学优化算法。采用3种调整机制:应用混沌方法初始化种群个体;在教阶段成绩更新中引入自适应惯性权值;在学阶段,采用随机蛙跳算法思想,将班级中的学生分组,更新子种群的最差解。用10个经典的测试集函数测试改进算法的性能,并与人工蜂群算法、万有引力算法、原始的教学优化算法进行比较,结果显示:改进算法具有良好的全局和局部搜索能力,而且收敛精度高。此外,应用改进的教与学算法优化循环流化床锅炉氮氧化合物排放浓度的模型,仿真试验表明优化后的模型具有良好的辨识能力和泛化能力,能够指导工程,解决实际问题。     

MULTIOBJECTIVE DESIGN OF A MARINE VEHICLE WITH AID OF DESIGN KNOWLEDGE

To generate the Pareto optimal set efficiently in multiobjective optimization, a hybrid optimizer is developed by coupling the genetic algorithm and the direct search method. This method determines a candidate region around the global optimum point by using the genetic algorithm, then searches the global optimum point by the direct search method concentrating in this region, thus reducing calculation time and increasing search efficiency. Although the hybrid optimizer provides cost-effectiveness, the design optimization process involves a number of tasks which require human expertise and experience. Therefore, methods of optimization and associated programs have been used mostly by experts in the real design world. Hence, this hybrid optimizer incorporates a knowledge-based system with heuristic and analytic knowledge, thereby narrowing the feasible space of the objective function. Some domain knowledge is retrieved from database and design experts. The obtained knowledge is stored in the knowledge base. The results of this paper, through application to marine vehicle design with multiobjective optimization, show that the hybrid optimizer with aid of design knowledge can be a useful tool for multiobjective optimum design. © 1997 John Wiley & Sons, Ltd.