Genetic algorithms to solve the cover printing problem

Inspired by successful application of evolutionary algorithms to solving difficult optimization problems, we explore in this paper, the applicability of genetic algorithms (GAs) to the cover printing problem, which consists in the grouping of book covers on offset plates in order to minimize the total production cost. We combine GAs with a linear programming solver and we propose some innovative features such as the “unfixed two-point crossover operator” and the “binary stochastic sampling with replacement” for selection. Two approaches are proposed: an adapted genetic algorithm and a multiobjective genetic algorithm using the Pareto fitness genetic algorithm. The resulting solutions are compared. Some computational experiments have also been done to analyze the effects of different genetic operators on both algorithms.     

Using genetic algorithms to solve quality-related bin packing problem

The Bin Packing Problem is an industrial problem which involves grouping items into appropriate bin to minimize the cost and number of used bins. It provides a solution for assigning parts to optimize some predefined measures of productivity. In this study, Ion Plating (IP) industry requires similar approach on allocating production jobs into batches for producing better quality products and enabling to meet customer deadlines. The aim of this paper is to (i) develop a Bin Packing Genetic Algorithms (BPGA) with different weighting combinations, taking into account the quality of product and service; (ii) improve the production efficiency by reducing the production unit cost in IP. Genetic Algorithm was chosen because it is one of the best heuristics algorithms on solving optimization problems. In the case studies, industrial data of a precious metal finishing company was used to simulate the proposed BPGA model, and the computational results were compared with these industrial data. The results from three different weighting combinations demonstrated that fewer resources would be required by applying the proposed model in solving BP problem in the Ion Plating Cell.     

Concurrent assembly planning with genetic algorithms

This work investigates the application of genetic algorithm (GA)-based search techniques to concurrent assembly planning, where product design and assembly process planning are performed in parallel, and the evaluation of a design configuration is influenced by the performance of its related assembly process. Several types of GAs and an exhaustive combinatorial approach are compared, in terms of reliability and speed in locating the global optimum. The different algorithms are tested first on a set of artificially generated assembly planning problems, which are intended to represent a broad spectrum of combinatorial complexity; then an industrial case study is presented. Test problems indicate that GAs are slightly less reliable than the combinatorial approach in finding the global, but are capable of identifying solutions which are very close to the global optimum with consistency, soon outperforming the combinatorial approach in terms of execution times, as the problem complexity grows. For an industrial case study of low combinatorial complexity, such as the one chosen in this work, GAs and combinatorial approach perform almost equivalently, both in terms of reliability and speed. In summary, GAs seem a suitable choice for those planning applications where response time is an important factor, and results which are close enough to the global optimum are still considered acceptable such as in concurrent assembly planning, where response time is a key factor when assessing the validity of a product design configuration in terms of the performance of its assembly plan.     

Genetic algorithms for task scheduling problem

The scheduling and mapping of the precedence-constrained task graph to processors is considered to be the most crucial NP-complete problem in parallel and distributed computing systems. Several genetic algorithms have been developed to solve this problem. A common feature in most of them has been the use of chromosomal representation for a schedule. However, these algorithms are monolithic, as they attempt to scan the entire solution space without considering how to reduce the complexity of the optimization process. In this paper, two genetic algorithms have been developed and implemented. Our developed algorithms are genetic algorithms with some heuristic principles that have been added to improve the performance. According to the first developed genetic algorithm, two fitness functions have been applied one after the other. The first fitness function is concerned with minimizing the total execution time (schedule length), and the second one is concerned with the load balance satisfaction. The second developed genetic algorithm is based on a task duplication technique to overcome the communication overhead. Our proposed algorithms have been implemented and evaluated using benchmarks. According to the evolved results, it has been found that our algorithms always outperform the traditional algorithms.     

Design and comparison of adaptive power system stabilizers based on neural fuzzy networks and genetic algorithms

This paper presents two different power system stabilizers (PSSs) which are designed making use of neural fuzzy network and genetic algorithms (GAs). In both cases, GAs tune a conventional PSS on different operating conditions and then, the relationship between these points and the PSS parameters is learned by the ANFIS. ANFIS will select the PSS parameters based on machine loading conditions. The first stabilizer is adjusted minimizing an objective function based on ITAE index, while second stabilizer is adjusted minimizing an objective function based on pole-placement technique. The proposed stabilizers have been tested by performing simulations of the overall nonlinear system. Preliminary experimental results are shown.     

