L'autopartage est un service de mobilité qui offre les mêmes avantages que les voitures particulières mais sansnotion de propriété. Les clients du système peuvent accéder aux véhicules sans ou avec réservation préalable. Laflotte de voitures est distribuée entre les stations et les clients peuvent prendre une voiture d'une station et ladéposer dans n'importe quelle autre station (one-way), chaque station disposant d'un nombre maximum de placesde stationnement. La demande pour la prise ou le retour des voitures dans chaque station est souvent asymétriqueentre les stations et varie au cours de la journée. Par conséquent, certaines stations accumulent des voitures etatteignent leur capacité maximale prévenant alors de nouvelles voitures de trouver une place de stationnement.Dans le même temps, des stations se vident et conduisent au rejet de la demande de retrait de clients. Notre travailporte sur l'optimisation des opérations de redéploiement de voitures afin de redistribuer efficacement les voitures surles stations suivant la demande qui varie en fonction du temps et de l'espace. Dans les systèmes d'autopartage àsens unique, le problème du redéploiement de voitures sur les stations est techniquement plus difficile que leproblème de la redistribution des vélos dans les systèmes de vélopartage. Dans ce dernier, on peut utiliser uncamion pour déplacer plusieurs vélos en même temps, alors que nous ne pouvons pas le faire dans le systèmeautopartage en raison de la taille des voitures et de la difficulté de chargement et de déchargement. Ces opérationsaugmentent le coût de fonctionnement du système d'autopartage sur l'opérateur. De ce fait, l'optimisation de cesopérations est essentielle afin de réduire leur coût. Dans cette thèse, nous développons un modèle deprogrammation linéaire en nombre entier pour ce problème. Ensuite, nous présentons trois politiques différentes deredéploiement de voitures que nous mettons en oeuvre dans des algorithmes de recherche gloutonne et nousmontrons que les opérations de redéploiement qui ne considèrent pas les futures demandes ne sont pas efficacesdans la réduction du nombre de demandes rejetées. Les solutions fournies par notre algorithme glouton sontperformantes en temps d'exécution (moins d'une seconde) et en qualité en comparaison avec les solutions fourniespar CPLEX. L'évaluation de la robustesse des deux approches présentées par l'ajout d'un bruit stochastique sur lesdonnées d'entrée montre qu'elles sont très dépendantes des données même avec l'adoption de valeur de seuil deredéploiement. En parallèle à ce travail algorithmique, l'analyse de variance (ANOVA) et des méthodes derégression multilinéaires ont été appliqués sur l'ensemble de données utilisées pour construire un modèle global afind'estimer le nombre de demandes rejetées. Enfin, nous avons développé et comparé deux algorithmesévolutionnaires multicritères pour prendre en compte l'indécision sur les objectifs de l'optimisation, NSGA-II et unalgorithme mémétique qui a montré une bonne performance pour résoudre ce problème. / To buy it. Users can have access to vehicles on the go with or without reservation. Each station has a maximumnumber of parking places. In one-way carsharing system, users can pick up a car from a station and drop it in anyother station. The number of available cars in each station will vary based on the departure and the arrival of cars oneach station at each time of the day. The demand for taking or returning cars in each station is often asymmetric andis fluctuating during the day. Therefore, some stations will accumulate cars and will reach their maximum capacitypreventing new arriving cars from finding a parking place, while other stations will become empty which lead to therejection of new users demand to take a car. Users expect that cars are always available in stations when they needit, and they expect to find a free parking place at the destination station when they want to return the rented car aswell. However, maintaining this level of service is not an easy task. For this sake, carsharing operators recruitemployees to relocate cars between the stations in order to satisfy the users' demands.Our work concerns the optimization of the car relocation operations in order to efficiently redistribute the cars overthe stations with regard to user demands, which are time and space dependent. In one-way carsharing systems, therelocation problem is technically more difficult than the relocation problem in bikesharing systems. In the latter, wecan use trucks to move several bikes at the same time, while we cannot do this in carsharing system because of thesize of cars and the difficulty of loading and unloading cars. These operations increase the cost of operating thecarsharing system.As a result, optimizing these operations is crucial in order to reduce the cost of the operator. In this thesis, we modelthis problem as an Integer Linear Programming model. Then we present three different car relocation policies thatwe implement in a greedy search algorithm. The comparison between the three policies shows that car relocationoperations that do not consider future demands are not effective in reducing the number of rejected demands.Results prove that solutions provided by our greedy algorithm when using a good policy, are competitive withCPLEX solutions. Furthermore, adding stochastic modification on the input data proves that the robustness of thetwo presented approaches to solve the relocation problem is highly dependent on the input demand even afteradding threshold values constraints. After that, the analysis of variance (ANOVA) and the multi-linear regressionmethods were applied on the used dataset in order to build a global model to estimate the number of rejecteddemands. Finally, we developed and compared two multi-objectives evolutionary algorithms to deal with thedecisional aspect of the car relocation problem using NSGA-II and memetic algorithms.

