Significant stray magnetic field exists around the coils when charging the electric vehicles (EVs) with inductive power transfer (IPT), owning to the large air gap between the transmitter and receiver. The methods for field attenuation usually introduce extra losses and reduce the efficiency. This study focuses on the synergetic attenuation of stray magnetic field which is optimized simultaneously with the efficiency. The optimization is realized with Pareto front. In this dissertation, three methods are discussed for the field attenuation. The first method is to tune the physical parameters of the winding, such as the inner radii, outer radii, distribution of the turns, and types of the litz wires. The second method is to add metal shields around the IPT coils, in which litz wires are used as shields to reduce the shielding losses. The third method is to control the phases of winding currents, which avoids increasing the size and weight of the IPT coils. To attenuate the stray magnetic field by tuning the physical parameters, the conventional method is to sweep all the physical parameters in finite-element simulation. This takes thousands of simulations to derive the Pareto front, and it's especially time-consuming for three-dimensional simulations. This dissertation demonstrates a faster method to derive the Pareto front. The windings are replaced by the lumped loops. As long as the number of turns for each loop is known, the efficiency and magnetic field are calculated directly from the permeance matrices and current-to-field matrices. The sweep of physical parameters in finite-element simulation is replaced by the sweep of the turns numbers for the lumped loops in calculation. Only tens of simulations are required in the entire procedure, which are used to derive the matrices. An exemplary set of coils was built and tested. The efficiency from the matrix calculation is the same as the experimental measurement. The difference for stray magnetic field is less than 12.5%. Metal shields attenuate the stray magnetic field effectively, but generates significant losses owning to the uneven distribution of shield currents. This dissertation uses litz wires to replace the conventional plate shield or ring shield. Skin effect is eliminated so the shield currents are uniformly distributed and the losses are reduced. The litz shields are categorized to two types: shorted litz shield and driven litz shield. Circuit models are derived to analyze their behaviors. The concept of lumped-loop model is applied to derive the Pareto front of efficiency versus stray magnetic field for the coils with litz shield. In an exemplary IPT system, coils without metal shield and with metal shields are optimized for the same efficiency. Both the simulation and experimental measurement verify that the shorted litz shield has the best performance. The stray magnetic field is attenuated by 65% compared to the coils without shield. This dissertation also introduces the method to attenuate the stray magnetic field by controlling the phases of winding currents. The magnetic field around the coils is decomposed to the component in the axial direction and the component in the radial direction. The axial component decreases with smaller phase difference between windings' currents, while the radial component exhibits the opposite property. Because the axial component is dominant around the IPT coils, decreasing the phase difference is preferred. The dual-side-controlled converter is applied for the circuit realization. Bridges with active switches are used for both the inverter on the transmitter side and the rectifier on the receiver side. The effectiveness of this method was verified both in simulation and experiment. Compared to the conventional series-series IPT with 90° phase difference between winding currents, stray magnetic field was attenuated by up to 30% and 40% when the phase differences of winding currents are 50° and 40°, respectively. Furthermore, an analytical method is investigated to calculate the proximity-effect resistance of the planar coils with ferrite plate. The objective of this method is to work together with the fast optimization which uses the lumped-loop model. The existence of the ferrite plate complicates the calculation of the magnetic field across each turn which is critical to derive the proximity-effect resistance. In this dissertation, the ferrite plate is replaced by the mirrored turns according to the method of image. The magnetic fields are then obtained from Ampere's Law and Biot-Savart Law. Up to 200 kHz, the difference of the proximity-effect resistance is less than 15% between calculation and measurement. / Ph. D.

