Improving the non-dominated sorting genetic algorithm using a gene-therapy method for multi-objective optimization

The non-dominate sorting genetic algorithmic-II (NSGA-II) is an effective algorithm for finding Pareto-optimal front for multi-objective optimization problems. To further enhance the advantage of the NSGA-II, this study proposes an evaluative-NSGA-II (E-NSGA-II) in which a novel gene-therapy method incorporates into the crossover operation to retain superior schema patterns in evolutionary population and enhance its solution capability. The merit of each select gene in a crossover chromosome is estimated by exchanging the therapeutic genes in both mating chromosomes and observing their fitness differentiation. Hence, the evaluative crossover operation can generate effective genomes based on the gene merit without explicitly analyzing the solution space. Experiments for nine unconstrained multi-objective benchmarks and four constrained problems show that E-NSGA-II can find Pareto-optimal solutions in all test cases with better convergence and diversity qualities than several existing algorithms.     

An improved Benders decomposition algorithm for the tree of hubs location problem

The tree of hubs location problem is a particularly hard variant of the so called hub location problems. When solving this problem by a Benders decomposition approach, it is necessary to deal with both optimality and feasibility cuts. While modern implementations of the Benders decomposition method rely on Pareto-optimal optimality cuts or on rendering feasibility cuts based on minimal infeasible subsystems, a new cut selection scheme is devised here under the guiding principle of extracting useful information even when facing infeasible subproblems. The proposed algorithm outperforms two other modern variants of the method and it is capable of optimally solving instances five times larger than the ones previously reported on the literature.     

Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm

Relative to job-shop scheduling problems that optimize makespan or flow time, due-date-related problems are usually much more computationally complex and are classified as strongly NP-hard. In this paper, a hybrid framework integrating a heuristic and a genetic algorithm (GA) is utilized for job-shop scheduling to minimize weighted tardiness. For each new generation of schedules, the GA determines the first operation of each machine, and the heuristic determines the assignment of the remaining operations. Schedules with inferior tardiness are discarded before the next round of evolution. Extensive numerical experiments were conducted for different levels of due-date tightness. The results show that the hybrid framework performs significantly better than does either a heuristic or GA alone. It is also found to be superior to a well-recognized heuristic improvement procedure (lead-time iterations). Specifically, the combination of the R&M heuristic and a GA outperforms a number of heuristics commonly used to minimize total tardiness and weighted total tardiness; this combination is, however, outperformed by the heuristic of Kreipl [Kreipl, S., 2000. A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling 3, 125–138]. We also develop a generalized hybrid framework that can adapt to different job-shop problems—with or without sequence-dependent setups and with different objectives (e.g., makespan, tardiness, flow time). The new framework allows the interaction of parallel evolutions, extending the GA-heuristic environment to the solving of multi-objective scheduling problems.     

Aerospace design optimization using a steady state real-coded genetic algorithm

This study demonstrates the advantages of using a real coded genetic algorithm (GA) for aerospace engineering design applications. The GA developed for this study runs steady state, meaning that after every function evaluation the worst performer is determined and that worst performer is then thrown out and replaced by a new member that has been evaluated. The new member is produced by mating two successful parents through a crossover routine, and then mutating that new member. For this study three different preliminary design studies were conducted using both a binary and a real coded GA including a single stage solid propellant missile systems design, a two stage solid propellant missile systems design and a single stage liquid propellant missile systems design.     

Optimization of arches using genetic algorithm

An optimization procedure is presented for the minimum weight and strain energy optimization for arch structures subjected to constraints on stress, displacement and weight responses. Both thickness and shape variables defining the natural line of the arch are considered. The computer program which is developed in this study can be used to optimize thick, thin and variable thickness curved beams/arches. An automated optimization procedure is adopted which integrates finite element analysis, parametric cubic spline geometry definition, automatic mesh generation and genetic algorithm methods. Several examples are presented to illustrate optimal arch structures with smooth shapes and thickness variations. The changes in the relative contributions of the bending, membrane and shear strain energies are monitored during the whole process of optimization.     

Single row facility layout problem using a permutation-based genetic algorithm

In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions.     

Benders decomposition for a class of variational inequalities

This paper examines Benders decomposition for a useful class of variational inequality (VI) problems that can model, e.g., economic equilibrium, games or traffic equilibrium. The dual of the given VI is defined. Benders decomposition of the original VI is derived by applying a Dantzig–Wolfe decomposition procedure to the dual of the given VI, and converting the dual forms of the Dantzig–Wolfe master and subproblems to their primal forms. The master problem VI includes a new cut at each iteration, with information from the latest subproblem VI, which is solved by fixing the “difficult” variables at values determined by the previous master problem. A scalar parameter called the convergence gap is calculated at each iteration; a negative value is equivalent to the algorithm making progress in that the last master problem solution is made infeasible by the new cut. Under mild conditions, the convergence gap approaches zero in the limit of many iterations. With a more restrictive condition that still admits many useful models, a zero value of the convergence gap implies that the master problem has found a solution of the VI. A small model of competitive equilibrium of three commodities in two regions serves as an illustration.     

