A Multi-objective Evolutionary Algorithm to solve Complex Optimization Problems

Multi-objective optimization problem formulations reflect pragmatic modeling of several real-life complex optimization problems. In many of them the considered objectives are competitive with each other; emphasizing only one of them during solution generation and evolution incurs high probability of producing a one-sided solution, which is unacceptable with respect to other objectives. An appropriate solution to the multi-objective optimization problem is to investigate a set of solutions that satisfy all of the competing objectives to an acceptable extent, where no solution in the solution set is dominated by others in terms of objective optimization. In this work, we investigate well known Non-dominated Sorting Genetic Algorithm (NSGA-II), and Strength Pareto Evolutionary Algorithm (SPEA-II), to find Pareto optimal solutions for two real-life problems: Task-based Sailor Assignment Problem (TSAP) and Coverage and Lifetime Optimization Problem in Wireless Sensor Networks (CLOP). Both of these problems are multi-objective problems. TSAP constitutes five multi-directional objectives, whereas CLOP is composed of two competing objectives. To validate the special operators developed, these two test bed problems have been used. Finally, traditional NSGA-II and SPEA-II have been blended with these special operators to generate refined solutions of these multi-objective optimization problems

Decision-Making for Well Placement Optimization in Oil Field Development

Well placement is a method to improve oil recovery by drilling new infill wells in a reservoir. Drilling new wells is a critical yet very challenging task in field development, because the optimal well locations are rarely known and difficult to decide in practice due to complex reservoir and depletion situations. This dissertation focuses on the development of mathematical optimization techniques to assist decision-making for well planning and placement. The following topics are included in this dissertation. 1. To study and develop two stochastic approximated gradient-based approaches: the ensemble based optimization method (EnOpt) and the fixed-gain simultaneous perturbation stochastic approximation (FSP) for well placement; Evaluate the performance and effectiveness of these two methods on case studies. 2. To develop an efficient method to decide optimal number of wells and the corresponding locations, evaluate the performance on study cases. 3. To handle geological uncertainty and decision-making risk, propose a new workflow for multi-objective well placement optimization. 4. To ensure an efficient decision-making and a fast turnaround time, the use of engineering prior knowledge and a few acceleration routines are discussed in the context of optimization. All approaches are evaluated on synthetic reservoir models, some are performed on real field-like cases. This dissertation provides various optimization methods with an enhanced capability of addressing geological uncertainty for well placement in oilfield development. However, it should also be noted that while the techniques proposed in this dissertation are applicable to a diverse set of reservoirs with no known limitations, the additional value of this dissertation lies in its ability to address well placement needs for highly complex reservoirs. For reservoirs that lack the complexity seen, for example, in deepwater basins, conventional well placement methods may be sufficient

Cooperation in self-organized heterogeneous swarms

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

Unveiling Hidden Values of Optimization Models with Metaheuristic Approach

Considering that the decision making process for constrained optimization problem is based on modeling, there is always room for alternative solutions because there is usually a gap between the model and the real problem it depicts. This study looks into the problem of finding such alternative solutions, the non-optimal solutions of interest for constrained optimization models, the SoI problem. SoI problems subsume finding feasible solutions of interest (FoIs) and infeasible solutions of interest (IoIs). In all cases, the interest addressed is post-solution analysis in one form or another. Post-solution analysis of a constrained optimization model occurs after the model has been solved and a good or optimal solution for it has been found. At this point, sensitivity analysis and other questions of import for decision making come into play and for this purpose the SoIs can be very valuable. An evolutionary computation approach (in particular, a population-based metaheuristic) is proposed for solving the SoI problem and a systematic approach with a feasible-infeasible- two-population genetic algorithm is demonstrated. In this study, the effectiveness of the proposed approach on finding SoIs is demonstrated with generalized assignment problems and generalized quadratic assignment problems. Also, the applications of the proposed approach on the multi-objective optimization and robust-optimization issues are examined and illustrated with two-sided matching problems and flowshop scheduling problems respectively

Automatic Control and Routing of Marine Vessels