Doctor of Philosophy / Department of Electrical and Computer Engineering / Sanjoy Das / Stochastic algorithms are widely used in various modeling and optimization problems. Evolutionary algorithms are one class of population-based stochastic approaches that are inspired from Darwinian evolutionary theory. A population of candidate solutions is initialized at the first generation of the algorithm. Two variation operators, crossover and mutation, that mimic the real world evolutionary process, are applied on the population to produce new solutions from old ones. Selection based on the concept of survival of the fittest is used to preserve parent solutions for next generation. Examples of such algorithms include genetic algorithm (GA) and genetic programming (GP). Nevertheless, other stochastic algorithms may be inspired from animals’ behavior such as particle swarm optimization (PSO), which imitates the cooperation of a flock of birds. In addition, stochastic algorithms are able to address multi-objective optimization problems by using the concept of dominance. Accordingly, a set of solutions that do not dominate each other will be obtained, instead of just one best solution. This thesis proposes a multi-objective GP-PSO hybrid algorithm to recover gene regulatory network models that take environmental data as stimulus input. The algorithm infers a model based on both phenotypic and gene expression data. The proposed approach is able to simultaneously infer network structures and estimate their associated parameters, instead of doing one or the other iteratively as other algorithms need to. In addition, a non-dominated sorting approach and an adaptive histogram method based on the hypergrid strategy are adopted to address ‘convergence’ and ‘diversity’ issues in multi-objective optimization. Gene network models obtained from the proposed algorithm are compared to a synthetic network, which mimics key features of Arabidopsis flowering control system, visually and numerically. Data predicted by the model are compared to synthetic data, to verify that they are able to closely approximate the available phenotypic and gene expression data. At the end of this thesis, a novel breeding strategy, termed network assisted selection, is proposed as an extension of our hybrid approach and application of obtained models for plant breeding. Breeding simulations based on network assisted selection are compared to one common breeding strategy, marker assisted selection. The results show that NAS is better both in terms of breeding speed and final phenotypic level.

Les techniques de groupement technologique sont aujourd’hui utilisées dans de nombreux ateliers de fabrication; elles consistent à décomposer les systèmes industriels en sous-systèmes ou cellules constitués de pièces et de machines. Trouver le groupement technologique le plus efficace est formulé en recherche opérationnelle comme un problème de formation de cellules. La résolution de ce problème permet de tirer plusieurs avantages tels que la réduction des stocks et la simplification de la programmation. Plusieurs critères peuvent être définis au niveau des contraintes du problème tel que le flot intercellulaire,l’équilibrage de charges intracellulaires, les coûts de sous-traitance, les coûts de duplication des machines, etc. Le problème de formation de cellules est un problème d'optimisation NP-difficile. Par conséquent les méthodes exactes ne peuvent être utilisées pour résoudre des problèmes de grande dimension dans un délai raisonnable. Par contre des méthodes heuristiques peuvent générer des solutions de qualité inférieure, mais dans un temps d’exécution raisonnable. Dans ce mémoire, nous considérons ce problème dans un contexte bi-objectif spécifié en termes d’un facteur d’autonomie et de l’équilibre de charge entre les cellules. Nous présentons trois types de méthodes métaheuristiques pour sa résolution et nous comparons numériquement ces métaheuristiques. De plus, pour des problèmes de petite dimension qui peuvent être résolus de façon exacte avec CPLEX, nous vérifions que ces métaheuristiques génèrent des solutions optimales. / Group technology techniques are now widely used in many manufacturing systems. Those techniques aim to decompose industrial systems into subsystems or cells of parts and machines. The problem of finding the most effectivegroup technology is formulated in operations research as the Cell Formation Problem. Several criteria can be used to specify the optimal solution such as flood intercellular, intracellular load balancing, etc. Solving this problem leads to several advantages such as reducing inventory and simplifying programming. The Cell Formation Problem is an NP-hard problem; therefore, exact methods cannot be used to solve large problems within a reasonabletime, whereas heuristics can generate solutions of lower quality, but in a reasonable execution time. We suggest in this work, three different metaheuristics to solve the cell formation problem having two objectives functions: cell autonomy and load balancing between the cells.We compare numerically these metaheuristics. Furthermore, for problems of smaller dimension that can be solved exactly with CPLEX, we verify that the metaheuristics can reach the optimal value.