Real-time stable self-learning FNN controller using genetic algorithm

A kind of real-time stable self-learning fuzzy neural network (FNN) control system is proposed in this paper. The control system is composed of two parts: (1) A FNN controller which use genetic algorithm (GA) to search optimal fuzzy rules and membership functions for the unknown controlled plant; (2) A supervisor which can guarantee the stability of the control system during the real-time learning stage, since the GA has some random property which may cause control system unstable. The approach proposed in this paper combine a priori knowledge of designer and the learning ability of FNN to achieve optimal fuzzy control for an unknown plant in real-time. The efficiency of the approach is verified by computer simulation.     

A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations

We develop a model for a strategic freight-forwarding network design problem in which the design decisions involve the locations and capacities of consolidation and deconsolidation centers, and capacities on linehaul linkages as well as the shipment routes from origins to destinations through centers. We devise a solution approach based on Benders decomposition and conduct a computational study that illustrates the efficiency and the effectiveness of the approach.     

Resolution method for mixed integer bi-level linear problems based on decomposition technique

In this article, we propose a new algorithm for the resolution of mixed integer bi-level linear problem (MIBLP). The algorithm is based on the decomposition of the initial problem into the restricted master problem (RMP) and a series of problems named slave problems (SP). The proposed approach is based on Benders decomposition method where in each iteration a set of variables are fixed which are controlled by the upper level optimization problem. The RMP is a relaxation of the MIBLP and the SP represents a restriction of the MIBLP. The RMP interacts in each iteration with the current SP by the addition of cuts produced using Lagrangian information from the current SP. The lower and upper bound provided from the RMP and SP are updated in each iteration. The algorithm converges when the difference between the upper and lower bound is within a small difference ε. In the case of MIBLP Karush–Kuhn–Tucker (KKT) optimality conditions could not be used directly to the inner problem in order to transform the bi-level problem into a single level problem. The proposed decomposition technique, however, allows the use of KKT conditions and transforms the MIBLP into two single level problems. The algorithm, which is a new method for the resolution of MIBLP, is illustrated through a modified numerical example from the literature. Additional examples from the literature are presented to highlight the algorithm convergence properties.     

Revised dantzig-wolfe decomposition for staircase-structured linear programs

Staircase structured linear programs arise naturally in the study of engineering economic systems. One general approach to solving such LP's is the technique of nested decomposition of the primal or dual problem. The research described in this paper proposes a revised decomposition algorithm that incorporates knowledge of the structure of the staircase basis in forming the decomposed linear programs. Column proposals from the revised subproblems are shown to achieve maximum penetration against the master problem basis. The proposed algorithm resorts to the regular Dantzig-Wolfe subproblem to test for optimality. The algorithm is shown to be finite and is compared to the Abrahamson-Wittrock algorithm. Computational results indicate substantial improvement over the Dantzig-Wolfe algorithm in most cases. A numerical example of the algorithm is provide in the appendix. This research was supported by National Science Foundation grant ECS-8106455 to Cornell University.     

The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method

In this paper, a strict formulation of a generalization of the classical pickup and delivery problem is presented. Here, we add the flexibility of providing the option for passengers to transfer from one vehicle to another at specific locations. As part of the mathematical formulation, we include transfer nodes where vehicles may interact interchanging passengers. Additional variables to keep track of customers along their route are considered. The formulation has been proven to work correctly, and by means of a simple example instance, we conclude that there exist some configurations in which a scheme allowing transfers results in better quality optimal solutions. Finally, a solution method based on Benders decomposition is addressed. We compare the computational effort of this application with a straight branch and bound strategy; we also provide insights to develop more efficient set partitioning formulations and associated algorithms for solving real-size problems.     

Benders decomposition for variational inequalities

The partitioning technique of J.F. Benders, which was generalized to nonlinear programming by Geoffrion, is further generalized to linearly constrained variational inequality problems. The conditions under which such a generalization is possible and appropriate are examined.An important area of application is the asymmetric traffic assignment problem for which the decomposition assumes a simple and effective form. A computational example demonstrates the algorithm.This research was supported in part by NFS grants ECE-8420830 and ECS-8516365.     

Urban rapid transit network design: accelerated Benders decomposition

This paper presents an urban rapid transit network design model, which consists of the location of train alignments and stations in an urban traffic context. The design attempts to maximize the public transportation demand using the new infrastructure, considering a limited budget and number of transit lines. The location problem also incorporates the fact that users can choose their transportation mode and trips. In real cases, this problem is complex to solve because it has thousands of binary variables and constraints, and cannot be solved efficiently by Branch and Bound. For this reason, some algorithms based on Benders decomposition have been defined in order to solve it. These algorithms have been compared in test networks. The project has been supported by the research project 70029/T05, from the Spanish “Ministerio de Fomento” and the research project TRA2005-09068-C03-01, from the Spanish “Ministerio de Educación y Ciencia”.     

