Direct search optimization application programming interface with remote access

Search Optimization methods are needed to solve optimization problems where the objective function and/or constraints functions might be non differentiable, non convex or might not be possible to determine its analytical expressions either due to its complexity or its cost (monetary, computational, time,...). Many optimization problems in engineering and other fields have these characteristics, because functions values can result from experimental or simulation processes, can be modelled by functions with complex expressions or by noise functions and it is impossible or very difficult to calculate their derivatives. Direct Search Optimization methods only use function values and do not need any derivatives or approximations of them. In this work we present a Java API that including several methods and algorithms, that do not use derivatives, to solve constrained and unconstrained optimization problems. Traditional API access, by installing it on the developer and/or user computer, and remote API access to it, using Web Services, are also presented. Remote access to the API has the advantage of always allow the access to the latest version of the API. For users that simply want to have a tool to solve Nonlinear Optimization Problems and do not want to integrate these methods in applications, also two applications were developed. One is a standalone Java application and the other a Web-based application, both using the developed API.

Filters method in direct search optimization, new measures to admissibility

Constrained nonlinear optimization problems are usually solved using penalty or barrier methods combined with unconstrained optimization methods. Another alternative used to solve constrained nonlinear optimization problems is the lters method. Filters method, introduced by Fletcher and Ley er in 2002, have been widely used in several areas of constrained nonlinear optimization. These methods treat optimization problem as bi-objective attempts to minimize the objective function and a continuous function that aggregates the constraint violation functions. Audet and Dennis have presented the rst lters method for derivative-free nonlinear programming, based on pattern search methods. Motivated by this work we have de- veloped a new direct search method, based on simplex methods, for general constrained optimization, that combines the features of the simplex method and lters method. This work presents a new variant of these methods which combines the lters method with other direct search methods and are proposed some alternatives to aggregate the constraint violation functions.

A web-based tool to evaluate the iterative processes of direct search methods

Constrained and unconstrained Nonlinear Optimization Problems often appear in many engineering areas. In some of these cases it is not possible to use derivative based optimization methods because the objective function is not known or it is too complex or the objective function is non-smooth. In these cases derivative based methods cannot be used and Direct Search Methods might be the most suitable optimization methods. An Application Programming Interface (API) including some of these methods was implemented using Java Technology. This API can be accessed either by applications running in the same computer where it is installed or, it can be remotely accessed through a LAN or the Internet, using webservices. From the engineering point of view, the information needed from the API is the solution for the provided problem. On the other hand, from the optimization methods researchers’ point of view, not only the solution for the problem is needed. Also additional information about the iterative process is useful, such as: the number of iterations; the value of the solution at each iteration; the stopping criteria, etc. In this paper are presented the features added to the API to allow users to access to the iterative process data.

Self-adaptive combination of global tabu search and local search for nonlinear equations

Solving systems of nonlinear equations is a very important task since the problems emerge mostly through the mathematical modelling of real problems that arise naturally in many branches of engineering and in the physical sciences. The problem can be naturally reformulated as a global optimization problem. In this paper, we show that a self-adaptive combination of a metaheuristic with a classical local search method is able to converge to some difficult problems that are not solved by Newton-type methods.

Direct-search penalty/barrier methods

In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Problems. There are several Penalty/Barrier Methods and they are used in several areas from Engineering to Economy, through Biology, Chemistry, Physics among others. In these areas it often appears Optimization Problems in which the involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. In this work some Penalty/Barrier functions are tested and compared, using in the internal process, Derivative-free, namely Direct Search, methods. This work is a part of a bigger project involving the development of an Application Programming Interface, that implements several Optimization Methods, to be used in applications that need to solve constrained and/or unconstrained Nonlinear Optimization Problems. Besides the use of it in applied mathematics research it is also to be used in engineering software packages.

A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

This paper presents a methodology for applying scheduling algorithms using Monte Carlo simulation. The methodology is based on a decision support system (DSS). The proposed methodology combines a genetic algorithm with a new local search using Monte Carlo Method. The methodology is applied to the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The methodology is tested on a set of standard instances taken from the literature and compared with others. The computation results validate the effectiveness of the proposed methodology. The DSS developed can be utilized in a common industrial or construction environment.