Due to the intensive development of the global economy, many problems are constantly emerging connected to the safety of ships’ motion in the context of increasing marine traffic. These problems seem to be especially significant for the further development of marine transportation services, with the need to considerably increase their efficiency and reliability. One of the most commonly used approaches to ensuring safety and efficiency is the wide implementation of various automated systems for guidance and control, including such popular systems as marine autopilots, dynamic positioning systems, speed control systems, automatic routing installations, etc. This Special Issue focuses on various problems related to the analysis, design, modelling, and operation of the aforementioned systems. It covers such actual problems as tracking control, path following control, ship weather routing, course keeping control, control of autonomous underwater vehicles, ship collision avoidance. These problems are investigated using methods such as neural networks, sliding mode control, genetic algorithms, L2-gain approach, optimal damping concept, fuzzy logic and others. This Special Issue is intended to present and discuss significant contemporary problems in the areas of automatic control and the routing of marine vessels

Placement de graphes de tâches de grande taille sur architectures massivement multicoeurs

This Ph.D thesis is devoted to the study of the mapping problem related to massively parallel embedded architectures. This problem arises from industrial needs like energy savings, performance demands for synchronous dataflow applications. This problem has to be solved considering three criteria: heuristics should be able to deal with applications with various sizes, they must meet the constraints of capacities of processors and they have to take into account the target architecture topologies. In this thesis, tasks are organized in communication networks, modeled as graphs. In order to determine a way of evaluating the efficiency of the developed heuristics, mappings, obtained by the heuristics, are compared to a random mapping. This comparison is used as an evaluation metric throughout this thesis. The existence of this metric is motivated by the fact that no comparative heuristics can be found in the literature at the time of writing of this thesis. In order to address this problem, two heuristics are proposed. They are able to solve a dataflow process network mapping problem, where a network of communicating tasks is placed into a set of processors with limited resource capacities, while minimizing the overall communication bandwidth between processors. They are applied on task graphs where weights of tasks and edges are unitary set. The first heuristic, denoted as Task-wise Placement, places tasks one after another using a notion of task affinities. The second algorithm, named Subgraph-wise Placement, gathers tasks in small groups then place the different groups on processors using a notion of affinities between groups and processors. These algorithms are tested on tasks graphs with grid or logic gates network topologies. Obtained results are then compared to an algorithm present in the literature. This algorithm maps task graphs with moderated size on massively parallel architectures. In addition, the random based mapping metric is used in order to evaluate results of both heuristics. Then, in a will to address problems that can be found in industrial cases, application cases are widen to tasks graphs with tasks and edges weights values similar to those that can be found in the industry. A progressive construction heuristic named Regret Based Approach, based on game theory, is proposed. This heuristic maps tasks one after another. The costs of mapping tasks according to already mapped tasks are computed. The process of task selection is based on a notion of regret, present in game theory. The task with the highest value of regret for not placing it, is pointed out and is placed in priority. In order to check the strength of the algorithm, many types of task graphs (grids, logic gates networks, series-parallel, random, sparse matrices) with various size are generated. Tasks and edges weights are randomly chosen using a bimodal law parameterized in order to have similar values than industrial applications. Obtained results are compared to the Task Wise placement, especially adapted for non-unitary values. Moreover, results are evaluated using the metric defined above.Ce travail de thèse de doctorat est dédié à l'étude d'un problème de placement de tâches dans le domaine de la compilation d'applications pour des architectures massivement parallèles. Ce problème vient en réponse à certains besoins industriels tels que l'économie d'énergie, la demande de performances pour les applications de type flots de données synchrones. Ce problème de placement doit être résolu dans le respect de trois critères: les algorithmes doivent être capable de traiter des applications de tailles variables, ils doivent répondre aux contraintes de capacités des processeurs et prendre en compte la topologie des architectures cibles. Dans cette thèse, les tâches sont organisées en réseaux de communication, modélisés sous forme de graphes. Pour évaluer la qualité des solutions produites par les algorithmes, les placements obtenus sont comparés avec un placement aléatoire. Cette comparaison sert de métrique d'évaluation des placements des différentes méthodes proposées. Afin de résoudre à ce problème, deux algorithmes de placement de réseaux de tâches de grande taille sur des architectures clusterisées de processeurs de type many-coeurs ont été développés. Ils s'appliquent dans des cas où les poids des tâches et des arêtes sont unitaires. Le premier algorithme, nommé Task-wise Placement, place les tâches une par une en se servant d'une notion d'affinité entre les tâches. Le second, intitulé Subgraph-wise Placement, rassemble les tâches en groupes puis place les groupes de tâches sur les processeurs en se servant d'une relation d'affinité entre les groupes et les tâches déjà affectées. Ces algorithmes ont été testés sur des graphes, représentants des applications, possédant des topologies de types grilles ou de réseaux de portes logiques. Les résultats des placements sont comparés avec un algorithme de placement, présent dans la littérature qui place des graphes de tailles modérée et ce à l'aide de la métrique définie précédemment. Les cas d'application des algorithmes de placement sont ensuite orientés vers des graphes dans lesquels les poids des tâches et des arêtes sont variables similairement aux valeurs qu'on peut retrouver dans des cas industriels. Une heuristique de construction progressive basée sur la théorie des jeux a été développée. Cet algorithme, nommé Regret Based Approach, place les tâches une par une. Le coût de placement de chaque tâche en fonction des autres tâches déjà placées est calculée. La phase de sélection de la tâche se base sur une notion de regret présente dans la théorie des jeux. La tâche qu'on regrettera le plus de ne pas avoir placée est déterminée et placée en priorité. Afin de vérifier la robustesse de l'algorithme, différents types de graphes de tâches (grilles, logic gate networks, series-parallèles, aléatoires, matrices creuses) de tailles variables ont été générés. Les poids des tâches et des arêtes ont été générés aléatoirement en utilisant une loi bimodale paramétrée de manière à obtenir des valeurs similaires à celles des applications industrielles. Les résultats de l'algorithme ont également été comparés avec l'algorithme Task-Wise Placement, qui a été spécialement adapté pour les valeurs non unitaires. Les résultats sont également évalués en utilisant la métrique de placement aléatoire

