4,452 research outputs found
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
Genetic and Swarm Algorithms for Optimizing the Control of Building HVAC Systems Using Real Data: A Comparative Study.
Buildings consume a considerable amount of electrical energy, the Heating, Ventilation,
and Air Conditioning (HVAC) system being the most demanding. Saving energy and maintaining
comfort still challenge scientists as they conflict. The control of HVAC systems can be improved by
modeling their behavior, which is nonlinear, complex, and dynamic and works in uncertain contexts.
Scientific literature shows that Soft Computing techniques require fewer computing resources
but at the expense of some controlled accuracy loss. Metaheuristics-search-based algorithms show
positive results, although further research will be necessary to resolve new challenging multi-objective
optimization problems. This article compares the performance of selected genetic and swarmintelligence-
based algorithms with the aim of discerning their capabilities in the field of smart buildings.
MOGA, NSGA-II/III, OMOPSO, SMPSO, and Random Search, as benchmarking, are compared
in hypervolume, generational distance, ε-indicator, and execution time. Real data from the Building
Management System of Teatro Real de Madrid have been used to train a data model used for the
multiple objective calculations. The novelty brought by the analysis of the different proposed dynamic
optimization algorithms in the transient time of an HVAC system also includes the addition,
to the conventional optimization objectives of comfort and energy efficiency, of the coefficient of
performance, and of the rate of change in ambient temperature, aiming to extend the equipment
lifecycle and minimize the overshooting effect when passing to the steady state. The optimization
works impressively well in energy savings, although the results must be balanced with other real
considerations, such as realistic constraints on chillers’ operational capacity. The intuitive visualization
of the performance of the two families of algorithms in a real multi-HVAC system increases
the novelty of this proposal.post-print888 K
Topology optimization of freeform large-area metasurfaces
We demonstrate optimization of optical metasurfaces over --
degrees of freedom in two and three dimensions, 100--1000+ wavelengths
() in diameter, with 100+ parameters per . In particular,
we show how topology optimization, with one degree of freedom per
high-resolution "pixel," can be extended to large areas with the help of a
locally periodic approximation that was previously only used for a few
parameters per . In this way, we can computationally discover
completely unexpected metasurface designs for challenging multi-frequency,
multi-angle problems, including designs for fully coupled multi-layer
structures with arbitrary per-layer patterns. Unlike typical metasurface
designs based on subwavelength unit cells, our approach can discover both sub-
and supra-wavelength patterns and can obtain both the near and far fields
- …