Design of Curves and Surfaces Using Multi-Objective Optimization
|
|
- Molly Wiggins
- 6 years ago
- Views:
Transcription
1 Design of Curves and Surfaces Using Multi-Objective Optimization Rony Goldenthal and Michel Bercovier Abstract. Design by optimization of curves and surfaces is a powerful design technique. The mathematical modeling of the design problem often results in a multi-objective optimization (MOO) problem which cannot be handled as such by traditional single objective optimization algorithms. Hence an evolutionary MOO algorithm is used to handle this case. The use of MOO algorithm enhances the design process by enabling optimization of several design objectives at once. The algorithm is used for the optimization of NURBS curves and surfaces. The optimization variables are the knot vectors, the parametrizations and the NURBS weights; all of which are set automatically during the optimization process as those who define the optimal surface with respect to the design objectives. 1. Introduction Design by optimization of curves and surfaces is a powerful design technique. In this framework the quality of the surface is measured using a certain function, then an optimization algorithm is applied in order to optimize the function to improve the quality of the surface. Often, the initial data is not a surface, but some measurement points in space which roughly define the shape of the surface. The surface should approximate the shape defined by these measurement points. In order to assure that the surface approximates the measurement points, a functional which measures the distance between the surface and the points is defined. This functional is to be minimized as well. Furthermore, in order to guaranty robustness of the optimization algorithm and in order to prevent certain singular situations fairness terms may be added. The fairness terms are often functionals to be optimized. Thus a typical design by optimization easily ends up with several functionals to optimize, therefore a multi-objective algorithm is 1
2 2 R. Goldenthal M. Bercovier required. Multi-objective optimization problems do not have in general a unique optimal solution. Rather the result is a set of candidate solutions. Traditional optimization algorithms such as conjugate gradient and Newton based approaches are only suited for single functional to be optimized. Previous works dealt with this general situation in several ways: augmenting all the functionals into a single functional by setting importance to each functional (weights) and summing all the functional into a single one [9, 11, 13, 2, 3]; splitting the optimization process into several phases and optimizing each functional separately [22, 4] or modeling the problem as an optimal control problem, in this case the fitting part becomes the state function and the design objective is the cost function [1, 12]. The above approaches allow to plug a multi objective problem into single objective optimization algorithm and obtain results (These approaches clearly do not solve the multi objective problem as such). In this work a real multi objective algorithm will be used in order to handle all functionals resulting from the design by optimization approach. The result of the optimization process is set of NURBS surfaces or curves of arbitrary degree. The optimization variables are the NURBS weights (poles) w, knot vector u, v and parametrization s, t, Once multi-objective algorithm is used new design possibilities arise: the user can freely choose more than one design objective in order to better express his design needs. By using a real multi objective algorithm there is no need to apriory compromise between the different functionals: no weights need to be assigned to each functional; all the functionals are optimized at once and the result is a set of solutions which represent optimal trade off between the different functionals. As opposed to traditional surface fitting algorithms, our method sets all the parameters automatically as those which optimize the design objectives, i.e. no need to set parameterization, knot vectors or NURBS weights. The resulting optimization algorithm is highly automatic (few parameters to set), robust, effective and capable of handling highly non-linear (even non-derivable) design objectives. 2. Problem Statement The group of surfaces dealt with in this work are tensor product NURBS surfaces of arbitrary degree. A tensor product NURBS surface is defined as n 1 S(u,v) = i=0 m 1 j=0 P i,j R i,j (s,t) (1) Where P i,j are the control points of the surface and R i,j (s,t) are the NURBS basis function which depend on w, the poles, u, v the horizontal
3 Design of Curves and Surfaces Using MOO 3 and vertical knot vectors, the orders d u,d v of the surface and s, t the parametrization. The input for the optimization problem is: a set of measurements (input points) Q = Q 0,0,...,Q N 1,M 1 R d, d = 2,3 the orders of the surface and the number of control points to be used n,m. a set of design objectives J 0 (S(s,t)),...,J k (S(s,t)) to guide the optimization process, see section. The optimization variables are the NURBS poles w, knot vectors s, t and parametrization u, v. Linear least squares fitting is used to create a surface (calculate the control points P i,j ) from the input points, Q i,j. This fitting depends on the the optimization variables. The quality of this surface is determined by evaluating all the selected design objectives on it. The goal of the optimization process is to produce a set of NURBS surfaces which approximates the input points Q and are optimal with respect to the specified design objectives Design Objectives As seen in [11], the use of genetic algorithm for curve optimization allows usage of highly non-linear and even non-derivable design objectives. For curves, the same design objectives as in [11] are used. For surfaces, the following design objectives were implemented: Approximation Error Measuring approximation error is norm specific, in gradient based methods usually the L 2 norm is used because it is derivable. n 1 J = min( i=0 m 1 j=0 S(s i,t i ) Q i,j 2 ) (2) There are situations, however, in which measuring approximation error is more natural under the L norm. Using genetic algorithm both equations can be optimized. The approximation error under L norm is: J = max( S(s i,t j ) Q i,j ),i = 0,...,n 1;j = 0,...,m 1 In both cases the distance between the surface and the points Q measured at the parametrization points s i, t j. It is important to note that when using the approximation error as a design objective the optimization variables are modified in order to reduce the error. While during
4 4 R. Goldenthal M. Bercovier the linear least squares fitting mentioned in section the surface which minimizes the L 2 approximation error with respect to the current optimization variables is found Surface Area Surface area can be valuable design objective in conjunction with approximation error since optimizing it can help controlling artifacts due to over-fitting. 1 1 J = ds ds ds dt dsdt Surface Elastic Energy 0 0 Optimizing this term generally produces visually pleasing surfaces. J = κ 2 min + κ 2 max da Where A is the surface area. This is a highly non-linear term, by using genetic algorithm it is possible optimize this exact term and not use an approximating term (such as the norm of the second derivatives). Using multiple-objective optimization any combination of the above is possible Optimizing NURBS Surfaces The handling of the parameterization and knot vector is similar to [11] with the main difference that for surfaces there are two parametrization and knot vectors instead of one for curves. Incorporating the NURBS weights makes the optimization process considerably more complex and time consuming: The number of degrees of freedom (DOF) is largely increased: When optimizing only the knot vector and parametrization the number of DOF is proportional to n + m (sizes of parameterization in horizontal and vertical direction), while during NURBS weights optimization the number of DOF is proportional to n m since there is one weight for each control point. The calculation of the derivatives becomes more complex (see [19]). Given the optimization variables u, v, s, t, w linear least squares fitting is used to find the control points d that define the surface which best approximates the given input points Q. In order for the surface to have the specified weights w and still approximate the input points, the technique described in [14] was used: Let M be the collocation matrix used for non-rational B-Spline surface fitting; Q x, Q y, Q z are the coordinates of Q, the data to be fitted; diag(x)
5 Design of Curves and Surfaces Using MOO 5 a diagonal matrix whose entries are the vector x. t = M w X = diag(q x ) Y = diag(q x ) Z = diag(q z ) v x = X t v y = Y t v z = Z t The position of the surface s control points (multiplied by their weights) P x, P y, Pd z are given by least solution of the following equations: d x = M v x d y = M v y d z = M v z Another complexity rising from NURBS optimization lies in the non-linear nature of local weight modification. Using a robust optimizer such as a genetic algorithm this non-linearity can be handled. The extra effort done in order to support NURBS is important since non-rational B-splines cannot precisely represent important family of curves and surfaces including circles, ellipses, spheres, cylinders, etc. (a) length: 3.932; L 2 approximation error: (b) length: 3.909; L 2 approximation error: (c) length: 3.965; L 2 approximation error: Fig. 1. Curves (a) and (b) are not-dominated with respect to each other. i.e. it cannot be decided which one is better with respect to the design objectives. Curve (c), on the other hand, is dominated by both (a) and (b); it is worse than both other curves. 3. Optimization Process Multi-objective optimization (MOO) algorithm must be used in order to efficiently optimize all the design objectives at once. The results shown in this work are produced using NSGAII [5] Other algorithms (NSGA [21] and SPEA [23] were tested and produced comparable results.
6 6 R. Goldenthal M. Bercovier 3.1. Domination and the Pareto-Optimal Set When trying to optimize more than one (potentially conflicting) functionals better-than and worse-than relationship do not longer hold. For example, when optimizing approximation error and curve length These design objective are conflicting since the longer the curve is the more it is able to fit the input points. Examine the three curves in figure 1: c 1 has length of and approximation error of ; c 2 has length of and approximation error of ; c 3, on the other hand, has length of and approximation error of It can be easily seen than c 1 and c 2 are better in both objectives than c 3. It cannot be determined, however, without applying further knowledge if c 1 or c 2 is better. c 1 and c 2 are said to dominate the solution c 3. c 3 is sub-optimal with regard to the other curves and therefore is not part of the optimal solution set. This relationship between c 1 and c 2 is said to be non-dominated with respect to each other. The goal of a multi-objective algorithm therefore is to find as many solutions as possible from the set of non-dominated solutions, also known as the Pareto optimal set. Another important goal is to have the solutions as diverse as possible in the solution space. The reason for this is to reduce bias towards any specific design objective. For a more formal definition of domination and the Pareto optimal set, see [6] Evolutionary Algorithms Evolutionary algorithms [10] are natural choice for multi-objective optimization [6] since at each step the algorithms keeps a population, which is a set of solutions instead of a single, optimal, solution. The use of single objective evolutionary algorithm in CAD proved to be a powerful technique [11, 20, 15, 16] because of its robustness and efficient handling of highly non-linear objective functions and constrains. The extension from single objective to multi-objective is straight-forward. The main difference is in the selection step. In this step the individuals are sorted into dominated and non-dominated solutions. The selection of parents for the next generation favors non-dominated individuals. The result of the algorithm is the set of non-dominated solutions in the last generation of the algorithm. See [5, 21, 6, 23, 18] for more details about this step. See figure 2 for a schematic description of the optimization process. 4. Results The library MOMHLib++ [17, 18] was used for the implementation of the above MOO algorithms. The IRIT solid modeling environment [8] was used for the NURBS related routines Curve Optimization
7 Design of Curves and Surfaces Using MOO 7 Population Initialization random u,v,s,t uniform w Fitness Evaluation For each individual: create surface by fitting; evaluate all design objectives Selection Select parents for breeding: prefer among not dominated set New Generation create offspring by crossover of two parents mutate new offspring add offspring to new generation Replace Generations Check Termination Fig. 2. Schematic flow chart of the optimization process In figure 3 three NURBS curves are displayed. It is an interpolation example with 14 input points; the order of the curves is 4. Below each curve the relative place in the non-dominated set is displayed. The x-axis represents the length of the curve, the y-axis represents the elastic energy. As mentioned before since the design objective are conflicting, it cannot be determined which of the curves is the best. The designer must, using his aesthetic sense or other other heuristic decide which curve to select Surface Optimization Figure 4 displays an approximating surface example. 144 input points are approximated using 36 control points and 6th order surfaces (in both directions). The design objectives are: L 2 approximation error, surface area and surface elastic energy. Table 1 summarizes the design objective results for this example. It can be seen that the extreme surfaces: i.e. surfaces with best design objective in one of the objectives, look less appealing than surfaces with overall good objective values. 5. Discussion In general the result of MOO is a set of solutions and not a single solution. At first it may seem as a drawback, but for this application, it is considered as one of its strengths. Design, in principle, is a decision making process, either by a computer or by a human designer. By using single objective optimization all the decisions are done by the optimization software leaving little freedom for the user (human designer). Since some surface qualities are hard to measure using mathematical equations (for example beauty of the surface) such consideration cannot be part of a single objective optimization process. On the other hand, using MOO, the user can select any surface from the final non-dominated set since they are all optimal, with respect to the measureable design objectives. During this selection high level decision such as the beauty of the surface can be taken into consideration. A different, interesting, approach suggested in [7] is to use the non-dominated set in order to come up with innovative design principles.
8 8 R. Goldenthal M. Bercovier Sub-figure Approximation Error Area Elastic Energy (a) (b) (c) (d) (e) (f) Tab. 1. Comparison of design objective values among the surfaces figure 4 6. Conclusion In this work a multi objective optimization algorithm was suggested for design by optimization of curves and surfaces. This approach seems promising due to the robustness and efficiency of evolutionary algorithms combined with the design flexibility resulting from multi-objective optimization. Optimizing the knots, parametrization and NURBS weights exploits maximal degrees of freedom of the surface and therefore high quality results may be obtained. 7. References 1. Alhanaty, M., Bercovier M., Curve and surface fitting and design by optimal control methods, Computer-Aided Design, Vol. 33, No. 2, pp , Bloor, M.I.G, Wilson, M.J, Hagen, H., The smoothing properties of variational schemes for surface design, Computer Aided Geometric Design, Vol. 12, pp , Brunnett, G., Hagen H., Santarelli P., Variational design of curve and surfaces, Surveys on Mathematics for Industry, Vol 3. pp. 1 27, Brunnett, G., Kiefer, J., Interpolation with minimal-energy splines. Computer-Aided Design, Vol. 26, No. 2, pp , Deb, K., Goel T., Controlled elitist non-dominated sorting genetic algorithms for better convergence, Proc. of the First International Conference on Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science E. Zitzler, K. Deb, L. Thiele, C.A. Coello Coello, D. Corne (eds.) vol 1993, Springer, Berlin (2001), Deb, K., Evolutionary algorithms for multi-criterion optimization in engineering design, Evolutionary Algorithms in Engineering and Computer Science, Miettinen K., Mäkelä, M. M., Neittaanmäki, P., and
9 Design of Curves and Surfaces Using MOO 9 Periaux J. (eds.), John Wiley Sons, Ltd, Chichester, UK, pp , Deb, K., Chaudhuri, S., Jain, P., Gupta, N.,Maji H., and Reddy, R., Discovering innovating design principles using multiple conflicting objectives International Congress Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, Bugeda, G., Désidéri, J.-A, Périaux, J., Schoenauer, M., and Winter G. (eds.), Elbar, G., IRIT solid modeling environment, irit/ 9. Laurent-Gengoux, P., Mekhilef M., Optimization of a NURBS representation, Computer-Aided Design 2 (1981), Goldberg, D. E., Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley, Goldenthal, R., Bercovier, M., Spline curve approximation and design over the knots using genetic algorithms, International Congress Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, Bugeda, G., Désidéri, J.-A, Périaux, J., Schoenauer, M., and Winter G. (eds.), Goldenthal, R., Bercovier, M., Spline curve approximation and design over the knots, Computing, Springer-Verlag Wien,Vol. 72, num. 1-2, pp , April Loos, J., Greiner, G., Seidel,H.-P., Modeling Surfaces with Fair Reflection Line Pattern, Proceedings of the 1999 International Conference on Shape Modelling and Applications, Aizu-Wakamatsu, pp Ma, W., Knuth, J.-P., NURBS curve and surface fitting and interpolation, Mathematical Methods for Curves and Surfaces, M. Dæhlen, T. Lyche, and L. L. Schumaker (eds.), Vanderbilt University Press, Nashville, 1995 pp Markus, A., Renner G., and Vancza, J., Genetic algorithms in free form curve design, Mathematical Methods for Curves and Surfaces, Vanderbilt University Press,pp Markus, A., Renner, G., and Vancza, J., Spline interpolation with genetic algorithms, Proceedings of the 1997 International Conference on Shape Modelling and Applications, Aizu-Wakamatsu, pp Jaszkiewicz, A., MOMHLib++: Open source Multiple- Objective MetaHeuristics Library in C++, jaszkiewicz/momhlib/
10 10 R. Goldenthal M. Bercovier 18. Jaszkiewicz, A., Comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm, Annals of Operations Research, 131 (1-4), pp , October L. Piegl, W. Tiller, The NURBS Book, 2nd Edition, New York: Springer-Verlag Renner G. (ed.), Computer-Aided Design, Genetic Algorithms, Vol 35, Issue 8. pp , Srinivas N., Deb K., Multiple objective optimization using nondominated sorting in genetic algorithms, Evolutionary Computation, 2, 2, , Westgaard, G., Nowacki H., Construction of fair surfaces over irregular meshes, ACM Symposium on Solid Modeling and Applications, Proceedings of the sixth ACM symposium on Solid modeling and applications, pp , Zitzler E., Thiele L., Multiobjective evolutionary algorithms: a comparative case study and the strength pareto evolutionary algorithm, IEEE Transactions on Evolutionary Computation, 3, 4, , Rony Goldenthal and Michel Bercovier Hebrew University Jerusalem, Israel {ronygold,berco}@cs.huji.ac.il
11 Design of Curves and Surfaces Using MOO 11 (a) length: 3.454; elastic energy: (b) length: 3.525; elastic energy: (c) length: 3.606; elastic energy: (d) shortest curve (e) a compromise between length and elastic energy (f) curve with the least elastic energy Fig. 3. Different solutions from the non-dominated set. Design objective are curve length and elastic energy. Below each curve is displayed its relative position in the final non-dominated set. The y axis represents the elastic energy and the x axis represents the length.
12 12 R. Goldenthal M. Bercovier (a) 0.155; 1.191; (b) 0.090; 1.204; (c) 0.158; 1.049; (d) 0.092; 1.099; (e) 0.063; 1.282; (f) 0.214; 1.039; Fig. 4. Different solutions from the non-dominated set; the values under each figure are the approximation error, surface area and elastic energy respectively (these are the design objectives). Table 1 summarizes these results
Lamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems
Repair and Repair in EMO Algorithms for Multiobjective 0/ Knapsack Problems Shiori Kaige, Kaname Narukawa, and Hisao Ishibuchi Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho,
More informationMulti-objective Optimization
Jugal K. Kalita Single vs. Single vs. Single Objective Optimization: When an optimization problem involves only one objective function, the task of finding the optimal solution is called single-objective
More informationRecombination of Similar Parents in EMO Algorithms
H. Ishibuchi and K. Narukawa, Recombination of parents in EMO algorithms, Lecture Notes in Computer Science 341: Evolutionary Multi-Criterion Optimization, pp. 265-279, Springer, Berlin, March 25. (Proc.
More informationIncorporation of Scalarizing Fitness Functions into Evolutionary Multiobjective Optimization Algorithms
H. Ishibuchi, T. Doi, and Y. Nojima, Incorporation of scalarizing fitness functions into evolutionary multiobjective optimization algorithms, Lecture Notes in Computer Science 4193: Parallel Problem Solving
More informationComparison of Evolutionary Multiobjective Optimization with Reference Solution-Based Single-Objective Approach
Comparison of Evolutionary Multiobjective Optimization with Reference Solution-Based Single-Objective Approach Hisao Ishibuchi Graduate School of Engineering Osaka Prefecture University Sakai, Osaka 599-853,
More informationA Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization
A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization Hisao Ishibuchi and Youhei Shibata Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho, Sakai,
More informationMulti-objective Optimization
Some introductory figures from : Deb Kalyanmoy, Multi-Objective Optimization using Evolutionary Algorithms, Wiley 2001 Multi-objective Optimization Implementation of Constrained GA Based on NSGA-II Optimization
More informationA Distance Metric for Evolutionary Many-Objective Optimization Algorithms Using User-Preferences
A Distance Metric for Evolutionary Many-Objective Optimization Algorithms Using User-Preferences Upali K. Wickramasinghe and Xiaodong Li School of Computer Science and Information Technology, RMIT University,
More informationUsing ɛ-dominance for Hidden and Degenerated Pareto-Fronts
IEEE Symposium Series on Computational Intelligence Using ɛ-dominance for Hidden and Degenerated Pareto-Fronts Heiner Zille Institute of Knowledge and Language Engineering University of Magdeburg, Germany
More informationApproximation of 3D-Parametric Functions by Bicubic B-spline Functions
International Journal of Mathematical Modelling & Computations Vol. 02, No. 03, 2012, 211-220 Approximation of 3D-Parametric Functions by Bicubic B-spline Functions M. Amirfakhrian a, a Department of Mathematics,
More informationMulti-objective Optimization Algorithm based on Magnetotactic Bacterium
Vol.78 (MulGrab 24), pp.6-64 http://dx.doi.org/.4257/astl.24.78. Multi-obective Optimization Algorithm based on Magnetotactic Bacterium Zhidan Xu Institute of Basic Science, Harbin University of Commerce,
More informationTowards Automatic Recognition of Fonts using Genetic Approach
Towards Automatic Recognition of Fonts using Genetic Approach M. SARFRAZ Department of Information and Computer Science King Fahd University of Petroleum and Minerals KFUPM # 1510, Dhahran 31261, Saudi
More informationEvolutionary multi-objective algorithm design issues
Evolutionary multi-objective algorithm design issues Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More informationUNSTRUCTURED GRIDS ON NURBS SURFACES. The surface grid can be generated either in a parameter. surfaces. Generating grids in a parameter space is
UNSTRUCTURED GRIDS ON NURBS SURFACES Jamshid Samareh-Abolhassani 1 Abstract A simple and ecient computational method is presented for unstructured surface grid generation. This method is built upon an
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department ofmechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More informationFinding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls
Finding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls Florian Siegmund, Amos H.C. Ng Virtual Systems Research Center University of Skövde P.O. 408, 541 48 Skövde,
More informationApproximation-Guided Evolutionary Multi-Objective Optimization
Approximation-Guided Evolutionary Multi-Objective Optimization Karl Bringmann 1, Tobias Friedrich 1, Frank Neumann 2, Markus Wagner 2 1 Max-Planck-Institut für Informatik, Campus E1.4, 66123 Saarbrücken,
More informationComputation Method for Evaluation of Surface Fine Structure by Highlight Lines
Computation Method for Evaluation of Surface Fine Structure by Highlight Lines György Gyurecz 1, Dr. Gábor Renner 2 1 Institute of Machine Design and Safety Engineering, Óbuda University 2 Computer and
More informationThe Journal of MacroTrends in Technology and Innovation
MACROJOURNALS The Journal of MacroTrends in Technology and Innovation Automatic Knot Adjustment Using Dolphin Echolocation Algorithm for B-Spline Curve Approximation Hasan Ali AKYÜREK*, Erkan ÜLKER**,
More informationEvolutionary Algorithms: Lecture 4. Department of Cybernetics, CTU Prague.
Evolutionary Algorithms: Lecture 4 Jiří Kubaĺık Department of Cybernetics, CTU Prague http://labe.felk.cvut.cz/~posik/xe33scp/ pmulti-objective Optimization :: Many real-world problems involve multiple
More informationNCGA : Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems
: Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems Shinya Watanabe Graduate School of Engineering, Doshisha University 1-3 Tatara Miyakodani,Kyo-tanabe, Kyoto, 10-031,
More informationFairing Bicubic B-Spline Surfaces using Simulated Annealing
Fairing Bicubic B-Spline Surfaces using Simulated Annealing Stefanie Hahmann and Stefan Konz Abstract. In this paper we present an automatic fairing algorithm for bicubic B-spline surfaces. The fairing
More informationDevelopment of Evolutionary Multi-Objective Optimization
A. Mießen Page 1 of 13 Development of Evolutionary Multi-Objective Optimization Andreas Mießen RWTH Aachen University AVT - Aachener Verfahrenstechnik Process Systems Engineering Turmstrasse 46 D - 52056
More informationEVOLUTIONARY algorithms (EAs) are a class of
An Investigation on Evolutionary Gradient Search for Multi-objective Optimization C. K. Goh, Y. S. Ong and K. C. Tan Abstract Evolutionary gradient search is a hybrid algorithm that exploits the complementary
More informationExploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
Seventh International Conference on Hybrid Intelligent Systems Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search Crina Grosan and Ajith Abraham Faculty of Information Technology,
More informationKnot Insertion and Reparametrization of Interval B-spline Curves
International Journal of Video&Image Processing and Network Security IJVIPNS-IJENS Vol:14 No:05 1 Knot Insertion and Reparametrization of Interval B-spline Curves O. Ismail, Senior Member, IEEE Abstract
More informationMultiobjective Formulations of Fuzzy Rule-Based Classification System Design
Multiobjective Formulations of Fuzzy Rule-Based Classification System Design Hisao Ishibuchi and Yusuke Nojima Graduate School of Engineering, Osaka Prefecture University, - Gakuen-cho, Sakai, Osaka 599-853,
More informationSPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2
SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2 Mifa Kim 1, Tomoyuki Hiroyasu 2, Mitsunori Miki 2, and Shinya Watanabe 3 1 Graduate School, Department of Knowledge Engineering
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More informationMulti-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design Matthew
More informationMulti-Objective Optimization Using Genetic Algorithms
Multi-Objective Optimization Using Genetic Algorithms Mikhail Gaerlan Computational Physics PH 4433 December 8, 2015 1 Optimization Optimization is a general term for a type of numerical problem that involves
More informationRevision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems
4 The Open Cybernetics and Systemics Journal, 008,, 4-9 Revision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems K. Kato *, M. Sakawa and H. Katagiri Department of Artificial
More informationMechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA
Mechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA Kalyanmoy Deb, Amrit Pratap, and Subrajyoti Moitra Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute
More informationHigh-Quality Shape Fitting for Aesthetic Modeling Based on Class A Condition
632 High-Quality Shape Fitting for Aesthetic Modeling Based on Class A Condition Tetsuo Oya 1, Hiroki Amemiya 2, Hideki Aoyama 3 and Masatake Higashi 4 1 Keio University, oya@sd.keio.ac.jp 2 Keio University,
More informationLocal Modification of Subdivision Surfaces Based on Curved Mesh
Local Modification of Subdivision Surfaces Based on Curved Mesh Yoshimasa Tokuyama Tokyo Polytechnic University tokuyama@image.t-kougei.ac.jp Kouichi Konno Iwate University konno@cis.iwate-u.ac.jp Junji
More informationReference Point-Based Particle Swarm Optimization Using a Steady-State Approach
Reference Point-Based Particle Swarm Optimization Using a Steady-State Approach Richard Allmendinger,XiaodongLi 2,andJürgen Branke University of Karlsruhe, Institute AIFB, Karlsruhe, Germany 2 RMIT University,
More informationAssessing the Convergence Properties of NSGA-II for Direct Crashworthiness Optimization
10 th International LS-DYNA Users Conference Opitmization (1) Assessing the Convergence Properties of NSGA-II for Direct Crashworthiness Optimization Guangye Li 1, Tushar Goel 2, Nielen Stander 2 1 IBM
More informationNote on Industrial Applications of Hu s Surface Extension Algorithm
Note on Industrial Applications of Hu s Surface Extension Algorithm Yu Zang, Yong-Jin Liu, and Yu-Kun Lai Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science
More informationEvolutionary form design: the application of genetic algorithmic techniques to computer-aided product design
Loughborough University Institutional Repository Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design This item was submitted to Loughborough University's
More informationFitting Uncertain Data with NURBS
Fitting Uncertain Data with NURBS Wolfgang Heidrich, Richard Bartels, George Labahn Abstract. Fitting of uncertain data, that is, fitting of data points that are subject to some error, has important applications
More informationDCMOGADES: Distributed Cooperation model of Multi-Objective Genetic Algorithm with Distributed Scheme
: Distributed Cooperation model of Multi-Objective Genetic Algorithm with Distributed Scheme Tamaki Okuda, Tomoyuki HIROYASU, Mitsunori Miki, Jiro Kamiura Shinaya Watanabe Department of Knowledge Engineering,
More informationDecomposition of Multi-Objective Evolutionary Algorithm based on Estimation of Distribution
Appl. Math. Inf. Sci. 8, No. 1, 249-254 (2014) 249 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/080130 Decomposition of Multi-Objective Evolutionary
More information2) For any triangle edge not on the boundary, there is exactly one neighboring
Triangulating Trimmed NURBS Surfaces Chang Shu and Pierre Boulanger Abstract. This paper describes techniques for the piecewise linear approximation of trimmed NURBS surfaces. The problem, called surface
More informationGraphical User Interface For Multi-Objective Decision Support
Master Thesis Graphical User Interface For Multi-Objective Decision Support Author: Benjamin Keller Supervisor: Dr. Thomas Hanne A master thesis presented to the School of Business of the University of
More informationProceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds
Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds REFERENCE POINT-BASED EVOLUTIONARY MULTI-OBJECTIVE OPTIMIZATION FOR INDUSTRIAL
More informationNURBS: Non-Uniform Rational B-Splines AUI Course Denbigh Starkey
NURBS: Non-Uniform Rational B-Splines AUI Course Denbigh Starkey 1. Background 2 2. Definitions 3 3. Using NURBS to define a circle 4 4. Homogeneous coordinates & control points at infinity 9 5. Constructing
More informationEfficient Degree Elevation and Knot Insertion for B-spline Curves using Derivatives
Efficient Degree Elevation and Knot Insertion for B-spline Curves using Derivatives Qi-Xing Huang a Shi-Min Hu a,1 Ralph R Martin b a Department of Computer Science and Technology, Tsinghua University,
More informationEvolutionary Multi-objective Optimization of Business Process Designs with Pre-processing
Evolutionary Multi-objective Optimization of Business Process Designs with Pre-processing Kostas Georgoulakos Department of Applied Informatics University of Macedonia Thessaloniki, Greece mai16027@uom.edu.gr
More informationGenetic algorithms and finite element coupling for mechanical optimization
Computer Aided Optimum Design in Engineering X 87 Genetic algorithms and finite element coupling for mechanical optimization G. Corriveau, R. Guilbault & A. Tahan Department of Mechanical Engineering,
More informationPerformance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances
Performance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances Minzhong Liu, Xiufen Zou, Yu Chen, Zhijian Wu Abstract In this paper, the DMOEA-DD, which is an improvement of DMOEA[1,
More informationFinding Sets of Non-Dominated Solutions with High Spread and Well-Balanced Distribution using Generalized Strength Pareto Evolutionary Algorithm
16th World Congress of the International Fuzzy Systems Association (IFSA) 9th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT) Finding Sets of Non-Dominated Solutions with High
More informationFinding Tradeoffs by Using Multiobjective Optimization Algorithms
Finding Tradeoffs by Using Multiobjective Optimization Algorithms Shigeru Obayashi, Daisuke Sasaki,* Akira Oyama** Institute of Fluid Science, Tohoku University, Sendai, 98-8577, Japan *Present address,
More informationCommunication Strategies in Distributed Evolutionary Algorithms for Multi-objective Optimization
CONTI 2006 The 7 th INTERNATIONAL CONFERENCE ON TECHNICAL INFORMATICS, 8-9 June 2006, TIMISOARA, ROMANIA Communication Strategies in Distributed Evolutionary Algorithms for Multi-objective Optimization
More informationInternational Conference on Computer Applications in Shipbuilding (ICCAS-2009) Shanghai, China Vol.2, pp
AUTOMATIC DESIGN FOR PIPE ARRANGEMENT CONSIDERING VALVE OPERATIONALITY H Kimura, Kyushu University, Japan S Iehira, Kyushu University, Japan SUMMARY We propose a novel evaluation method of valve operationality
More informationUntil now we have worked with flat entities such as lines and flat polygons. Fit well with graphics hardware Mathematically simple
Curves and surfaces Escaping Flatland Until now we have worked with flat entities such as lines and flat polygons Fit well with graphics hardware Mathematically simple But the world is not composed of
More informationCHAPTER 2 MULTI-OBJECTIVE REACTIVE POWER OPTIMIZATION
19 CHAPTER 2 MULTI-OBJECTIE REACTIE POWER OPTIMIZATION 2.1 INTRODUCTION In this chapter, a fundamental knowledge of the Multi-Objective Optimization (MOO) problem and the methods to solve are presented.
More informationConstrained modification of the cubic trigonometric Bézier curve with two shape parameters
Annales Mathematicae et Informaticae 43 (014) pp. 145 156 http://ami.ektf.hu Constrained modification of the cubic trigonometric Bézier curve with two shape parameters Ede Troll University of Debrecen
More information9.0 References. [Appl89] Applegarth, I., Catley, D., Bradley, I., Clipping of B-spline patches at
9.0 References [Appl89] Applegarth, I., Catley, D., Bradley, I., Clipping of B-spline patches at surface Curves, The Mathematics of Surfaces III, Clarendon Press, Oxford, 1989, pp. 229-242. [Bohm84] Bohm,
More informationProgressive Surface Modeling Based On 3D Motion Sketch
Progressive Surface Modeling Based On 3D Motion Sketch SHENGFENG IN, and DAVID K WRIGHT School of Engineering and Design Brunel University Uxbridge, Middlesex UB8 3PH UK Abstract: - This paper presents
More informationLecture 5: Optimization of accelerators in simulation and experiments. X. Huang USPAS, Jan 2015
Lecture 5: Optimization of accelerators in simulation and experiments X. Huang USPAS, Jan 2015 1 Optimization in simulation General considerations Optimization algorithms Applications of MOGA Applications
More informationOptimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows Abel Garcia-Najera and John A. Bullinaria School of Computer Science, University of Birmingham Edgbaston, Birmingham
More informationMULTI-OBJECTIVE OPTIMIZATION
MULTI-OBJECTIVE OPTIMIZATION Introduction Many real-world problems require the simultaneous optimization of a number of objective functions. Some of these objectives may be in conflict. Example 1:optimal
More informationDgp _ lecture 2. Curves
Dgp _ lecture 2 Curves Questions? This lecture will be asking questions about curves, their Relationship to surfaces, and how they are used and controlled. Topics of discussion will be: Free form Curves
More informationLate Parallelization and Feedback Approaches for Distributed Computation of Evolutionary Multiobjective Optimization Algorithms
Late arallelization and Feedback Approaches for Distributed Computation of Evolutionary Multiobjective Optimization Algorithms O. Tolga Altinoz Department of Electrical and Electronics Engineering Ankara
More informationA gradient-based multiobjective optimization technique using an adaptive weighting method
10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA A gradient-based multiobjective optimization technique using an adaptive weighting method Kazuhiro
More informationFinding Knees in Multi-objective Optimization
Finding Knees in Multi-objective Optimization Jürgen Branke 1, Kalyanmoy Deb 2, Henning Dierolf 1, and Matthias Osswald 1 1 Institute AIFB, University of Karlsruhe, Germany branke@aifb.uni-karlsruhe.de
More informationMultiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover
Multiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover J. Garen 1 1. Department of Economics, University of Osnabrück, Katharinenstraße 3,
More informationAn Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function Results
Syracuse University SURFACE Electrical Engineering and Computer Science College of Engineering and Computer Science -0-005 An Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function
More informationImproving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms.
Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms. Gómez-Skarmeta, A.F. University of Murcia skarmeta@dif.um.es Jiménez, F. University of Murcia fernan@dif.um.es
More informationCHAPTER 6 REAL-VALUED GENETIC ALGORITHMS
CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS 6.1 Introduction Gradient-based algorithms have some weaknesses relative to engineering optimization. Specifically, it is difficult to use gradient-based algorithms
More informationOn The Effects of Archiving, Elitism, And Density Based Selection in Evolutionary Multi-Objective Optimization
On The Effects of Archiving, Elitism, And Density Based Selection in Evolutionary Multi-Objective Optimization Marco Laumanns, Eckart Zitzler, and Lothar Thiele ETH Zürich, Institut TIK, CH 8092 Zürich,
More informationSPEA2: Improving the strength pareto evolutionary algorithm
Research Collection Working Paper SPEA2: Improving the strength pareto evolutionary algorithm Author(s): Zitzler, Eckart; Laumanns, Marco; Thiele, Lothar Publication Date: 2001 Permanent Link: https://doi.org/10.3929/ethz-a-004284029
More informationA NURBS-BASED APPROACH FOR SHAPE AND TOPOLOGY OPTIMIZATION OF FLOW DOMAINS
6th European Conference on Computational Mechanics (ECCM 6) 7th European Conference on Computational Fluid Dynamics (ECFD 7) 11 15 June 2018, Glasgow, UK A NURBS-BASED APPROACH FOR SHAPE AND TOPOLOGY OPTIMIZATION
More informationLes Piegl Wayne Tiller. The NURBS Book. Second Edition with 334 Figures in 578 Parts. A) Springer
Les Piegl Wayne Tiller The NURBS Book Second Edition with 334 Figures in 578 Parts A) Springer CONTENTS Curve and Surface Basics 1.1 Implicit and Parametric Forms 1 1.2 Power Basis Form of a Curve 5 1.3
More informationInterpolating and approximating scattered 3D-data with hierarchical tensor product B-splines
Interpolating and approximating scattered 3D-data with hierarchical tensor product B-splines Günther Greiner Kai Hormann Abstract In this note we describe surface reconstruction algorithms based on optimization
More informationCompromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization
Compromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization Benoît Guédas, Xavier Gandibleux, Philippe Dépincé To cite this version: Benoît Guédas, Xavier Gandibleux,
More informationHybrid Genetic Algorithms for Multi-objective Optimisation of Water Distribution Networks
Hybrid Genetic Algorithms for Multi-objective Optimisation of Water Distribution Networks Edward Keedwell and Soon-Thiam Khu Centre for Water Systems, School of Engineering and Computer Science and Mathematics,
More informationImproved S-CDAS using Crossover Controlling the Number of Crossed Genes for Many-objective Optimization
Improved S-CDAS using Crossover Controlling the Number of Crossed Genes for Many-objective Optimization Hiroyuki Sato Faculty of Informatics and Engineering, The University of Electro-Communications -5-
More informationAn Exploration of Multi-Objective Scientific Workflow Scheduling in Cloud
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 3 ISSN : 2456-3307 An Exploration of Multi-Objective Scientific Workflow
More informationR2-IBEA: R2 Indicator Based Evolutionary Algorithm for Multiobjective Optimization
R2-IBEA: R2 Indicator Based Evolutionary Algorithm for Multiobjective Optimization Dũng H. Phan Department of Computer Science University of Massachusetts, Boston Boston, MA 02125, USA Email: phdung@cs.umb.edu
More informationMultiobjective Optimisation. Why? Panorama. General Formulation. Decision Space and Objective Space. 1 of 7 02/03/15 09:49.
ITNPD8/CSCU9YO Multiobjective Optimisation An Overview Nadarajen Veerapen (nve@cs.stir.ac.uk) University of Stirling Why? Classic optimisation: 1 objective Example: Minimise cost Reality is often more
More informationCOLLISION-FREE TRAJECTORY PLANNING FOR MANIPULATORS USING GENERALIZED PATTERN SEARCH
ISSN 1726-4529 Int j simul model 5 (26) 4, 145-154 Original scientific paper COLLISION-FREE TRAJECTORY PLANNING FOR MANIPULATORS USING GENERALIZED PATTERN SEARCH Ata, A. A. & Myo, T. R. Mechatronics Engineering
More informationReference Point Based Evolutionary Approach for Workflow Grid Scheduling
Reference Point Based Evolutionary Approach for Workflow Grid Scheduling R. Garg and A. K. Singh Abstract Grid computing facilitates the users to consume the services over the network. In order to optimize
More informationA Memetic Heuristic for the Co-clustering Problem
A Memetic Heuristic for the Co-clustering Problem Mohammad Khoshneshin 1, Mahtab Ghazizadeh 2, W. Nick Street 1, and Jeffrey W. Ohlmann 1 1 The University of Iowa, Iowa City IA 52242, USA {mohammad-khoshneshin,nick-street,jeffrey-ohlmann}@uiowa.edu
More informationParameterization for curve interpolation
Working title: Topics in Multivariate Approximation and Interpolation 101 K. Jetter et al., Editors c 2005 Elsevier B.V. All rights reserved Parameterization for curve interpolation Michael S. Floater
More informationDeveloping an Approach to Redesign Freeform Surfaces Using B-Spline Technique
DOI: http://dx.doi.org/10.30684/etj.36.12a.1 Amjad B. Adulghafour A Department of Production Engineering and Metallurgy, University of Technology, Baghdad, Iraq Amjed_barzan@yahoo.com Ahmed T. Hassan Department
More informationApproximation Model Guided Selection for Evolutionary Multiobjective Optimization
Approximation Model Guided Selection for Evolutionary Multiobjective Optimization Aimin Zhou 1, Qingfu Zhang 2, and Guixu Zhang 1 1 Each China Normal University, Shanghai, China 2 University of Essex,
More informationEvolutionary Algorithms
A Hybrid Optimization Algorithm With Search Vector Based Automatic Switching Eric Inclan and George S. Dulikravich Florida International University, Miami FL Presented at WCSMO10, Orlando, Florida, May
More informationImproved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems
Improved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems Saku Kukkonen and Kalyanmoy Deb Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute
More informationGenetic Model Optimization for Hausdorff Distance-Based Face Localization
c In Proc. International ECCV 2002 Workshop on Biometric Authentication, Springer, Lecture Notes in Computer Science, LNCS-2359, pp. 103 111, Copenhagen, Denmark, June 2002. Genetic Model Optimization
More informationExperimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization
Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011 Devang Agarwal and Deepak Sharma Department of Mechanical
More informationNeed for Parametric Equations
Curves and Surfaces Curves and Surfaces Need for Parametric Equations Affine Combinations Bernstein Polynomials Bezier Curves and Surfaces Continuity when joining curves B Spline Curves and Surfaces Need
More informationMulti-Objective Memetic Algorithm using Pattern Search Filter Methods
Multi-Objective Memetic Algorithm using Pattern Search Filter Methods F. Mendes V. Sousa M.F.P. Costa A. Gaspar-Cunha IPC/I3N - Institute of Polymers and Composites, University of Minho Guimarães, Portugal
More informationGT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS
GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS M. Chandrasekaran 1, D. Lakshmipathy 1 and P. Sriramya 2 1 Department of Mechanical Engineering, Vels University, Chennai, India 2
More informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
More informationModule 1 Lecture Notes 2. Optimization Problem and Model Formulation
Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization
More informationSparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach
1 Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach David Greiner, Gustavo Montero, Gabriel Winter Institute of Intelligent Systems and Numerical Applications in Engineering (IUSIANI)
More informationAn External Archive Guided Multiobjective Evolutionary Approach Based on Decomposition for Continuous Optimization
IEEE Congress on Evolutionary Computation (CEC) July -,, Beijing, China An External Archive Guided Multiobjective Evolutionary Approach Based on Decomposition for Continuous Optimization Yexing Li School
More informationTracking Minimum Distances between Curved Objects with Parametric Surfaces in Real Time
Tracking Minimum Distances between Curved Objects with Parametric Surfaces in Real Time Zhihua Zou, Jing Xiao Department of Computer Science University of North Carolina Charlotte zzou28@yahoo.com, xiao@uncc.edu
More information