A preliminary genetic decomposition for conceptual understanding of the indefinite integral

This paper reports on the use of APOS theory to investigate conceptual understanding of the indefinite integral amongst undergraduate students at the University of KwaZulu-Natal, South Africa. We present a Preliminary Genetic Decomposition (PGD) for the indefinite integral, which predicts the mental constructions and mechanisms that may facilitate conceptual understanding. In this pilot study, the analysis of students’ written responses to the research instrument suggested that more than half of the participants lacked the prerequisite knowledge of the concepts of function, derivative of functions and the chain rule. The findings confirmed that students experience greater difficulty dealing with transcendental functions than with algebraic functions. The analysis indicated that the cognitive mechanism of reversal, to recognise the inverse nature of differentiation and integration, was inconsistent or absent in many students. Interview data from a subset of participants was employed for triangulation with the document analysis. The empirical data suggested refinement of the PGD and modification of the research instrument, and further fine-grained interviews with study participants to investigate their conceptual understanding more deeply, and for the purposes of data triangulation.     

Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming

A classical method for solving the variational inequality problem is the projection algorithm. We show that existing convergence results for this algorithm follow from one given by Gabay for a splitting algorithm for finding a zero of the sum of two maximal monotone operators. Moreover, we extend the projection algorithm to solveany monotone affine variational inequality problem. When applied to linear complementarity problems, we obtain a matrix splitting algorithm that is simple and, for linear/quadratic programs, massively parallelizable. Unlike existing matrix splitting algorithms, this algorithm converges under no additional assumption on the problem. When applied to generalized linear/quadratic programs, we obtain a decomposition method that, unlike existing decomposition methods, can simultaneously dualize the linear constraints and diagonalize the cost function. This method gives rise to highly parallelizable algorithms for solving a problem of deterministic control in discrete time and for computing the orthogonal projection onto the intersection of convex sets.This research is partially supported by the U.S. Army Research Office, contract DAAL03-86-K-0171 (Center for Intelligent Control Systems), and by the National Science Foundation under grant NSF-ECS-8519058.Thanks are due to Professor J.-S. Pang for his helpful comments.     

A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem

In this paper, we study the application of a meta-heuristic to a two-machine flowshop scheduling problem. The meta-heuristic uses a branch-and-bound procedure to generate some information, which in turn is used to guide a genetic algorithm's search for optimal and near-optimal solutions. The criteria considered are makespan and average job flowtime. The problem has applications in flowshop environments where management is interested in reducing turn-around and job idle times simultaneously. We develop the combined branch-and-bound and genetic algorithm based procedure and two modified versions of it. Their performance is compared with that of three algorithms: pure branch-and-bound, pure genetic algorithm, and a heuristic. The results indicate that the combined approach and its modified versions are better than either of the pure strategies as well as the heuristic algorithm.     

Affinity genetic algorithm

Based on some phenomena from human society and nature, we propose a binary affinity genetic algorithm (aGA) by adopting the following strategies: the population is adaptively updated to avoid stagnation; the newly generated individuals will be ensured to survive for some generations in order for them to have time to show their good genes; new individuals and the old ones are balanced to have the advantages of both. In order to quantitatively analyze the selective pressure, the concept of selection degree and a simple linear control equation are introduced. We can maintain the diversity of the evolutionary population by controlling the value of the selection degree. Performance of aGA is further enhanced by incorporating local search strategies. Partially supported by a National Key Basic Research Project of China and by a USA NSF grant CCR-0201253.     

Solving an inverse heat conduction problem using genetic algorithm: Sequential and multi-core parallelization approach

In this paper a numerical approach combining the least squares method and the genetic algorithm (sequential and multi-core parallelization approach) is proposed for the determination of temperature in an inverse heat conduction problem (IHCP). Some numerical experiments confirm the utility of this algorithm as the results are in good agreement with the exact data. Results show that an excellent estimation can be obtained by implementation sequential genetic algorithm within a CPU with clock speed 2.7 GHz, and parallel genetic algorithm within a 16-core CPU with clock speed 2.7 GHz for each core.     

Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm

Producing clear and intelligible layouts of hierarchical digraphs knows a renewed interest in information visualization. Recent experimental results show that metaheuristics are well-adapted methods for this problem. In this paper, we develop a new Hybridized Genetic Algorithm for arc crossing minimization. It follows the basic scheme of a GA with two major differences: problem-based crossovers adapted from ordering GAs are combined with a local search strategy based on averaging heuristics. Computational testing was performed on a set of 180 random hierarchical digraphs of standard sizes with various structures. Results show that the Hybridized Genetic Algorithm significantly outperforms Tabu Search—which is one of the best known methods for this problem- and also a multi-start descent except for highly connected graphs.