Cette thèse est dédiée à la pré-calibration des nouveaux systèmes d’aides à la conduite (ADAS). Le développement de ces systèmes est devenu aujourd’hui un axe de recherche stratégique pour les constructeurs automobiles dans le but de proposer des véhicules plus sûrs et moins énergivores. Cette thèse contribue à une vision méthodologique multi-critère, multi-modèle et multi-scénario. Elle en propose une instanciation particulière pour la pré-calibration spécifique au Lane Centering Assistance (LCA). Elle s’appuie sur des modèles dynamiques de complexité juste nécessaire du véhicule et de son environnement pour, dans le cadre du formalisme H2/H∞, formaliser et arbitrer les compromis entre performance de suivi de voie, confort des passagers et robustesse. Les critères élaborés sont définis de manière à être d’interprétation aisée, car directement liés à la physique, et facilement calculables. Ils s’appuient sur des modèles de perturbations exogènes (e.g. courbure de la route ou rafale de vent) et de véhicules multiples mais représentatifs, de manière à réduire autant que possible le pessimisme tout en embrassant l’ensemble des situations réalistes. Des simulations et des essais sur véhicules démontrent l’intérêt de l’approche. / This thesis deals with the tuning of the new Advanced Driving Assistance Systems (ADAS). The development of these systems has become nowadays a strategic line of research for the automotive industry towards the conception of safer and fuel-efficient vehicles.This thesis contributes to a multi-criterion, multi-modeland multi-scenario methodological vision of the tuning process. It is presented through a specific application of the tuning of the Lane Centering Assistance (LCA). It relies on vehicle and environment’s dynamical models of adequate complexity in the aim of formalizing and managing, in a H2/H∞ framework, the trade-off between performance, comfort and robustness. The formulated criteria are easy to compute and defined in a way to be understandable, closely linked to practical specifications. The whole methodology is driven by the research of a pertinent trade-off between realism (being as closest as possible to reality) and complexity (quick evaluation of the criterion). The efficiency and the robustness of the approach is demonstrated through high-fidelity simulations and numerous tests on real vehicles.