Solving nonlinear equations by a tabu search strategy

Solving systems of nonlinear equations is a problem of particular importance since they emerge through the mathematical modeling of real problems that arise naturally in many branches of engineering and in the physical sciences. The problem can be naturally reformulated as a global optimization problem. In this paper, we show that a metaheuristic, called Directed Tabu Search (DTS) [16], is able to converge to the solutions of a set of problems for which the fsolve function of MATLAB® failed to converge. We also show the effect of the dimension of the problem in the performance of the DTS.

Crossing genetic and swarm intelligence algorithms to generate logic circuits

Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetic. The basic concept of GAs is designed to simulate processes in natural system necessary for evolution, specifically those that follow the principles first laid down by Charles Darwin of survival of the fittest. On the other hand, Particle swarm optimization (PSO) is a population based stochastic optimization technique inspired by social behavior of bird flocking or fish schooling. PSO shares many similarities with evolutionary computation techniques such as GAs. The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. PSO is attractive because there are few parameters to adjust. This paper presents hybridization between a GA algorithm and a PSO algorithm (crossing the two algorithms). The resulting algorithm is applied to the synthesis of combinational logic circuits. With this combination is possible to take advantage of the best features of each particular algorithm.

Sistema avançado de previsão de vendas para as lojas Pingo Doce do grupo Jerónimo Martins

Dissertação apresentada ao Instituto Politécnico do Porto para obtenção do Grau de Mestre em Logística Orientada por: Professora Doutora Patrícia Alexandra Gregório Ramos

Integração da análise energética na gestão Industrial de uma refinaria de açúcar

Mestrado em Engenharia Química - Optimização Energética na Industria Química

Eficiência energética em edifícios residenciais da cidade do Porto

O consumo de energia a nível mundial tem atingido valores históricos, devido ao crescimento da população mundial e ao aumento do consumo per capita. Nesta medida é extremamente importante existirem alternativas para que a redução do consumo de energia de todos os países seja uma realidade, evitando também as consequências ambientais, em particular as alterações climáticas, resultantes da utilização intensiva de combustíveis fósseis. Portugal, tal como outros países da União Europeia, tem que cumprir metas, pelo que é urgente encontrarem-se soluções de forma a diminuir o consumo de energia sem interferir com o nosso dia-a-dia. A cidade do Porto, tal como qualquer cidade, precisa de imensa energia desde os transportes até à indústria, passando pelos edifícios. Os edifícios, residenciais e de serviços, são responsáveis por mais de 50% de energia primária consumida no concelho do Porto, sendo que aos edifícios residenciais corresponde um consumo de 1.473 GWh/ano de energia primária, o que é um valor elevado. Numa primeira parte deste trabalho foi efetuado um levantamento de informação caracterizando a cidade do Porto relativamente ao seu edificado e consumos energéticos. Numa segunda parte propuseram-se medidas para reduzir o consumo para cada tipo de utilização de energia, nomeadamente preparação de refeições, AQS (água quente sanitária), aquecimento ambiente, frio (frigorífico, arcas, etc.), outros e iluminação. Para cada um destes tipos de utilização estudou-se, sempre que possível, a evolução do longo do tempo (2004 a 2012) e possíveis cenários de evolução para o futuro. Para além disso, também se estudou a evolução do mix de produção de energia elétrica de 2004 até 2012 e previsões da evolução do mix para o futuro. Nesta análise foi tido em conta o aspeto ambiental contabilizando-se, sempre que possível, as emissões de poluentes resultantes do consumo de energia. Por fim, efetuou-se uma avaliação técnica, ambiental e económica das medidas propostas. Pode dizer-se que a maioria das medidas propostas a serem implementadas conduziria a uma redução do consumo de energia e consequentemente a uma diminuição das emissões de poluentes, em particular dos gases com efeito de estufa (CO2). Em termos técnicos a maioria das medidas pode ser aplicada embora algumas delas envolvam custos de investimento significativos. Dada a conjuntura atual, seria importante obter o financiamento necessário para a implementação das medidas propostas e a divulgação de medidas já existentes, tais como os programas para AQS e janelas eficientes.

Aplicação de ferramentas de simulação estocástica na área de planeamento de uma empresa de abastecimento de água

