Search results for "DISTANCE"
showing 10 items of 1009 documents
A New Iterative Procedure for the Localization of a Moving Object/Person in Indoor Areas from Received RF Signals
2019
This paper presents a new iterative estimation method to localize a single moving object or person in non-stationary 3-dimensional (3D) indoor environments from received radiofrequency (RF) signals. The moving object/person is modelled by a moving single point scatterer. The indoor space is equipped with a multiple-input multiple-output (MIMO) communication system. This work starts by introducing a new geometrical channel model which considers the effects of the line-of-sight (LOS) component, the fixed objects located in a room, and the moving object (point scatterer). Then, we present an iterative estimation technique for computing the time-variant (TV) coordinates of the moving scatterer.…
Thermal restraint of a bacterial exopolysaccharide of shallow vent origin
2018
This is the post-print version of the following article: "Thermal restraint of a bacterial exopolysaccharide of shallow vent origin", which has been published in final form at https://www.sciencedirect.com/science/article/pii/S0141813018308250?via%3Dihub; International audience; To dynamically characterize the thermal properties of the fructose-rich exopolysaccharide (EPS1-T14), produced by themarine thermophilic Bacillus licheniformis T14, the Attenuated Total Reflectance Fourier Transform Infra-Redspectroscopy was coupled to variable temperature ranging from ambient to 80 °C.The spectra were analyzed by the following innovative mathematical tools: i) non-ideal spectral deviation, ii) OHst…
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
2016
[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…
A multi-parametric evolution strategies algorithm for vehicle routing problems
2007
Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational …
Reducing the bandwidth of a sparse matrix with tabu search
2001
The bandwidth of a matrix { } ij a A = is defined as the maximum absolute difference between i and j for which 0 ≠ ij a . The problem of reducing the bandwidth of a matrix consists of finding a permutation of the rows and columns that keeps the nonzero elements in a band that is as close as possible to the main diagonal of the matrix. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the nonzero elements of the corresponding symmetrical matrix. Many bandwidth reduction algorithms have been developed since the 1960s and applied to structural engineering, fluid dynamics and network analysis. For the most part, these procedures do not incorpo…
On the Distance-Constrained Close Enough Arc Routing Problem
2021
[EN] Arc routing problems consist basically of finding one or several routes traversing a given set of arcs and/or edges that must be serviced. The Close-Enough Arc Routing Problem, or Generalized Directed Rural Postman Problem, does not assume that customers are located at specific arcs, but can be serviced by traversing any arc of a given subset. Real-life applications include routing for meter reading, in which a vehicle equipped with a receiver travels a street network. If the vehicle gets within a certain distance of a meter, the receiver collects its data. Therefore, only a few streets which are close enough to the meters need to be traversed. In this paper we study the generalization…
Two-phase branch-and-cut for the mixed capacitated general routing problem
2015
The Mixed Capacitated General Routing Problem (MCGRP) is defined over a mixed graph, for which some vertices must be visited and some links must be traversed at least once. The problem consists of determining a set of least-cost vehicle routes that satisfy this requirement and respect the vehicle capacity. Few papers have been devoted to the MCGRP, in spite of interesting real-world applications, prevalent in school bus routing, mail delivery, and waste collection. This paper presents a new mathematical model for the MCGRP based on two-index variables. The approach proposed for the solution is a two-phase branch-and-cut algorithm, which uses an aggregate formulation to develop an effective …
The squared symmetric FastICA estimator
2017
In this paper we study the theoretical properties of the deflation-based FastICA method, the original symmetric FastICA method, and a modified symmetric FastICA method, here called the squared symmetric FastICA. This modification is obtained by replacing the absolute values in the FastICA objective function by their squares. In the deflation-based case this replacement has no effect on the estimate since the maximization problem stays the same. However, in the symmetric case we obtain a different estimate which has been mentioned in the literature, but its theoretical properties have not been studied at all. In the paper we review the classic deflation-based and symmetric FastICA approaches…
New Results on the Mixed General Routing Problem
2005
[EN] In this paper, we deal with the polyhedral description and the resolution of the Mixed General Routing Problem. This problem, in which the service activity occurs both at some of the nodes and at some of the arcs and edges of a mixed graph, contains a large number of important arc and node routing problems as special cases. Here, a large family of facet-defining inequalities, the Honeycomb inequalities, is described. Furthermore, a cutting-plane algorithm for this problem that incorporates new separation procedures for the K-C, Regular Path-Bridge, and Honeycomb inequalities is presented. Branch and bound is invoked when the final solution of the cutting-plane procedure is fractional. …
Isometries of nilpotent metric groups
2016
We consider Lie groups equipped with arbitrary distances. We only assume that the distance is left-invariant and induces the manifold topology. For brevity, we call such object metric Lie groups. Apart from Riemannian Lie groups, distinguished examples are sub-Riemannian Lie groups and, in particular, Carnot groups equipped with Carnot-Carath\'eodory distances. We study the regularity of isometries, i.e., distance-preserving homeomorphisms. Our first result is the analyticity of such maps between metric Lie groups. The second result is that if two metric Lie groups are connected and nilpotent then every isometry between the groups is the composition of a left translation and an isomorphism.…