A characteristic challenge of software development is the management of omnipresent change. Classically, this constant change is driven by customers changing their requirements. The wish to optimally leverage available resources opens another source of change: the software systems environment. Software is tailored to specific platforms (e.g., hardware architectures) resulting in many variants of the same software optimized for different environments. If the environment changes, a different variant is to be used, i.e., the system has to reconfigure to the variant optimized for the arisen situation. The automation of such adjustments is subject to the research community of self-adaptive systems. The basic principle is a control loop, as known from control theory. The system (and environment) is continuously monitored, the collected data is analyzed and decisions for or against a reconfiguration are computed and realized. Central problems in this field, which are addressed in this thesis, are the management of interdependencies between non-functional properties of the system, the handling of multiple criteria subject to decision making and the scalability. In this thesis, a novel approach to self-adaptive software--Multi-Quality Auto-Tuning (MQuAT)--is presented, which provides design and operation principles for software systems which automatically provide the best possible utility to the user while producing the least possible cost. For this purpose, a component model has been developed, enabling the software developer to design and implement self-optimizing software systems in a model-driven way. This component model allows for the specification of the structure as well as the behavior of the system and is capable of covering the runtime state of the system. The notion of quality contracts is utilized to cover the non-functional behavior and, especially, the dependencies between non-functional properties of the system. At runtime the component model covers the runtime state of the system. This runtime model is used in combination with the contracts to generate optimization problems in different formalisms (Integer Linear Programming (ILP), Pseudo-Boolean Optimization (PBO), Ant Colony Optimization (ACO) and Multi-Objective Integer Linear Programming (MOILP)). Standard solvers are applied to derive solutions to these problems, which represent reconfiguration decisions, if the identified configuration differs from the current. Each approach is empirically evaluated in terms of its scalability showing the feasibility of all approaches, except for ACO, the superiority of ILP over PBO and the limits of all approaches: 100 component types for ILP, 30 for PBO, 10 for ACO and 30 for 2-objective MOILP. In presence of more than two objective functions the MOILP approach is shown to be infeasible.

The main area of emphasis in this study is to investigate the methods and technology for aerodynamic configuration sizing of missiles and to develop a software platform in MATLAB&reg / environment as a design tool which has an ability of optimizing the external configuration of missiles for a set of flight requirements specified by the user through a graphical user interface. A genetic algorithm based optimization tool is prepared by MATLAB is expected to help the designer to find out the best external geometry candidates in the conceptual design stage. Missile DATCOM software package is employed to predict the aerodynamic coefficients needed in finding the performance merits of a missile for each external geometry candidate by integrating its dynamic equations of motion. Numerous external geometry candidates are rapidly eliminated according to objectives and constraints specified by designers, which provide necessary information in preliminary design. In this elimination, the external geometry candidates are graded according to their flight performances in order to discover an optimum solution. In the conceptual design, the most important performance objectives related to the external geometry of a missile are range, speed, maneuverability, and control effectiveness. These objectives are directly related to the equations of motion of the missile, concluding that the speed and flight range are related to the total mass and the drag-to-lift ratio acting on missile. Also, maneuverability depends on the normal force acting on missile body and mass whereas the control effectiveness is affected by pitching moment and mass moment of inertia of missile. All of the flight performance data are obtained by running a two degree-of-freedom simulation. In order to solve the resulting multi-objective optimization problem with a set of constraint of linear and nonlinear nature and in equality and inequality forms, genetic-algorithm-based methods are applied. Hybrid encoding methods in which the integer configuration variables (i.e., nose shape and control type) and real-valued geometrical dimension (i.e., diameter, length) parameters are encoded in the same individual chromosome. An external configuration design tool (EXCON) is developed as a synthesis and external sizing tool for the subsonic cruise missiles. A graphical user interface (GUI), a flight simulator and optimization modules are embedded into the tool. A numerical example, the re-configuration problem of an anti-ship cruise missile Harpoon, is presented to demonstrate the accuracy and feasibility of the conceptual design tool. The optimum external geometries found for different penalty weights of penalty terms in the cost function are compared according to their constraint violations and launch mass values. By means of using EXCON, the launch mass original baseline Harpoon is reduced by approximately 30% without deteriorating the other flight performance characteristics of the original Harpoon.

