Search results for "Optimization"

GRASP and tabu search for the generalized dispersion problem

2021

Abstract The problem of maximizing dispersion requires the selection of a specific number of elements from a given set, in such a way that the minimum distance between the pairs of selected elements is maximized. In recent years, this problem has received a lot of attention and has been solved with many complex heuristics. However, there is a recent variant in which the selected elements have to satisfy two realistic constraints, a minimum capacity limit and a maximum budget, which in spite of its practical significance in facility location, has received little attention. In this paper, we first propose mathematical models to obtain the optimal solution of small- and medium-size instances, …

The probabilistic pickup-and-delivery travelling salesman problem

2019

Abstract Transportation problems are essential in commercial logistics and have been widely studied in the literature during the last decades. Many of them consist in designing routes for vehicles to move commodities between locations. This article approaches a pickup-and-delivery single-vehicle routing problem where there is susceptibility to uncertainty in customer requests. The probability distributions of the requests are assumed to be known, and the objective is to design an a priori route with minimum expected length. The problem has already been approached in the literature, but through a heuristic method. This article proposes the first exact approach to the problem. Two mathematica…

An algebraic continuous time parameter estimation for a sum of sinusoidal waveform signals

2016

In this paper, a novel algebraic method is proposed to estimate amplitudes, frequencies, and phases of a biased and noisy sum of complex exponential sinusoidal signals. The resulting parameter estimates are given by original closed formulas, constructed as integrals acting as time-varying filters of the noisy measured signal. The proposed algebraic method provides faster and more robust results, compared with usual procedures. Some computer simulations illustrate the efficiency of our method. Copyright © 2016 John Wiley & Sons, Ltd.

A Hierarchical Learning Scheme for Solving the Stochastic Point Location Problem

2012

Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_78 This paper deals with the Stochastic-Point Location (SPL) problem. It presents a solution which is novel in both philosophy and strategy to all the reported related learning algorithms. The SPL problem concerns the task of a Learning Mechanism attempting to locate a point on a line. The mechanism interacts with a random environment which essentially informs it, possibly erroneously, if the unknown parameter is on the left or the right of a given point which also is the current guess. The first pioneering work […

Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems

2016

Mixed integer optimal compensation deals with optimization problems with integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls could lead to intractability in problems of large dimensions. To address this challenge, we introduce a decomposition method which turns the original n-dimensional optimization problem into n independent scalar problems of lot sizing form. Each of these problems can be viewed as a two-player zero-sum game, which introduces some element of conservatism. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon, a step that mirro…

Globally Optimal Line Clustering and Vanishing Point Estimation in Manhattan World

2012

The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotation estimation and 3D reconstruction. Urban environments generally exhibit some dominant orthogonal VPs. Given a set of lines extracted from a calibrated image, this paper aims to (1) determine the line clustering, i.e. find which line belongs to which VP, and (2) estimate the associated orthogonal VPs. None of the existing methods is fully satisfactory because of the inherent difficulties of the problem, such as the local minima and the chicken-and-egg aspect. In this paper, we present a new algorithm that solves t…

Algorithmic Approach for Slot Filling Factors Determination in Electrical Machines

2018

In several industrial sectors, such as electric and hybrid traction, the demand for increasingly efficient and high power density electrical machines has grown considerably over the last few years. The improvement of slot filling factor of the electrical machines is an useful provision to satisfy this request. In particular, this topic has been the subject of interest for the industrial sector in recent years, since the technology of winding processes have evolved and allow an economically sustainable realization of windings with an ordered structure rather than randomly. The winding phase must be supported by an accurate design process in which it is possible to evaluate the maximum slot f…

Vibration control strategy for large-scale structures with incomplete multi-actuator system and neighbouring state information

2016

The synthesis of optimal controllers for vibrational protection of large-scale structures with multiple actuation devices and partial state information is a challenging problem. In this study, the authors present a design strategy that allows computing this kind of controllers by using standard linear matrix inequality optimisation tools. To illustrate the main elements of the new approach, a five-story structure equipped with two interstory actuation devices and subjected to a seismic disturbance is considered. For this control setup, three different controllers are designed: an ideal state-feedback H 8 controller with full access to the complete state information and two static output-fee…

2021

Classification approaches that allow to extract logical rules such as decision trees are often considered to be more interpretable than neural networks. Also, logical rules are comparatively easy to verify with any possible input. This is an important part in systems that aim to ensure correct operation of a given model. However, for high-dimensional input data such as images, the individual symbols, i.e. pixels, are not easily interpretable. Therefore, rule-based approaches are not typically used for this kind of high-dimensional data. We introduce the concept of first-order convolutional rules, which are logical rules that can be extracted using a convolutional neural network (CNN), and w…

Darboux integrable system with a triple point and pseudo-abelian integrals

2016

We study pseudo-abelian integrals associated with polynomial perturbations of Dar-boux integrable system with a triple point. Under some assumptions we prove the local boundedness of the number of their zeros. Assuming that this is the only non-genericity, we prove that the number of zeros of the corresponding pseudo-abelian integrals is bounded uniformly for nearby Darboux integrable foliations.