A hybrid swarm-based algorithm for single-objective optimization problems involving high-cost analyses

In many technical fields, single-objective optimization procedures in continuous domains involve expensive numerical simulations. In this context, an improvement of the Artificial Bee Colony (ABC) algorithm, called the Artificial super-Bee enhanced Colony (AsBeC), is presented. AsBeC is designed to provide fast convergence speed, high solution accuracy and robust performance over a wide range of problems. It implements enhancements of the ABC structure and hybridizations with interpolation strategies. The latter are inspired by the quadratic trust region approach for local investigation and by an efficient global optimizer for separable problems. Each modification and their combined effects are studied with appropriate metrics on a numerical benchmark, which is also used for comparing AsBeC with some effective ABC variants and other derivative-free algorithms. In addition, the presented algorithm is validated on two recent benchmarks adopted for competitions in international conferences. Results show remarkable competitiveness and robustness for AsBeC.Comment: 19 pages, 4 figures, Springer Swarm Intelligenc

Image Reconstruction from Bag-of-Visual-Words

The objective of this work is to reconstruct an original image from Bag-of-Visual-Words (BoVW). Image reconstruction from features can be a means of identifying the characteristics of features. Additionally, it enables us to generate novel images via features. Although BoVW is the de facto standard feature for image recognition and retrieval, successful image reconstruction from BoVW has not been reported yet. What complicates this task is that BoVW lacks the spatial information for including visual words. As described in this paper, to estimate an original arrangement, we propose an evaluation function that incorporates the naturalness of local adjacency and the global position, with a method to obtain related parameters using an external image database. To evaluate the performance of our method, we reconstruct images of objects of 101 kinds. Additionally, we apply our method to analyze object classifiers and to generate novel images via BoVW

Ant colony optimisation and local search for bin-packing and cutting stock problems

The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO

Internet of Things in urban waste collection

Nowadays, the waste collection management has an important role in urban areas. This paper faces this issue and proposes the application of a metaheuristic for the optimization of a weekly schedule and routing of the waste collection activities in an urban area. Differently to several contributions in literature, fixed periodic routes are not imposed. The results significantly improve the performance of the company involved, both in terms of resources used and costs saving

Heuristics and Metaheuristics Approaches for Facility Layout Problems: A Survey

Facility Layout Problem (FLP) is a NP-hard problem concerned with the arrangement of facilities as to minimize the distance travelled between all pairs of facilities. Many exact and approximate approaches have been proposed with an extensive applicability to deal with this problem. This paper studies the fundamentals of some well-known heuristics and metaheuristics used in solving the FLPs. It is hoped that this paper will trigger researchers for in-depth studies in FLPs looking into more specific interest such as equal or unequal FLPs

A nonmonotone GRASP

A greedy randomized adaptive search procedure (GRASP) is an itera- tive multistart metaheuristic for difficult combinatorial optimization problems. Each GRASP iteration consists of two phases: a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Repeated applications of the con- struction procedure yields different starting solutions for the local search and the best overall solution is kept as the result. The GRASP local search applies iterative improvement until a locally optimal solution is found. During this phase, starting from the current solution an improving neighbor solution is accepted and considered as the new current solution. In this paper, we propose a variant of the GRASP framework that uses a new “nonmonotone” strategy to explore the neighborhood of the current solu- tion. We formally state the convergence of the nonmonotone local search to a locally optimal solution and illustrate the effectiveness of the resulting Nonmonotone GRASP on three classical hard combinatorial optimization problems: the maximum cut prob- lem (MAX-CUT), the weighted maximum satisfiability problem (MAX-SAT), and the quadratic assignment problem (QAP)

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

A statistical learning based approach for parameter fine-tuning of metaheuristics