Finding the true nondominated points is typically hard for Multi-objective Combinatorial Optimization (MOCO) problems. Furthermore, it is not practical to generate all of them since the number of nondominated points may grow exponentially as the problem size increases. In this thesis, we develop an exact algorithm to find all nondominated points in a specified region. We combine this exact algorithm with a heuristic algorithm that approximates the possible locations of the nondominated points. Interacting with a decision maker (DM), the heuristic algorithm first approximately identifies the region that is of interest to the DM. Then, the exact algorithm is employed to generate all true nondominated points in this region. We conduct experiments on Multi-objective Assignment Problems (MOAP), Multi-objective Knapsack Problems (MOKP) and Multi-objective Shortest Path (MOSP) Problems / and the algorithms work well. Finding the worst possible value for each criterion among the set of efficient solutions has important uses in multi-criteria problems since the proper scaling of each criterion is required by many approaches. Such points are called nadir points. v It is not straightforward to find the nadir points, especially for large problems with more than two criteria. We develop an exact algorithm to find the nadir values for multi-objective integer programming problems. We also find bounds with performance guarantees. We demonstrate that our algorithms work well in our experiments on MOAP, MOKP and MOSP problems. Assuming that the DM&#039 / s preferences are consistent with a quasiconcave value function, we develop an interactive exact algorithm to solve MIP problems. Based on the convex cones derived from pairwise comparisons of the DM, we generate constraints to prevent points in the implied inferior regions. We guarantee finding the most preferred point and our computational experiments on MOAP, MOKP and MOSP problems show that a reasonable number of pairwise comparisons are required.

The primary goal for the conceptual design phase of a generic air-to-ground missile is to reach an optimal external configuration which satisfies the flight performance requirements such as flight range and time, launch mass, stability, control effectiveness as well as geometric constraints imposed by the designer. This activity is quite laborious and requires the examination and selection among huge numbers of design alternatives. This thesis is mainly focused on multi objective optimization techniques for an air to-ground missile design by using heuristics methods namely as Non Dominated Sorting Genetic Algorithm and Multiple Cooling Multi Objective Simulated Annealing Algorithm. Futhermore, a new hybrid algorithm is also introduced using Simulated Annealing cascaded with the Genetic Algorithm in which the optimized solutions are passed to the Genetic Algorithm as the intial population. A trade off study is conducted for the three optimization algorithm alternatives in terms of accuracy and quality metrics of the optimized Pareto fronts.

Cooperation in self-organized heterogeneous swarms is a phenomenon from nature with many applications in autonomous robots. I specifically analyzed the problem of auto-regulated team formation in multi-agent systems and several strategies to learn socially how to make multi-objective decisions. To this end I proposed new multi-objective ranking relations and analyzed their properties theoretically and within multi-objective metaheuristics. The results showed that simple decision mechanism suffice to build effective teams of heterogeneous agents and that diversity in groups is not a problem but can increase the efficiency of multi-agent systems.