Cette thèse se compose de deux parties. Dans la partie I, nous avons comparé les différences entre les polymérisations en macro- et mini- émulsion. Nous avons établi un modèle de polymérisation en macro-émulsion. Ce modèle peut prédire la distribution de la taille de la chaîne radicalaire pour une classe donnée de tailles des particules. Par comparaison, nous avons établi un modèle de polymérisation en mini-émulsion. Ce modèle peut fournir la distribution des tailles des particules et l'évolution des tailles des gouttelettes. Dans la partie II, afin d'améliorer les propriétés du PP, deux types de monomères ont été utilisés pour être greffés sur PP par extrusion réactive. Ces monomères sont l'anhydride maléique MAH et le silane. Pour améliorer le degré de greffage de MAH sur PP, la montmorillonite organiquement modifiée o-MMT a été utilisée comme un nanoréacteur. Les influences des quantités de MAH et d'initiateur ont été étudiées. Afin d'améliorer le degré de greffage du silane sur PP, les conditions opératoires ont été étudiées. Toutefois, une relation simple entre les propriétés du produit et les conditions de fonctionnement n'a pas pu être trouvée. Pour obtenir le montant le plus élevé de silane greffé sur PP, et en même temps, restreindre les deux réactions secondaires, c'est à dire la polymérisation du silane et la dégradation de la PP chaîne, modèles polynomiaux ont été tentées pour décrire ce processus / This thesis consists of two parts: In Part I, the differences between macro-and mini-emulsion polymerization were compared. A model on macro-emulsion polymerization has been established. This model can predict the radical chain size distribution for a given class of particle sizes. By comparison, a model on mini-emulsion polymerization has been established. This model can provide the particle size distribution and the change of droplets size. In Part II, in order to improve the properties of PP, two kinds of monomers were used to be grafted on PP by reactive extrusion. These monomers were maleic anhydride (MAH) and silane. To improve the grafting degree of MAH on PP, organically modified montmorillonite (MMT) was used as a nanoreactor. The effects of the amounts of MAH and that of initiator were studied. In order to improve the grafting degree of silane on PP, the operating conditions were studied. However, a simple relation between the product properties and the operating conditions could not be found. To obtain the highest amount of silane grafted on PP, and meanwhile, restraining the two side reactions, i.e. the polymerization of silane and the PP chain degradation, polynomial models were attempted to describe this process

Le but de cette thèse est de proposer des méthodes générales afin de contourner l’intractabilité de problèmes d’optimisation multi-objectifs.Dans un premier temps, nous essayons d’apprécier la portée de cette intractabilité en déterminant une borne supérieure, facilement calculable, sur le nombre de points non dominés, connaissant le nombre de valeurs prises par chaque critère.Nous nous attachons ensuite à produire des représentations discrètes et tractables de l’ensemble des points non dominés de toute instance de problèmes d’optimisation multi-objectifs. Ces représentations doivent satisfaire des conditions de couverture, i.e. fournir une bonne approximation, de cardinalité, i.e. ne pas contenir trop de points, et si possible de stabilité, i.e. ne pas contenir de redondances. En s’inspirant de travaux visant à produire des ensembles ε-Pareto de petite taille, nous proposons tout d’abord une extension directe de ces travaux, puis nous axons notre recherche sur des ensembles ε-Pareto satisfaisant une condition supplémentaire de stabilité. Formellement, nous considérons des ensembles ε-Pareto particuliers, appelés (ε, ε′)-noyaux, qui satisfont une propriété de stabilité liée à ε′. Nous établissons des résultats généraux sur les (ε, ε′)-noyaux puis nous proposons des algorithmes polynomiaux qui produisent des (ε, ε′)-noyaux de petite taille pour le cas bi-objectif et nous donnons des résultats négatifs pour plus de deux objectifs. / The goal of this thesis is to propose new general methods to get around the intractability of multi-objective optimization problems.First, we try to give some insight on this intractability by determining an, easily computable, upper bound on the number of nondominated points, knowing the number of values taken on each criterion. Then, we are interested in producingsome discrete and tractable representations of the set of nondominated points for each instance of multi-objective optimization problems. These representations must satisfy some conditions of coverage, i.e. providing a good approximation, cardinality, i.e. it does not contain too many points, and if possible spacing, i.e. it does not include any redundancies. Starting from works aiming to produce ε-Pareto sets of small size, we first propose a direct extension of these works then we focus our research on ε-Pareto sets satisfying an additional condition of stability. Formally, we consider special ε-Pareto sets, called (ε, ε′)-kernels, which satisfy a property of stability related to ε′. We give some general results on (ε, ε′)-kernels and propose some polynomial time algorithms that produce small (ε, ε′)-kernels for the bicriteria case and we give some negative results for the tricriteria case and beyond.

