Automated, Parallel Optimization Algorithms for Stochastic Functions

The optimization algorithms for stochastic functions are desired specifically for real-world and simulation applications where results are obtained from sampling, and contain experimental error or random noise. We have developed a series of stochastic optimization algorithms based on the well-known classical down hill simplex algorithm. Our parallel implementation of these optimization algorithms, using a framework called MW, is based on a master-worker architecture where each worker runs a massively parallel program. This parallel implementation allows the sampling to proceed independently on many processors as demonstrated by scaling up to more than 100 vertices and 300 cores. This framework is highly suitable for clusters with an ever increasing number of cores per node. The new algorithms have been successfully applied to the reparameterization of a model for liquid water, achieving thermodynamic and structural results for liquid water that are better than a standard model used in molecular simulations, with the the advantage of a fully automated parameterization process

Early Structural Assessment and Optimisation of Passenger Ships

peer reviewedA multi-criteria optimisation of a passenger ship is conducted in this paper. Minimum production cost and minimum steel weight are the both objective studied. Moreover the study answers to the following question: "From when will the higher costs of high tensile steel should be offset by a gain of steel weight?". For a passenger ship, a significant reduction of the steel weight, for a controlled raise of the gravity centre, should lead either to a reduction of fuel consumption either to an additional deck, which for a ship owner means a faster return on investment. Pareto frontiers are obtained and results are validated by classification rules

Faster Evolutionary Multi-Objective Optimization via GALE, the Geometric Active Learner

Goal optimization has long been a topic of great interest in computer science. The literature contains many thousands of papers that discuss methods for the search of optimal solutions to complex problems. In the case of multi-objective optimization, such a search yields iteratively improved approximations to the Pareto frontier, i.e. the set of best solutions contained along a trade-off curve of competing objectives.;To approximate the Pareto frontier, one method that is ubiquitous throughout the field of optimization is stochastic search. Stochastic search engines explore solution spaces by randomly mutating candidate guesses to generate new solutions. This mutation policy is employed by the most commonly used tools (e.g. NSGA-II, SPEA2, etc.), with the goal of a) avoiding local optima, and b) expand upon diversity in the set of generated approximations. Such blind mutation policies explore many sub-optimal solutions that are discarded when better solutions are found. Hence, this approach has two problems. Firstly, stochastic search can be unnecessarily computationally expensive due to evaluating an overwhelming number of candidates. Secondly, the generated approximations to the Pareto frontier are usually very large, and can be difficult to understand.;To solve these two problems, a more-directed, less-stochastic approach than standard search tools is necessary. This thesis presents GALE (Geometric Active Learning). GALE is an active learner that finds approximations to the Pareto frontier by spectrally clustering candidates using a near-linear time recursive descent algorithm that iteratively divides candidates into halves (called leaves at the bottom level). Active learning in GALE selects a minimally most-informative subset of candidates by only evaluating the two-most different candidates during each descending split; hence, GALE only requires at most, 2Log2(N) evaluations per generation. The candidates of each leaf are thereafter non-stochastically mutated in the most promising directions along each piece. Those leafs are piece-wise approximations to the Pareto frontier.;The experiments of this thesis lead to the following conclusion: a near-linear time recursive binary division of the decision space of candidates in a multi-objective optimization algorithm can find useful directions to mutate instances and find quality solutions much faster than traditional randomization approaches. Specifically, in comparative studies with standard methods (NSGA-II and SPEA2) applied to a variety of models, GALE required orders of magnitude fewer evaluations to find solutions. As a result, GALE can perform dramatically faster than the other methods, especially for realistic models

A MULTI-OBJECTIVE MODEL FOR TIME–COST–QUALITY–RISK TRADE-OFF PROBLEMS IN PROJECT MANAGEMENT