The ability to design the rational structure in short terms is obvious economical demand hence the engineer must have at his disposal the methodology of optimization of such structures. Grillage structures are widely used in engineering practice, e. g. in construction of so-called grillage-type foundations (further grillages). Nowadays the good-performing optimization algorithms for topology optimization of grillages – separately investigating each beam in the grillage – are elaborated therefore the main attention of this work is devoted to the simultaneous topology and size optimization of grillages, which is obviously insufficiently explored so far. The optimal grillage should meet twofold criteria: the number of piles should be minimal, and the connecting beams should receive minimal feasible bending moments what leads to minimal consumption of concrete for beams. Obviously two separate optimization problems are considered here: determination of minimal number of piles and determination of minimal volume of beams. Whereas the carrying capacity of a single pile is known, the first optimization problem can be rendered as minimization of the maximal reactive force in piles among all set of piles. Analogously, the second problem corresponds to the minimization of the maximal bending moments in connecting beams. The bending moments depend also on stiffness of beams hence the cross-sectional dimensions of beams must be identified simultaneously. Both problems can be incorporated... [to full text] / Sijynų optimizavimo rezultatai turi didelę reikšmę ekonominiu požiūriu, nes ypatingai svarbu gebėti greitai suprojektuoti pigią ir tuo pačiu racionalią bei patvarią konstrukciją. Todėl inžineriniu požiūriu šios problemos sprendimo rezultatai turi didelę reikšmę kuriant efektyvią sijynų optimizavimo technologiją. Sijynai – sudaryti iš polių ir jungiančiųjų sijų – yra labai efektyvios ir paplitusios polinių pamatų inžinerinės konstrukcijos. Šiame darbe dėmesys bus skiriamas iki šiol dar nepakankamai išnagrinėtam sijynų topologijos ir matmenų sinchroniniam optimizavimui. Šioje disertacijoje topologijos optimizavimas suprantamas kaip optimalios polių išdėstymo po jungiančiosiomis sijomis schemos ieškojimas esant duotam polių skaičiui, o matmenų optimizavimas – kaip jungiančiųjų sijų skerspjūvio optimalių matmenų ieškojimas, laikant, kad visų sijų skerspjūvis vienodas. Darbe bus bandoma apjungti topologijos ir matmenų optimizavimą į vieną algoritmo žingsnį, tuo padidinant tikimybę gauti geresnį optimizavimo sprendinį. Ši problema yra daugiakriterio globalaus optimizavimo uždavinys. Iki šiol tokie didelės apimties uždaviniai nėra iki galo išspręsti, nes jie yra pakankamai sudėtingi: tenka optimizuoti nuo didelio projektavimo kintamųjų skaičiaus priklausančią kompromisinę tikslo funkciją. Apytikriai galima laikyti, kad sijynai, kurie turi mažiausią įmanomą polių skaičių bei kurių jungiančiosios sijos yra mažiausio skerspjūvio, yra pigiausi. Matematiniu požiūriu tokių sijynų... [toliau žr. visą tekstą]

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.

Σε αυτήν την εργασία, παρουσιάζουμε τις βασικότερες κλασικές προσεγγίσεις επίλυσης Πολυ-αντικειμενικών Προβλημάτων Βελτιστοποίησης(ΠΠΒ)καθώς και ένα από τα πιο δημοφιλή λογισμικά για επίλυση ΠΠΒ, το NIMBUS. Συγκεκριμένα, δίνουμε τον ορισμό ενός ΠΠΒ, το θεωρητικό υπόβαθρο -- για την καλύτερη κατανόηση των μεθόδων που θα ακολουθήσουν - και τις διαφορές των ΠΠΒ με τα κλασσικά Μονο-αντικειμενικά προβλήματα Βελτιστοποίησης. Επιπλέον, παρουσιάζουμε τις τρεις κύριες κατηγορίες προσέγγισης των ΠΠΒ (μη-αλληλεπιδραστικές, αλληλεπιδραστικές, εξελικτικές) ο διαχωρισμός των οποίων γίνεται ανάλογα με την άμεση ή έμμεση εμπλοκή του Λήπτη Απόφασης. Η μελέτη μας εστιάζεται κυρίως στην κατηγορία των μη-αλληλεπιδραστικών προσεγγίσεων, στην οποία ο ΛΑ εμπλέκεται έμμεσα. Τέλος, ολοκληρώνουμε την μελέτη μας με την αναλυτική παρουσίαση της επίλυσης ενός ΠΠB με την χρήση του λογισμικού NIMBUS. / In this contribution, we study the classical approaches for solving Multi-objective Optimization Problems (MOOP) as well as one of the most popular software that solves MOOP, namely NIMBUS. More specifically, we present the definition and the theoretical background around MOOP and we discuss the differences between MOOP and the classical single-objective optimization problems. We also present the three main categories of approaches of solving MOOP (non-interactive, interactive, evolutionary) that are characterized by the way the Decision Maker participates in the solution. We focus on the first category by analyzing each of the non-interactive approaches. Finally, we conclude by presenting an analytic illustration of an example that solves a MOOP using the NIMBUS software.