A hybrid genetic algorithm for solving a layout problem in the fashion industry.

As of this writing, many success stories exist yet of powerful genetic algorithms (GAs) in the field of constraint optimisation. In this paper, a hybrid, intelligent genetic algorithm will be developed for solving a cutting layout problem in the Belgian fashion industry. In an initial section, an existing LP formulation of the cutting problem is briefly summarised and is used in further paragraphs as the core design of our GA. Through an initial attempt of rendering the algorithm as universal as possible, it was conceived a threefold genetic enhancement had to be carried out that reduces the size of the active solution space. The GA is therefore rebuilt using intelligent genetic operators, carrying out a local optimisation and applying a heuristic feasibility operator. Powerful computational results are achieved for a variety of problem cases that outperform any existing LP model yet developed.Fashion; Industry;

Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions

The field of algorithmic self-assembly is concerned with the design and analysis of self-assembly systems from a computational perspective, that is, from the perspective of mathematical problems whose study may give insight into the natural processes through which elementary objects self-assemble into more complex ones. One of the main problems of algorithmic self-assembly is the minimum tile set problem (MTSP), which asks for a collection of types of elementary objects (called tiles) to be found for the self-assembly of an object having a pre-established shape. Such a collection is to be as concise as possible, thus minimizing supply diversity, while satisfying a set of stringent constraints having to do with the termination and other properties of the self-assembly process from its tile types. We present a study of what we think is the first practical approach to MTSP. Our study starts with the introduction of an evolutionary heuristic to tackle MTSP and includes results from extensive experimentation with the heuristic on the self-assembly of simple objects in two and three dimensions. The heuristic we introduce combines classic elements from the field of evolutionary computation with a problem-specific variant of Pareto dominance into a multi-objective approach to MTSP.Comment: Minor typos correcte

Optimal design for a NEO tracking spacecraft formation

The following paper presents the design and methodology for developing an optimal set of spacecraft orbits for a NEO tracking mission. The spacecraft is designed to fly in close formation with the asteroid, avoiding the nonlinear gravity field produced by the asteroid. A periodic orbit is developed, and the initial conditions are optimized by use of a global optimizer for constrained nonlinear problems. The asteroid Apophis (NEO 2004 MN4) was used as the case study due the potential impact with Earth in 2036, and the need for more accurate ephemerides

Adaptive Search and Constraint Optimisation in Engineering Design

The dissertation presents the investigation and development of novel adaptive computational techniques that provide a high level of performance when searching complex high-dimensional design spaces characterised by heavy non-linear constraint requirements. The objective is to develop a set of adaptive search engines that will allow the successful negotiation of such spaces to provide the design engineer with feasible high performance solutions. Constraint optimisation currently presents a major problem to the engineering designer and many attempts to utilise adaptive search techniques whilst overcoming these problems are in evidence. The most widely used method (which is also the most general) is to incorporate the constraints in the objective function and then use methods for unconstrained search. The engineer must develop and adjust an appropriate penalty function. There is no general solution to this problem neither in classical numerical optimisation nor in evolutionary computation. Some recent theoretical evidence suggests that the problem can only be solved by incorporating a priori knowledge into the search engine. Therefore, it becomes obvious that there is a need to classify constrained optimisation problems according to the degree of available or utilised knowledge and to develop search techniques applicable at each stage. The contribution of this thesis is to provide such a view of constrained optimisation, starting from problems that handle the constraints on the representation level, going through problems that have explicitly defined constraints (i.e., an easily computed closed form like a solvable equation), and ending with heavily constrained problems with implicitly defined constraints (incorporated into a single simulation model). At each stage we develop applicable adaptive search techniques that optimally exploit the degree of available a priori knowledge thus providing excellent quality of results and high performance. The proposed techniques are tested using both well known test beds and real world engineering design problems provided by industry.British Aerospace, Rolls Royce and Associate

Vehicle Path Planning for Complete Field Coverage Using Genetic Algorithms

Rosana G. Moreira, Editor-in-Chief; Texas A&M UniversityThis is a paper from International Commission of Agricultural Engineering (CIGR, Commission Internationale du Genie Rural) E-Journal Volume 9 (2007): Vehicle Path Planning for Complete Field Coverage Using Genetic Algorithms. Manuscript ATOE 07 014. Vol. IX. July, 2007

Coverage Repair Strategies for Wireless Sensor Networks Using Mobile Actor Based on Evolutionary Computing

A standard traveling salesman problem(TSP) under dual-objective strategy constrained is proposed in this paper, characterized by the fact that the demand of both as many as possible the numbers of nodes be visited in time and minimum trajectory distance. The motivation for this TSP problem under dual-objective strategy constrain stems from the coverage repair strategies for wireless sensor networks using mobile actor based on energy analysis, wherein a mobile robot replenishes sensors energy when it reaches the sensor node location. The Evolutionary Algorithm (EA) meta-heuristic elegantly solves this problem by the reasonable designed operators of crossover, mutation and local search strategy,which can accelerate convergence of the optimal solution. The global convergence of the proposed algorithm is proved, and the simulation results show the effectiveness of the proposed algorithm

Coverage Repair Strategies for Wireless Sensor Networks using Mobile Actor Based on Evolutionary Computing

A standard traveling salesman problem(TSP) under dual-objective strategy constrained is proposed in this paper, characterized by the fact that the demand of both as many as possible the numbers of nodes be visited in time and minimum trajectory distance. The motivation for this TSP problem under dual-objective strategy constrain stems from the coverage repair strategies for wireless sensor networks using mobile actor based on energy analysis, wherein a mobile robot replenishes sensors energy when it reaches the sensor node location. The Evolutionary Algorithm (EA) meta-heuristic elegantly solves this problem by the reasonable designed operators of crossover, mutation and local search strategy,which can accelerate convergence of the optimal solution. The global convergence of the proposed algorithm is proved, and the simulation results show the effectiveness of the proposed algorithm

Payloads development for European land mobile satellites: A technical and economical assessment

The European Space Agency (ESA) has defined two payloads for Mobile Communication; one payload is for pre-operational use, the European Land Mobile System (EMS), and one payload is for promoting the development of technologies for future mobile communication systems, the L-band Land Mobile Payload (LLM). A summary of the two payloads and a description of their capabilities is provided. Additionally, an economic assessment of the potential mobile communication market in Europe is provided

Early wildfire detection by air quality sensors on unmanned aerial vehicles: Optimization and feasibility

“Millions of acres of forests are destroyed by wildfires every year, causing ecological, environmental, and economical losses. The recent wildfires in Australia and the Western U.S. smothered multiple states with more than fifty million acres charred by the blazes. The warmer and drier climate makes scientists expect increases in the severity and frequency of wildfires and the associated risks in the future. These inescapable crises highlight the urgent need for early detection and prevention of wildfires. This work proposed an energy management framework that integrated unmanned aerial vehicle (UAV) with air quality sensors for early wildfire detection and forest monitoring. An autonomous patrol solution that effectively detects wildfire events, while preserving the UAV battery for a larger area of coverage was developed. The UAV can send real-time data (e.g., sensor readings, thermal pictures, videos, etc) to nearby communications base stations (BSs) when a wildfire is detected. An optimization problem that minimized the total UAV’s consumed energy and satisfied a certain quality-of-service (QoS) data rate were formulated and solved. More specifically, this study optimized the flight track of a UAV and the transmit power between the UAV and BSs. Finally, selected simulation results that illustrate the advantages of the proposed model were proposed”--Abstract, page iii