Genetic algorithms in integrated process planning and scheduling

Process planning and scheduling are actually interrelated and should be solved simultaneously. Most integrated process planning and scheduling methods only consider the time aspects of the alternative machines when constructing schedules. The initial part of this paper describes a genetic algorithm (GA) based algorithm that only considers the time aspect of the alternative machines. The scope of consideration is then further extended to include the processing capabilities of alternative machines, with different tolerance limits and processing costs. In the proposed method based on GAs, the processing capabilities of the machines, including processing costs as well as number of rejects produced in alternative machine are considered simultaneously with the scheduling of jobs. The formulation is based on multi-objective weighted-sums optimization, which are to minimize makespan, to minimize total rejects produced and to minimize the total cost of production. A comparison is done w ith the traditional sequential method and the multi-objective genetic algorithm (MOGA) approach, based on the Pareto optimal concept.     

Community detection in national-scale high voltage transmission networks using genetic algorithms

The large-scale interconnection of electricity networks has been one of the most important investments made by electric companies, and this trend is expected to continue in the future. One of the research topics in this field is the application of graph-based analysis to identify the characteristics of power grids. In particular, the application of community detection techniques allows for the identification of network elements that share valuable properties by partitioning a network into some loosely coupled sub-networks (communities) of similar scale, such that nodes within a community are densely linked, while connections between different communities are sparser. This paper proposes the use of competitive genetic algorithms to rapidly detect any number of community structures in complex grid networks. Results obtained in several national- scale high voltage transmission networks, including Italy, Germany, France, the Iberian peninsula (Spain and Portugal), Texas (US), and the IEEE 118 bus test case that represents a portion of the American Electric Power System (in the Midwestern US), show the good performance of genetic algorithms to detect communities in power grids. In addition to the topological analysis of power grids, the implications of these results from an engineering point of view are discussed, as well as how they could be used to analyze the vulnerability risk of power grids to avoid large-scale cascade failures.     

Transmission planning for Indian power grid: a mixed integer programming approach

The paper presents a modeling framework to analyze some important issues associated with operation planning of a power system. Major activities involved in operations planning of large integrated power systems are considered simultaneously to ensure optimal utilization of generation and transmission capacity. The model also examines optimal transmission expansion plans vis-à-vis fuel supply issues. A mixed integer programming model is developed for this purpose and the Indian power system considered. Specific emphasis is on spatial transmission expansion plan for the existing Indian inter-state transmission grid and new transmission links, coordinated operation of the isolated regional grids and system benefits accruing from transmission expansion, enhanced fuel production and supply rescheduling to ensure efficient operation of various generating stations.     

Genetic production systems for intelligent problem solving

The paper discusses an evolutionary knowledge approach to intelligent problem solving. A rule-based production system is used to model the problem and the means by which the problem space should be searched. Search heuristics are modelled as production rules. These rules are redundant as there may be more than one view on the best method for building solutions. Some rules may have complex reasoning for their actions, others have none. Deciding which rule is most appropriate is solved by a genetic algorithm and ultimately only the fitter rules will survive. The approach eliminates the necessity of designing problem specific search or variation operators, leaving the genetic algorithm to process patterns independent of the problem at hand. Learning methods and how they aid evolution is also discussed: they are Lamarckian learning and the Baldwin effect. The approach is tested on a scheduling problem.     

Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach

In general, distributed scheduling problem focuses on simultaneously solving two issues: (i) allocation of jobs to suitable factories and (ii) determination of the corresponding production scheduling in each factory. The objective of this approach is to maximize the system efficiency by finding an optimal planning for a better collaboration among various processes. This makes distributed scheduling problems more complicated than classical production scheduling ones. With the addition of alternative production routing, the problems are even more complicated. Conventionally, machines are usually assumed to be available without interruption during the production scheduling. Maintenance is not considered. However, every machine requires maintenance, and the maintenance policy directly affects the machine's availability. Consequently, it influences the production scheduling. In this connection, maintenance should be considered in distributed scheduling. The objective of this paper is to propose a genetic algorithm with dominant genes (GADG) approach to deal with distributed flexible manufacturing system (FMS) scheduling problems subject to machine maintenance constraint. The optimization performance of the proposed GADG will be compared with other existing approaches, such as simple genetic algorithms to demonstrate its reliability. The significance and benefits of considering maintenance in distributed scheduling will also be demonstrated by simulation runs on a sample problem.     

