This paper proposes an intelligent model-based optimization methodology for optimizing the production cost and material removal rate subjected to surface quality constraint in turning operation of hardened AISI D2. Unlike traditional approaches, this paper deals with finding optimum cutting parameters considering the real condition of the cutting tool. Tool flank wear is predicted by the model obtained using genetic programming. On the basis of the predicted flank wear value, the surface roughness of work piece is estimated by neural networks. Applying the particle swarm optimization algorithm, the optimum machining parameters are determined. The simulation and experimental results show that machining with proposed intelligent optimization methodology has higher efficiency than conventional techniques with constant optimized cutting parameters.

Discovering knowledge from data is a quantum jump from quantity to quality, which is the characteristic and the spirit of the development of science. Symbolic regression (SR) is playing a greater role in the discovery of knowledge from data, specifically in this era of exponential data growth, because SRs are able to discover mathematical formulas from data. These formulas may provide scientifically meaningful models, especially when combined with domain knowledge. This article provides an overview of SR applications in the field of materials science and engineering. Integrating domain knowledge with SR is the key and a crucial approach, which allows gaining knowledge from data quickly, accurately, and scientifically. In the data-driven paradigm, SR allows for uncovering the underlying mechanisms of materials behavior, properties, and functions, in a wide range of areas from basic academic research to industrial applications, including experiments and computations, by providing explicit interpretable models from data, in comparison with other machine-learning “black-box” models. SR will be a powerful tool for rational and automatic materials development.

The two critical issues related to product design exploration are addressed: the balance between stylistic consistency and innovation, and the control of design process under a great diversity of requirements. To address these two issues, the view of understanding product design exploration is first sought. In this view, the exploration of designs is not only categorized as a problem-solving activity but also as a problem-finding activity. A computational framework is developed based on this view, and it encompasses the belief that these two activities go hand in hand to accomplish the design tasks in an interactive design environment. The framework adopts an integration approach of two key computational techniques, shape grammars and evolutionary computing, for addressing the above two critical issues. For the issues of stylistic consistency, this paper focuses on the computational techniques in balancing the conflicts of stylistic consistency and innovation with shape grammars. For the issues of controlling design process, the practical concerns of monitoring the design process through various activities starting from the preparation works to the implementation of shape grammars have been emphasized in the development of this framework. To evaluate the effectiveness of the framework, the experiments have been set up to reflect the practical situations with which the designers have to deal. The system generates a number of models from scratch with numerical analysis that can be evaluated effectively by the designers. This reduces the designers' time and allows the designers to concentrate their efforts on performing higher level of design activities such as evaluation of designs and making design decisions.

We present a case study showing a human-competitive design of an evolved antenna that was deployed on a NASA spacecraft in 2006. We were fortunate to develop our antennas in parallel with another group using traditional design methodologies. This allowed us to demonstrate that our techniques were human-competitive because our automatically designed antenna could be directly compared to a human-designed antenna. The antennas described below were evolved to meet a challenging set of mission requirements, most notably the combination of wide beamwidth for a circularly polarized wave and wide bandwidth. Two evolutionary algorithms were used in the development process: one used a genetic algorithm style representation that did not allow branching in the antenna arms; the second used a genetic programming style tree-structured representation that allowed branching in the antenna arms. The highest performance antennas from both algorithms were fabricated and tested, and both yielded very similar performance. Both antennas were comparable in performance to a hand-designed antenna produced by the antenna contractor for the mission, and so we consider them examples of human-competitive performance by evolutionary algorithms. Our design was approved for flight, and three copies of it were successfully flown on NASA's Space Technology 5 mission between March 22 and June 30, 2006. These evolved antennas represent the first evolved hardware in space and the first evolved antennas to be deployed.

We demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We outline a developmental genetic programming scheme for such applications; in this scheme the evolved programs, when executed, build quantum circuits and the resulting quantum circuits are then tested for “fitness” using a quantum computer simulator. Using the PushGP genetic programming system and the QGAME quantum computer simulator we demonstrate the invention of a new, better than classical quantum circuit for the two-oracle AND/OR problem.

Genetic programming is a systematic method for getting computers to automatically solve problems. Genetic programming uses the Darwinian principle of natural selection and analogs of recombination (crossover), mutation, gene duplication, gene deletion, and certain mechanisms of developmental biology to progressively breed, over a series of many generations, an improved population of candidate solutions to a problem. This paper makes the points that genetic programming now routinely delivers human-competitive machine intelligence for problems of automated design and can serve as an automated invention machine.

This paper discusses the application of genetic programming to the synthesis of compound two-dimensional kinematic mechanisms, and benchmarks the results against one of the classical kinematic challenges of 19th century mechanical design. Considerations for selecting a representation for mechanism design are presented, and a number of human-competitive inventions are shown.

Conceptual innovation in mechanical engineering design has been extremely challenging compared to the wide applications of automated design systems in digital circuits. This paper presents an automated methodology for open-ended synthesis of mechanical vibration absorbers based on genetic programming and bond graphs. It is shown that our automated design system can automatically evolve passive vibration absorbers that have performance equal to or better than the standard passive vibration absorbers invented in 1911. A variety of other vibration absorbers with competitive performance are also evolved automatically using a desktop PC in less than 10 h.

To support the concurrent design processes of mechatronic subsystems, unified mechatronics modeling and cooperative body–brain coevolutionary synthesis are developed. In this paper, both body-passive physical systems and brain-active control systems can be represented using the bond graph paradigm. Bond graphs are combined with genetic programming to evolve low-level building blocks into systems with high-level functionalities including both topological configurations and parameter settings. Design spaces of coadapted mechatronic subsystems are automatically explored in parallel for overall design optimality. A quarter-car suspension system case study is provided. Compared with conventional design methods, semiactive suspension designs with more creativity and flexibility are achieved through this approach.