A Network Science Approach to Understanding and Generating Ship Arrangements in Early-Stage Design.

In recent years, automated approaches for creating ship general arrangements in early-stage design have been developed. These approaches seek to avoid “black box” implementations by keeping the designer involved in the layout generation and selection process, but they do not avoid it entirely. Existing methods first generate layouts, next evaluate each layout’s quality, and subsequently filter out poor designs in an iterative process. In addition, desires to move toward full distributed system layouts in early-stage design have only led to more highly-refined CAD-style implementations requiring extensive modeling and computation time. This dissertation asserts that there is a need to shift away from the current trajectory toward higher-fidelity three-dimensional layout models and re-vector toward a perspective that focuses on understanding and inherently respects the fundamental underlying relationships among elements within those models. The research offered in this thesis uses network science to envision the layout problem from a new perspective. In this view, design relationships are information inputs into layout-related analyses rather than only post-processors for evaluating layouts. This is consistent with existing design processes in which human designers attempt to keep relevant relationships in the back of their mind at all times to inform decisions. Network nodes represent ship compartments and edges correspond to design constraints forming a relationship network. First, network concepts of centrality and hierarchy are used to highlight and rank the embedded drivers of an early-stage arrangement prior to developing spatial layouts by directly analyzing the relationship network in a methodical and holistic manner. The obscured design intent of a notional WWII naval vessel is exposed using the hierarchical approach. Second, a network partitioning method is used to cluster shipboard elements into communities of mutually-compatible elements to minimize the degradation of other items located in the same region of the ship. These communities can form the basis of functional zone definitions. Varying the number of partitions reveals a multi-scale depiction of the relationship network. Third, the communities are assigned to structural zones based on cumulative zone preference values. Finally, two new visualization techniques help designers establish connections between the network of inter-element relationships and spatial ship arrangements.PHDNaval Architecture & Marine EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/96126/1/justinwg_1.pd