Genetic algorithms (GAs) to evolve multiple-agent cooperative systems

In this paper, a microrobot soccer-playing game, such as that of MIROSOT (Microrobot World Cup Soccer Tournament), is adopted as a standard test bed for research on multiple-agent cooperative systems. It is considerably complex and requires expertise in several difficult research topics, such as mobile microrobot design, motor control, sensor technology, intelligent strategy planning, etc., to build up a complete system to play the game. In addition, because it is an antagonistic game, it appears ideal to test whether one method is better than other. To date there have been two different kinds of architecture for building such system. One is called vision-based or centralized architecture, and the other is known as robot-based or decentralized architecture. The main difference between them lies in whether there exists a host computer system which responds to data processing and strategy planning, and a global vision system which can view the whole playground and transfer the environment information to the host computer in real time. We believe that the decentralized approach is more advanced, but in the preliminary step of our study, we used the centralized approach because it can lighten any overload of the microrobot design. In this paper, a simplified layer model of the multiple-agent cooperative system is first proposed. Based on such a model, a system for a microrobot soccer-playing game is organized. At the same time a simple genetic algorithm (SGA) is used for the autonomous evolution of cooperative behavior among microrobots. Finally, a computer simulation system is introduced and some simulated results are explained. This work was presented, in part, at the Third International Symposium on Artificial Life and Robotics, Oita, Japan, January 19–21, 1998.     

基于改进遗传算法的电力系统无功优化的研究

电力系统无功优化问题是一个多变量、多约束的混合非线性规划问题,其操作变量既有连续变量又有离散变量,其优化过程比较复杂。遗传算法是模拟生物在自然环境中的遗传和进化过程而形成的一种自适应的全局优化搜索算法,可用于解决含有离散变量的复杂优化问题。本文选用遗传算法求解电力系统无功优化问题,并对基本遗传算法的编码、初始种群、适应度函数和交叉、变异策略等进行改进,使用本文提出的改进算法对IEEE1 4节点进行无功优化计算,结果证明本文模型和算法的实用性、可靠性和优越性。     

Genetic algorithms for match-up rescheduling of the flexible manufacturing systems

Scheduling plays a vital role in ensuring the effectiveness of the production control of a flexible manufacturing system (FMS). The scheduling problem in FMS is considered to be dynamic in its nature as new orders may arrive every day. The new orders need to be integrated with the existing production schedule immediately without disturbing the performance and the stability of existing schedule. Most FMS scheduling methods reported in the literature address the static FMS scheduling problems. In this paper, rescheduling methods based on genetic algorithms are described to address arrivals of new orders. This study proposes genetic algorithms for match-up rescheduling with non-reshuffle and reshuffle strategies which accommodate new orders by manipulating the available idle times on machines and by resequencing operations, respectively. The basic idea of the match-up approach is to modify only a part of the initial schedule and to develop genetic algorithms (GAs) to generate a solution within the rescheduling horizon in such a way that both the stability and performance of the shop floor are kept. The proposed non-reshuffle and reshuffle strategies have been evaluated and the results have been compared with the total-rescheduling method.     

用混合遗传算法求解虚拟企业生产计划

针对虚拟企业生产计划的特点,以各成员企业承担的生产任务为对象,以快速响应市场为目标,建立了生产任务计划的数学模型,并基于该模型,提出一种基于遗传算法与模拟退火算法混合的求解算法,充分发挥了遗传算法良好的全局搜索能力和模拟退火算法有效避免陷入局部极小的优点．从而提高了算法的全局寻优能力．数值仿真计算表明了该算法的良好收敛性和有效性．     

Soft-computing combining of distributed power control algorithms

In traditional distributed power control (DPC) algorithms, every user in the system is treated in the same way, i.e., the same power control algorithm is applied to every user in the system. In this paper, we divide the users into different groups depending on their channel conditions and use different DPC accordingly. Our motivation comes from the fact that different DPC algorithms have its own advantages and drawbacks, and our aim in this paper is to “combine” the advantages of different DPC algorithms, and we use soft computing techniques for that. In the simulations results, we choose Foschini and Miljanic Algorithm in [3], which has relatively fast convergence but is not robust against time-varying link gain changes and CIR estimation errors, and fixed step algorithm of Kim [3], which is robust but its convergence is slow. By “combining” these two algorithms using soft computing techniques, the resulting algorithm has fast convergence and is robust. Acknowledgments This work was supported in part by GETA (Finnish Academy Graduate School on Electronics, Telecommunications and Automation), Finland.     