This paper describes how genetic programming has been used as an invention machine to automatically synthesize complete designs for four optical lens systems that duplicated the functionality of previously patented lens systems. The automatic synthesis of the complete design is done ab initio, that is, without starting from a preexisting good design and without prespecifying the number of lenses, the topological arrangement of the lenses, or the numerical or nonnumerical parameters associated with any lens. One of the genetically evolved lens systems infringed a previously issued patent, whereas the others were noninfringing novel designs that duplicated (or improved upon) the performance specifications contained in the patents. One of the patents was issued in the 21st century. The designs were created in a substantially similar and routine way, suggesting that the approach described in the paper can be readily applied to other similar problems in the field of optical design. The genetically evolved designs are instances of human-competitive results produced by genetic programming in the field of optical design.

Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have been developed so far. Designing such algorithms is complicated by the rather nonintuitive character of quantum physics. In this paper we present a genetic programming system that uses some new techniques to develop and improve quantum algorithms. We have used this system to develop two formerly unknown quantum algorithms. We also address a potential deficiency of the quantum decision tree model used to prove lower bounds on the query complexity of the parity problem.

Previous applications of genetic programming (GP) have been restricted to searching for algebraic approximations mapping the design parameters (e.g., geometrical parameters) to a single design objective (e.g., weight). In addition, these algebraic expressions tend to be highly complex. By adding a simple extension to the GP technique, a powerful design data analysis tool is developed. This paper significantly extends the analysis capabilities of GP by searching for multiple simple models within a single population by splitting the population into multiple islands according to the design variables used by individual members. Where members from different islands “cooperate,” simple design models can be extracted from this cooperation. This relatively simple extension to GP is shown to have powerful implications to extracting design models that can be readily interpreted and exploited by human designers. The full analysis method, GP heuristics extraction method, is described and illustrated by means of a design case study.

Some designs are sufficiently creative that they are considered to be inventions. The invention process is typically characterized by a singular moment when the prevailing thinking concerning a long-standing problem is, in a “flash of genius,” overthrown and replaced by a new approach that could not have been logically deduced from what was previously known. This paper discusses such logical discontinuities using an example based on the history of one of the most important inventions of the 20th century in electrical engineering, namely, the invention of negative feedback by AT&T's Harold S. Black. This 1927 invention overthrew the then prevailing idiom of positive feedback championed by Westinghouse's Edwin Howard Armstrong. The paper then shows how this historically important discovery can be readily replicated by an automated design and invention technique patterned after the evolutionary process in nature, namely, genetic programming. Genetic programming employs Darwinian natural selection along with analogs of recombination (crossover), mutation, gene duplication, gene deletion, and mechanisms of developmental biology to breed an ever improving population of structures. Genetic programming rediscovers negative feedback by conducting an evolutionary search for a structure that satisfies Black's stated high-level goal (i.e., reduction of distortion in amplifiers). Like evolution in nature, genetic programming conducts its search probabilistically without resort to logic using a process that is replete with logical discontinuities. The paper then shows that genetic programming can routinely produce many additional inventive and creative results. In this regard, the paper discusses the automated rediscovery of numerous 20th-century patented inventions involving analog electrical circuits and controllers, the Sallen–Key filter, and six 21st-century patented inventions. In addition, two patentable new inventions (controllers) have been created in the same automated way by means of genetic programming. The paper discusses the promising future of automated invention by means of genetic programming in light of the fact that, to date, increased computer power has yielded progressively more substantial results, including numerous human-competitive results, in synchrony with Moore's law. The paper argues that evolutionary search by means of genetic programming is a promising approach for achieving creative, human-competitive, automated design because illogic and creativity are inherent in the evolutionary process.

This paper deals with the problem of the dynamic stress optimisation for manipulator robots. The maximum dynamic stress search is a challenging problem, insofar the dynamic stresses change in a very complex manner and they are strongly influenced by the payload, internal parameters of the robot, and instantaneous values of the articular variables (positions, velocities, and accelerations). This problem is solved using a hybrid simplex-genetic algorithm. This algorithm allows solving the dilemma of exploration vs. exploitation in the search space. A simulation study shows the greater performance of the proposed approach as compared to a classical approach of the configuration space inverse sweeping.

Four bar mechanisms are basic components of many important mechanical devices. The kinematic synthesis of four bar mechanisms is a difficult design problem. A novel method that combines the genetic programming and decision tree learning methods is presented. We give a structural description for the class of mechanisms that produce desired coupler curves. Constructive induction is used to find and characterize feasible regions of the design space. Decision trees constitute the learning engine, and the new features are created by genetic programming.

Probabilistic and stochastic algorithms have been used to solve many hard optimization problems since they can provide solutions to problems where often standard algorithms have failed. These algorithms basically search through a space of potential solutions using randomness as a major factor to make decisions. In this research, the knapsack problem (optimization problem) is solved using a genetic algorithm approach. Subsequently, comparisons are made with a greedy method and a heuristic algorithm. The knapsack problem is recognized to be NP-hard. Genetic algorithms are among search procedures based on natural selection and natural genetics. They randomly create an initial population of individuals. Then, they use genetic operators to yield new offspring. In this research, a genetic algorithm is used to solve the 0/1 knapsack problem. Special consideration is given to the penalty function where constant and self-adaptive penalty functions are adopted.