No presente trabalho procura-se evidenciar algumas soluções para aplicação de simulação estocástica num contexto de gestão dos ativos, aplicado a um sistema de abastecimento de água, tirando partido da informação disponível sobre a manutenção que vem realizando, ao longo dos anos. Procura-se também descrever como estas metodologias podem ser aplicadas noutros casos, futuramente, beneficiando ainda da recolha de informação de colaboradores da empresa, com experiência no cargo e com elevado conhecimento do funcionamento das infraestruturas. A simulação estocástica é uma área cujas ferramentas podem dar uma preciosa ajuda no processo de tomada de decisão. Por outro lado, as organizações preocupam-se, cada vez mais, com o tema da gestão de ativos e com os custos a si associados, começando a investir mais tempo e dinheiro nessa matéria com o objetivo de delinearem estratégias para aumentar o período de vida útil dos seus ativos e otimizarem os seus investimentos de renovação. Nesse contexto, evidencia-se que um adequado plano de intervenções de manutenção e operação é uma boa metodologia, para garantir a redução de falhas no sistema de abastecimento de uma empresa desse setor, bem como garantir que as infraestruturas se encontram em condições de funcionamento. Contudo, esta abordagem tradicional não será suficiente para garantir as melhores práticas e os objetivos que se pretendem alcançar com uma gestão de ativos atual. O trabalho inclui, ainda, um estudo de caso com que se aplicaram as ferramentas estudadas a um caso real de um grupo de bombagem, de uma das Estações Elevatórias da empresa.

Space-time monitoring of prescribed burnt soils performance – an effective tool for forest management

Among the most important measures to prevent wild forest fires is the use of prescribed and controlled burning actions in order to reduce the availability of fuel mass. However, the impact of these activities on soil physical and chemical properties varies according to the type of both soil and vegetation and is not fully understood. Therefore, soil monitoring campaigns are often used to measure these impacts. In this paper we have successfully used three statistical data treatments - the Kolmogorov-Smirnov test followed by the ANOVA and the Kruskall-Wallis tests – to investigate the variability among the soil pH, soil moisture, soil organic matter and soil iron variables for different monitoring times and sampling procedures.

LSP communication in a digital age: the outcomes of teaching and learning in tertiary education

This paper discusses the changes brought by the communication revolution in teaching and learning in the scope of LSP. Its aim is to provide an insight on how teaching which was bi-dimensional, turned into a multidimensional system, gathering other complementary resources that have transformed, in a incredibly short time, the ways we receive share and store information, for instance as professionals, and keep in touch with our peers. The increasing rise of electronic publications, the incredible boom of social and professional networks, search engines, blogs, list servs, forums, e-mail blasts, Facebook pages, YouTube contents, Tweets and Apps, have twisted the way information is conveyed. Classes ceased to be predictable and have been empowered by digital platforms, innumerous and different data repositories (TILDE, IATE, LINGUEE, and so many other terminological data banks) that have definitely transformed the academic world in general and tertiary education in particular. There is a bulk of information to be digested by students, who are no longer passive but instead responsible and active for their academic outcomes. The question is whether they possess the tools to select only what is accurate and important for a certain subject or assignment, due to that overflow? Due to the reduction of the number of course years in most degrees, after the implementation of Bologna and the shrinking of the curricula contents, have students the possibility of developing critical thinking? Both teaching and learning rely on digital resources to improve the speed of the spreading of knowledge. But have those changes been effective to promote really communication? Furthermore, with the increasing Apps that have already been developed and will continue to appear for learning foreign languages, for translation among others, will the students feel the need of learning them once they have those Apps. These are some the questions we would like to discuss in our paper.

Multi-agent system for distributed manufacturing scheduling with genetic algorithms and tabu search

Computerized scheduling methods and computerized scheduling systems according to exemplary embodiments. A computerized scheduling method may be stored in a memory and executed on one or more processors. The method may include defining a main multi-machine scheduling problem as a plurality of single machine scheduling problems; independently solving the plurality of single machine scheduling problems thereby calculating a plurality of near optimal single machine scheduling problem solutions; integrating the plurality of near optimal single machine scheduling problem solutions into a main multi-machine scheduling problem solution; and outputting the main multi-machine scheduling problem solution.