Iterative improvement to solve the parcel hub scheduling problem

This paper presents iterative improvement algorithms to solve the parcel hub scheduling problem (PHSP). The PHSP is combinatorial optimization problem that consists of scheduling a set of inbound trailers to a small number of unload docks. At the unload docks, the inbound trailers must be unloaded and the parcel sorted and loaded onto outbound trailers. Because the transfer operation is labor intensive, the transfer of parcels must be done in such a way as to minimize the timespan of the transfer operation. Local search (LS) and simulated annealing (SA) algorithms are developed and evaluated to solve the problem. The performances of the algorithms are compared to the performance of an existing genetic algorithm (GA). The computational results show that the LS and SA algorithms offer solutions that are superior to those offered by the GA.     

A knapsack problem as a tool to solve the production planning problem in small foundries

According to recent research carried out in the foundry sector, one of the most important concerns of the industries is to improve their production planning. A foundry production plan involves two dependent stages: (1) determining the alloys to be merged and (2) determining the lots that will be produced. The purpose of this study is to draw up plans of minimum production cost for the lot-sizing problem for small foundries. As suggested in the literature, the proposed heuristic addresses the problem stages in a hierarchical way. Firstly, the alloys are determined and, subsequently, the items that are produced from them. In this study, a knapsack problem as a tool to determine the items to be produced from furnace loading was proposed. Moreover, we proposed a genetic algorithm to explore some possible sets of alloys and to determine the production planning for a small foundry. Our method attempts to overcome the difficulties in finding good production planning presented by the method proposed in the literature. The computational experiments show that the proposed methods presented better results than the literature. Furthermore, the proposed methods do not need commercial software, which is favorable for small foundries.     

Machining process sequencing with fuzzy expert system and genetic algorithms

Traditional process planning systems are usually established in a deterministic framework that can only deal with precise information. However, in a practical manufacturing environment, decision making frequently involves uncertain and imprecise information. This paper describes a fuzzy approach for solving the process selection and sequencing problem under uncertainty. The proposed approach comprises a two-stage process for machining process selection and sequencing. The two stages are called intra-feature planning and inter-feature planning, respectively. According to the feature precedence relationship of a machined part, the intra-feature planning module generates a local optimal operation sequence for each feature element. This is based on a fuzzy expert system incorporated with genetic algorithms for machining cost optimization according to the cost-tolerance relationship. Manufacturing resources such as machines, tools, and fixtures are allocated to each selected operation to form an Operation-Machine-Tool (OMT) unit in the manufacturing resources allocation module. Finally, inter-feature planning generates a global OMT sequence. A genetic algorithm with fuzzy numbers and fuzzy arithmetic is developed to solve this global sequencing problem.     

A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem

This study applies a genetic algorithm embedded with mathematical programming techniques to solve a synchronized and integrated two-level lot sizing and scheduling problem motivated by a real-world problem that arises in soft drink production. The problem considers a production process compounded by raw material preparation/storage and soft drink bottling. The lot sizing and scheduling decisions should be made simultaneously for raw material preparation/storage in tanks and soft drink bottling in several production lines minimizing inventory, shortage and setup costs. The literature provides mixed-integer programming models for this problem, as well as solution methods based on evolutionary algorithms and relax-and-fix approaches. The method applied by this paper uses a new approach which combines a genetic algorithm (GA) with mathematical programming techniques. The GA deals with sequencing decisions for production lots, so that an exact method can solve a simplified linear programming model, responsible for lot sizing decisions. The computational results show that this evolutionary/mathematical programming approach outperforms the literature methods in terms of production costs and run times when applied to a set of real-world problem instances provided by a soft drink company.     

Genetic algorithms for delays evaluation in networked automation systems

In this paper, we present an approach to evaluate end-to-end delays in packets switching networked automation systems. Since Client-Server paradigm is considered for communication between the field devices, the existing methods of network delays evaluation are hardly applicable to assess realistic upper bounds of these delays. In an effort to enhance these delays evaluation, we propose an alternative method. Two algorithms, usually used for optimization problems, exhaustive and genetic algorithms, are then developed to achieve this purpose. While a formal proof about the capacity of the former one to ensure the worst delay overestimation is given, the latter proves to provide faster and more accurate results at the same time. This is shown on a practical case study while comparing the results of the two methods.