Metaheuristics are approximation methods used to solve combinatorial optimization problems. Their performance usually depends on a set of parameters that need to be adjusted. The selection of appropriate parameter values causes a loss of efficiency, as it requires time, and advanced analytical and problem-specific skills. This paper provides an overview of the principal approaches to tackle the Parameter Setting Problem, focusing on the statistical procedures employed so far by the scientific community. In addition, a novel methodology is proposed, which is tested using an already existing algorithm for solving the Multi-Depot Vehicle Routing Problem.Peer ReviewedPostprint (published version

Applications of biased randomised algorithms and simheuristics to asset and liability management

Asset and Liability Management (ALM) has captured the attention of academics and financial researchers over the last few decades. On the one hand, we need to try to maximise our wealth by taking advantage of the financial market and, on the other hand, we need to cover our payments (liabilities) over time. The purpose of ALM is to give investors a series of resources or techniques to select the appropriate assets on the financial market that respond to the aforementioned two key factors: cover our liabilities and maximise our wealth. This thesis presents a set of techniques that are capable of tackling realistic financial problems without the usual requirement of considerable computational resources. These techniques are based on heuristics and simulation. Specifically, a biased randomised metaheuristic model is developed that has a direct application in the way insurance companies usually operate. The algorithm makes it possible to efficiently select the smallest number of assets, mainly fixed income, on the balance sheet while guaranteeing the company's obligations. This development allows for the incorporating of the credit quality of the issuer of the assets used. Likewise, a portfolio optimisation model with liabilities is developed and solved with a genetic algorithm. The portfolio optimisation problem differs from the usual one in that it is multi-period, and incorporates liabilities over time. Additionally, the possibility of external financing is included when the entity does not have sufficient cash. These conditions give rise to a complex problem that is efficiently solved by an evolutionary algorithm. In both cases, the algorithms are improved with the incorporation of Monte Carlo simulation. This allows the solutions to be robust when considering realistic market situations. The results are very promising. This research shows that simheuristics is an ideal method for this type of problem.La gestión de activos y pasivos (asset and liability management, ALM) ha acaparado la atención de académicos e investigadores financieros en las últimas décadas. Por un lado, debemos tratar de maximizar nuestra riqueza aprovechando el mercado financiero, y por otro, debemos cubrir nuestros pagos (pasivos) a lo largo del tiempo. El objetivo del ALM es dotar al inversor de una serie de recursos o técnicas para seleccionar los activos del mercado financiero adecuados para obedecer a los dos factores clave mencionados: cumplir con nuestros pasivos y maximizar nuestra riqueza. Esta tesis presenta un conjunto de técnicas que son capaces de abordar problemas financieros realistas sin la necesidad habitual de considerables recursos computacionales. Estas técnicas se basan en la heurística y la simulación. En concreto, se desarrolla un modelo metaheurístico sesgado que tiene una aplicación directa en la operación habitual de inmunización de las compañías de seguros. El algoritmo permite seleccionar eficientemente el menor número de activos, principalmente de renta fija, en el balance y garantizar las obligaciones de la compañía. Este desarrollo permite incorporar la calidad crediticia del emisor de los activos utilizados. Asimismo, se desarrolla un modelo de optimización de la cartera con el pasivo y se resuelve con un algoritmo genético. El problema de optimización de la cartera difiere del habitual en que es multiperiodo e incorpora los pasivos a lo largo del tiempo. Además, se incluye la posibilidad de financiación externa cuando la entidad no tiene suficiente efectivo. Estas condiciones dan lugar a un problema complejo que se resuelve eficientemente mediante un algoritmo evolutivo. En ambos casos, los algoritmos se mejoran con la incorporación de la simulación de Montecarlo. Esto permite que las soluciones sean robustas cuando consideramos situaciones de mercado realistas. Los resultados son muy prometedores. Esta investigación demuestra que la simheurística es un método ideal para este tipo de problemas.La gestió d'actius i passius (asset and liability management, ALM) ha acaparat l'atenció d'acadèmics i investigadors financers les darreres dècades. D'una banda, hem de mirar de maximitzar la nostra riquesa aprofitant el mercat financer, i de l'altra, hem de cobrir els nostres pagaments (passius) al llarg del temps. L'objectiu de l'ALM és dotar l'inversor d'una sèrie de recursos o tècniques per seleccionar els actius del mercat financer adequats per obeir als dos factors clau esmentats: complir els passius i maximitzar la nostra riquesa. Aquesta tesi presenta un conjunt de tècniques que són capaces d'abordar problemes financers realistes sense la necessitat habitual de recursos computacionals considerables. Aquestes tècniques es basen en l'heurística i la simulació. En concret, es desenvolupa un model metaheurístic esbiaixat que té una aplicació directa a l'operació habitual d'immunització de les companyies d'assegurances. L'algorisme permet seleccionar eficientment el menor nombre d'actius, principalment de renda fixa, al balanç i garantir les obligacions de la companyia. Aquest desenvolupament permet incorporar la qualitat creditícia de l'emissor dels actius utilitzats. Així mateix, es desenvolupa un model d'optimització de la cartera amb el passiu i es resol amb un algorisme genètic. El problema d'optimització de la cartera difereix de l'habitual en el fet que és multiperíode i incorpora els passius al llarg del temps. A més, s'inclou la possibilitat de finançament extern quan l'entitat no té prou efectiu. Aquestes condicions donen lloc a un problema complex que es resol eficientment mitjançant un algorisme evolutiu. En tots dos casos, els algorismes es milloren amb la incorporació de la simulació de Montecarlo. Això permet que les solucions siguin robustes quan considerem situacions de mercat realistes. Els resultats són molt prometedors. Aquesta recerca demostra que la simheurística és un mètode ideal per a aquesta mena de problemes.Tecnologías de la información y de rede