La présente thèse porte sur l'étude de prise de décisions séquentielles multi-Objectif (MOSDM). La motivation de ce travail est double. D'un côté, la prise de décision, par exemple, dans les domaines de robotique et de planification, concerne l'optimisation séquentielle. De l'autre côté, nombreuses applications dans le monde réel sont plus naturellement formulés en termes d'optimisation multi-Objectif (MOO). La méthode proposée dans la thèse adapte le cadre bien connue de recherche Monte-Carlo arborescente (MCTS) à l'optimisation multi-Objectif, dans lequel multiple séquences de décision optimales sont développées dans un seul arbre de recherche. Le principal défi est de proposer une nouvelle récompense, capable de guider l'exploration de l'arbre bien que le problème de MOO n'applique pas un ordre total entre les solutions. La contribution principale de cette thèse est de proposer et d'étudier expérimentalement ces deux récompenses : l'indicateur de hypervolume et la récompense de dominance Pareto, qui sont inspirées de la littérature de MOO et basés sur une archive de solutions antérieures (archives Pareto). L'étude montre la complémentarité de ces deux récompenses. L'indicateur de hypervolume souffre de sa complexité algorithmique. Cependant, cet indicateur fournit des informations à grains fins de la qualité des solutions à l'égard de l'archive actuelle. Bien au contraire, la complexité de la récompense de dominance Pareto est linéaire, mais cette récompense fournit des informations de plus en plus rare au long de la recherche. Les preuves de principe de l'approche sont donnés sur les problèmes articiaux et les défis internationaux, et confirment la valeur de l'approche. En particulier, MOMCTS est capable de découvrir les politiques se trouvant dans les régions non-Convexes du front Pareto, qui contraste avec l'état de l'art: les algorithmes d'apprentissage par renforcement multi-Objectif existants sont basés sur scalarization linéaire et donc ne sont pas capables de explorer ces régions non-Convexes. Enfin, MOMCTS a fait honorablement la concurrence avec l'état de l'art sur la compétition internationale de MOPTSP 2013. / This thesis is concerned with multi-Objective sequential decision making (MOSDM). The motivation is twofold. On the one hand, many decision problems in the domains of e.g., robotics, scheduling or games, involve the optimization of sequences of decisions. On the other hand, many real-World applications are most naturally formulated in terms of multi-Objective optimization (MOO). The proposed approach extends the well-Known Monte-Carlo tree search (MCTS) framework to the MOO setting, with the goal of discovering several optimal sequences of decisions through growing a single search tree. The main challenge is to propose a new reward, able to guide the exploration of the tree although the MOO setting does not enforce a total order among solutions. The main contribution of the thesis is to propose and experimentally study two such rewards, inspired from the MOO literature and assessing a solution with respect to the archive of previous solutions (Pareto archive): the hypervolume indicator and the Pareto dominance reward. The study shows the complementarity of these two criteria. The hypervolume indicator suffers from its known computational complexity; however the proposed extension thereof provides fine-Grained information about the quality of solutions with respect to the current archive. Quite the contrary, the Pareto-Dominance reward is linear but it provides increasingly rare information. Proofs of principle of the approach are given on artificial problems and challenges, and confirm the merits of the approach. In particular, MOMCTS is able to discover policies lying in non-Convex regions of the Pareto front, contrasting with the state of the art: existing Multi-Objective Reinforcement Learning algorithms are based on linear scalarization and thus fail to sample such non-Convex regions. Finally MOMCTS honorably competes with the state of the art on the 2013 MOPTSP competition.

There are manufacturing systems all over the world and all of them present dif- ferent characteristics. To get close to those manufacturing systems and aid them to analyze data and improve their efficiency, it arises FACTS Analyzer®. The present project concerns the development of a bottleneck analysis using REVERSE- SCORE (Simulation based COnstraint REmoval), feature included in FACTS Ana- lyzer. It is used Simulation-based Multi-Objective Optimization (SMO) to ana- lyze the different variables of a production line and investigate how to best extend previous application of SMO for bottleneck detection to not only consider im- provements of system parameters but also degradations of them. Degrading some system parameters can have many hidden advantages such as reduce power con- sumption, increase material efficiency or lengthen the useful life of the machines or tools, advantages that can draw near sustainability.