This study presents a weighted four-dimensional time-cost-quality-risk trade-off problem to assist decision-makers in planning the best possible use of resources. The proposed model aims to minimize time and cost while maximizing quality and safety and to ensure that the project is completed as required. The critical path method was used to calculate the completion time, the analytical hierarchy process method was used to determine the weights of the quality parameters, and the 3T risk assessment method was used to calculate the risk values. The algorithm was coded in GAMS and optimized using CPLEX. A construction project with a deadline of 310 days, a budget of 5,250,000 ₺, 88% quality and a safety index (SI) of 77% was selected to analyze the accuracy of the model. The model achieved a solution with a completion time of 310 days, costs amounting to 5,247,775 ₺, 88.036% quality, and 77.338% SI

Computational intelligence techniques for HVAC systems: a review

Buildings are responsible for 40% of global energy use and contribute towards 30% of the total CO2 emissions. The drive to reduce energy use and associated greenhouse gas emissions from buildings has acted as a catalyst in the development of advanced computational methods for energy efficient design, management and control of buildings and systems. Heating, ventilation and air conditioning (HVAC) systems are the major source of energy consumption in buildings and an ideal candidate for substantial reductions in energy demand. Significant advances have been made in the past decades on the application of computational intelligence (CI) techniques for HVAC design, control, management, optimization, and fault detection and diagnosis. This article presents a comprehensive and critical review on the theory and applications of CI techniques for prediction, optimization, control and diagnosis of HVAC systems.The analysis of trends reveals the minimization of energy consumption was the key optimization objective in the reviewed research, closely followed by the optimization of thermal comfort, indoor air quality and occupant preferences. Hardcoded Matlab program was the most widely used simulation tool, followed by TRNSYS, EnergyPlus, DOE–2, HVACSim+ and ESP–r. Metaheuristic algorithms were the preferred CI method for solving HVAC related problems and in particular genetic algorithms were applied in most of the studies. Despite the low number of studies focussing on MAS, as compared to the other CI techniques, interest in the technique is increasing due to their ability of dividing and conquering an HVAC optimization problem with enhanced overall performance. The paper also identifies prospective future advancements and research directions

Hierarchical network-aware placement of service oriented applications in clouds

In cloud environments, resources can be requested on-demand when they are needed. A cloud management system is responsible for determining which physical machines are responsible for processing the requests. The problem of determining which servers are used for which services is referred to as the Cloud Application Placement Problem (CAPP), and multiple criteria such as cost and number of migrations must be taken into account. When applications are constructed as a collection of communicating services, such as in Service-Oriented Architectures, it becomes important to take the underlying network properties into account when these placement decisions are made. In this paper, we propose an Integer Linear Programming (ILP) formulation for the CAPP, which optimizes multiple criteria such as cost, latency and number of migrations between subsequent invocations by using multiple optimization criteria. We also present hierarchical algorithms based on particle swarm optimization and genetic algorithms to solve the CAPP. These algorithms are be executed within a management hierarchy, which reduces the amount of information needed for the algorithms to function, increasing scalability of the management system. Finally, we evaluate the hierarchical algorithms by comparing them to an optimal algorithm based on the ILP formulation

Examination timetabling at the University of Cape Town: a tabu search approach to automation

With the rise of schedules and scheduling problems, solutions proposed in literature have expanded yet the disconnect between research and reality remains. The University of Cape Town's (UCT) Examinations Office currently produces their schedules manually with software relegated to error-checking status. While they have requested automation, this study is the first attempt to integrate optimisation techniques into the examination timetabling process. Tabu search and Nelder-Mead methodologies were tested on the UCT November 2014 examination timetabling data with tabu search proving to be more effective, capable of producing feasible solutions from randomised initial solutions. To make this research more accessible, a user-friendly app was developed which showcased the optimisation techniques in a more digestible format. The app includes data cleaning specific to UCT's data management system and was presented to the UCT Examinations Office where they expressed support for further development: in its current form, the app would be used as a secondary tool after an initial solution has been manually obtained