Showing 1 - 10 of 32
This paper generalizes the automated innovization framework using genetic programming in the context of higher-level innovization. Automated innovization is an unsupervised machine learning technique that can automatically extract significant mathematical relationships from Pareto-optimal...
Persistent link: https://www.econbiz.de/10011209316
Evolutionary Algorithms (EAs) are emerging as competitive and reliable techniques for several optimization tasks. Juxtapositioning their higher-level and implicit correspondence; it is provocative to query if one optimization algorithm can benefit from another by studying underlying similarities...
Persistent link: https://www.econbiz.de/10010896576
This paper presents a preference-based method to handle optimization problems with multiple objectives. With an increase in the number of objectives the computational cost in solving a multi-objective optimization problem rises exponentially, and it becomes increasingly difficult for...
Persistent link: https://www.econbiz.de/10010871163
Innovization (innovation through optimization) is a relatively new concept in the field of multi-objective engineering design optimization. It involves the use of Pareto-optimal solutions of a problem to unveil hidden mathematical relationships between variables, objectives and constraint...
Persistent link: https://www.econbiz.de/10010845792
<title/> Optimal fleet size distribution and scheduling with transfer consideration for a transit system is a difficult optimization problem. A traditional formulation of the problem leads to a large non-linear mixed integer programming problem. Past experience has shown that traditional optimization...
Persistent link: https://www.econbiz.de/10010975641
In solving certain optimization problems, the corresponding Lagrangian dual problem is often solved simply because in these problems the dual problem is easier to solve than the original primal problem. Another reason for their solution is the implication of the weak duality theorem which...
Persistent link: https://www.econbiz.de/10010994031
Karush–Kuhn–Tucker (KKT) optimality conditions are often checked for investigating whether a solution obtained by an optimization algorithm is a likely candidate for the optimum. In this study, we report that although the KKT conditions must all be satisfied at the optimal point, the extent...
Persistent link: https://www.econbiz.de/10010994064
Only a few attempts in past have been made in adopting a unified outlook towards different paradigms in evolutionary computation (EC). The underlying motivation of these studies was aimed at gaining better understanding of evolutionary methods, both at the level of theory as well as application,...
Persistent link: https://www.econbiz.de/10010994117
Among the penalty based approaches for constrained optimization, augmented Lagrangian (AL) methods are better in at least three ways: (i) they have theoretical convergence properties, (ii) they distort the original objective function minimally, thereby providing a better function landscape for...
Persistent link: https://www.econbiz.de/10010998394
In many areas of life it is useful to be able to compare one's own performance to some general benchmark data. The Internet provides a way of realizing such a comparison so that the original database can be hidden from users by locating it in a server computer and users can test their individual...
Persistent link: https://www.econbiz.de/10005837847