Neste trabalho foram desenvolvidas duas técnicas de sintonia para controladores preditivos por modelo. Ambas visam minimizar a soma do erro quadrático entre respostas do sistema em malha fechada e trajetórias de referência pré-definidas; a primeira resolve um problema de otimização lexicográfica enquanto a segunda resolve um problema de otimização de compromisso. As vantagens dos métodos apresentados são: maior automatização, definição de objetivos de sintonia intuitiva que considera especificações na dinâmica do processo, uma métrica no domínio do tempo e é capaz de incluir o conhecimento do engenheiro de controle em uma técnica de sintonia confiável. Um estudo de caso no sistema de craqueamento catalítico ilustrou a flexibilidade de definição dos objetivos da técnica lexicográfica. Um estudo de caso sobre uma coluna de fracionadora de óleo pesado em malha fechada com um controlador preditivo por modelo comparou ambas as estratégias de sintonia desenvolvidas aqui e pode-se concluir que a técnica lexicográfica dá prioridade aos objetivos importantes enquanto a técnica de compromisso calcula uma solução média, com respeito aos objetivos. A técnica de compromisso foi comparada a um método de sintonia da literatura quanto a aplicação em um controlador preditivo de horizonte infinito com targets para as entradas e controle por faixas das saídas com uma coluna de destilação. Observou-se que a técnica desenvolvida aqui é computacionalmente mais rápida e não requer a escolha de uma solução não-dominada dentre um conjunto de soluções de Pareto. Aplicações reais de controle preditivo são severamente afetadas por incerteza de modelo. Estendeu-se as técnicas desenvolvidas aqui para considerar o caso de incerteza multi-planta, calculando parâmetros de sintonia robustos para controladores nominais, visando tratar o compromisso entre performance e estabilidade e robustez da malha fechada. Um controlador preditivo de horizonte infinito foi sintonizado de forma robusta e comparado com um controlador preditivo robusto em malha fechada com um modelo de separadora C3/C4. Observou-se que este consegue controlar melhor o processo, entretanto, tem um tempo de computação duas ordens de grandeza maior que o controlador nominal, em operação on-line. / Two multi-objective optimization based tuning techniques for Model Predictive Control (MPC) were developed. Both take into account the sum of the squared errors between closed-loop trajectories and reference responses based on pre-defined goals as tuning objectives; one solves a lexicographic optimization to obtain an optimum set of tuning parameters (LTT), whereas the other solves a compromise optimization problem (CTT). The main advantages are an automated framework, and straightforward goal definition, which are capable of taking into account a specification on the process dynamics, a time-domain metrics, and of embedding the control engineers knowledge into a reliable approach. A fluid catalytic cracking tuning case study unveiled the goal definition flexibility of the LTT, with respect to output tracking and variable coupling. A heavy oil fractionator in closed-loop with a MPC case study compared both tuning techniques developed here, and it was observed that the LTT in fact prioritizes the main objectives, whereas the CTT yields an average solution, in terms of the tuning objectives. The CTT was compared to another multi-objective tuning technique from the literature, in the tuning of a MPC with input targets and output zone control in closed-loop with a crude distillation unit model. The simulation results showed that the CTT allows for faster results, regarding the computational time to compute the tuning parameters and there is no need of a posteriori decisions to select the best non-dominated solution. Real MPC applications are strongly hindered by model uncertainty. This limitation was addressed by the extension of the tuning techniques to account for multi-plant model uncertainty, thus obtaining optimum robustly tuned parameters for nominal controllers, addressing the trade-off between robustness and performance. A robustly tuned Infinite Horizon MPC (IHMPC) was compared to a Robust IHMPC, in closed-loop with a C3/C4 splitter system model. It was observed in a simulation that even though the latter yields better output responses, it is two orders of magnitude slower than the former in online operation.

The problem of designing control systems for entire plants is studied. A review of previous works, available techniques and current research challenges is presented, followed by the description of some theoretical tools to improve plantwide control, including the proposal of an augmented lexicographic multi-objective optimization procedure. With these, an augmented hierarchical plantwide control design technique and an optimal multi-objective technique for integrated control structure selection and controller tuning are proposed. The main contributions of these proposed techniques are the inclusion of system identification and optimal control tuning as part of the plantwide design procedure for improved results, support to multi-objective control specifications and support to any type of plant and controllers. Finally, the proposed techniques are applied to industrial benchmarks to demonstrate and validate its applicability. / O problema de projetar sistemas de controle para plantas inteiras é estudado. Uma revisão de trabalhos anteriores, técnicas disponíveis e atuais desafios de pesquisa é apresentada, seguida da descrição de algumas ferramentas teóricas para melhorar o controle plantwide, incluindo a proposta de um procedimento de otimização multi-objetivo lexicográfico aumentado. Com tais elementos, são propostas uma nova técnica hierárquica aumentada de projeto de sistemas de controle plantwide e uma técnica multi-objetivo para seleção de estrutura de controlador integrada à sintonia ótima do controlador. As principais contribuições das técnicas propostas são a inclusão de identificação de sistemas e sintonia ótima de controladores como parte do procedimento de projeto de controle plantwide para melhores resultados, suporte a especificações multi-objetivo e suporte a quaisquer tipos de plantas e controladores. Finalmente, as técnicas propostas são aplicadas a benchmarks industriais para demonstrar e validar sua aplicabilidade.

O presente trabalho otimizou os parâmetros concentrados do sistema de suspensão de um modelo de veículo completo, representando um automóvel de passeio que trafega a uma velocidade constante por um determinado perfil de pista previsto na norma ISO 8608, 1995, através da utilização de um algoritmo meta-heurístico de otimização multiobjetivo. Duas rotinas numérico-computacionais foram desenvolvidas, visando realizar tal otimização tanto no domínio do tempo quanto no domínio da frequência. A utilização de algoritmos meta-heurísticos vem ganhando espaço na otimização de sistemas mecânicos, proporcionando rapidez e precisão na obtenção de resultados ótimos. Ao se combinar um algoritmo de otimização a um modelo que represente satisfatoriamente um sistema mecânico, obtém-se uma ferramenta indicadora dos parâmetros de máxima eficiência do sistema, que pode ser utilizada em inúmeras aplicações. Pretendeu-se, com a integração de rotinas de análise dinâmica nos domínios do tempo e da frequência ao algoritmo genético de otimização multiobjetivo NSGA-II, desenvolvido por Deb et al., 2002, a obtenção de duas fronteiras ótimas de Pareto. Estas fronteiras consistem no conjunto de soluções não dominadas que minimizam as seguintes funções objetivo: o valor RMS ponderado da aceleração vertical do assento do motorista, o valor RMS da média do fator de amplificação dinâmica das quatro rodas do modelo e o máximo deslocamento relativo entre cada roda e a carroceria. O método proposto por Shinozuka e Jan, 1972, é utilizado para a obtenção do perfil de irregularidades da pista no domínio do tempo a partir das equações de densidade espectral de potência (PSD) que representam as diferentes classes de pavimentos. O método de Newmark, 1959, é utilizado para resolver a equação diferencial de movimento no domínio do tempo e obter a resposta dinâmica do modelo a tais irregularidades. O comportamento dinâmico do modelo de veículo no domínio da frequência foi obtido através da utilização da função de resposta em frequência (FRF) do modelo de veículo analisado. Os resultados demonstraram a capacidade de ambas as rotinas de análise dinâmica desenvolvidas de produzir resultados consistentes com os encontrados na literatura, bem como a capacidade dos algoritmos de otimização implementados de fornecer fronteiras ótimas de Pareto para os problemas propostos. / The proposed work optimized the concentrated parameters of a full-vehicle model’s suspension system, being that model representative of a passenger car which travels at a constant speed on a certain road profile provided by the ISO 8608, 1995, standard, using a multi-objective meta-heuristic optimization algorithm. Two numerical-computational routines were developed, seeking to perform said optimization for both the time and frequency domains. The use of meta-heuristic algorithms has been increasing in mechanical systems optimization, providing speed and accuracy in obtaining an optimal result. Combining an optimization algorithm with a model that satisfactorily represents a mechanical system yields a tool that indicates the system’s maximum efficiency parameters, which can be used in numerous applications. It was intended, with the integration of the dynamic analysis routines to the multi-objective genetic optimization algorithm NSGA-II, developed by Deb et al., 2002, the obtainment of two Pareto-optimal fronts. These fronts consist in the set of non-dominated solutions that minimize the following objective functions: the weighted RMS value of the driver’s seat vertical acceleration, the mean RMS value of the model wheel’s dynamic amplification factor, and the maximum relative displacement between each wheel and the body of the vehicle model. The method proposed by Shinozuka and Jan, 1972, is used to obtain the road irregularity profile in the time domain from the power spectral density (PSD) equations that represent the different pavement classes. The Newmark’s method (1959) is used to solve the differential motion equation in the time domain, in order to obtain the vehicle model’s responses to these irregularities. The dynamic behavior of the vehicle model in the frequency domain was obtained through the use of the frequency response function (FRF) of the analyzed model. The results showed the capacity of both the dynamic analysis routines developed in generating results that are consistent with those found in literature, as well as the capacity of the optimization algorithms implemented in providing Pareto optimal fronts to the proposed problems.