Search results for "LYN"
showing 10 items of 910 documents
Decomposition of Dynamic Single-Product and Multi-product Lotsizing Problems and Scalability of EDAs
2008
In existing theoretical and experimental work, Estimation of Distribution Algorithms (EDAs) are primarily applied to decomposable test problems. State-of-the-art EDAs like the Hierarchical Bayesian Optimization Algorithm (hBOA), the Learning Factorized Distribution Algorithm (LFDA) or Estimation of Bayesian Networks Algorithm (EBNA) solve these problems in polynomial time. Regarding this success, it is tempting to apply EDAs to real-world problems. But up to now, it has rarely been analyzed which real-world problems are decomposable. The main contribution of this chapter is twofold: (1) It shows that uncapacitated single-product and multi-product lotsizing problems are decomposable. (2) A s…
The multiple vehicle pickup and delivery problem with LIFO constraints
2015
Abstract This paper approaches a pickup and delivery problem with multiple vehicles in which LIFO conditions are imposed when performing loading and unloading operations and the route durations cannot exceed a given limit. We propose two mixed integer formulations of this problem and a heuristic procedure that uses tabu search in a multi-start framework. The first formulation is a compact one, that is, the number of variables and constraints is polynomial in the number of requests, while the second one contains an exponential number of constraints and is used as the basis of a branch-and-cut algorithm. The performances of the proposed solution methods are evaluated through an extensive comp…
On the use of a meshless solver for PDEs governing electromagnetic transients
2009
In this paper some key elements of the Smoothed Particle Hydrodynamics methodology suitably reformulated for analyzing electromagnetic transients are investigated. The attention is focused on the interpolating smoothing kernel function which strongly influences the computational results. Some issues are provided by adopting the polynomial reproducing conditions. Validation tests involving Gaussian and cubic B-spline smoothing kernel functions in one and two dimensions are reported.
The Rural Postman Problem on mixed graphs with turn penalties
2002
In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…
ε-Regularized two-level optimization problems: Approximation and existence results
2006
The purpose of this work is to improve some results given in [12], relating to approximate solutions for two-level optimization problems. By considering an e-regularized problem, we get new properties, under convexity assumptions in the lower level problems. In particular, we prove existence results for the solutions to the e-regularized problem, whereas the initial two-level optimization problem may fail to have a solution. Finally, as an example, we consider an approximation method with interior penalty functions.
An Introduction to Kernel Methods
2009
Machine learning has experienced a great advance in the eighties and nineties due to the active research in artificial neural networks and adaptive systems. These tools have demonstrated good results in many real applications, since neither a priori knowledge about the distribution of the available data nor the relationships among the independent variables should be necessarily assumed. Overfitting due to reduced training data sets is controlled by means of a regularized functional which minimizes the complexity of the machine. Working with high dimensional input spaces is no longer a problem thanks to the use of kernel methods. Such methods also provide us with new ways to interpret the cl…
Statistical methods for determining components non-liniarities, from thermoluminescent devices
2016
Thermoluminescent (TLD) dosimeters enjoy wide usage due to low cost and simplicity of use. They have however large errors at high doses in mixed-radiation fields, where non-linear effects occur. Algorithms based on the Akaike criterion [1] are presented for determining the maximal (physically meaningful) polynomial order with which the non-linearities are modeled. This depends on the number of points existing on a curve and on the points' errors.
Polynomial and horizontally polynomial functions on Lie groups
2022
We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and we assume that $S$ Lie generates $\mathfrak g$. We say that a function $f:\mathbb G\to \mathbb R$ (or more generally a distribution on $\mathbb G$) is $S$-polynomial if for all $X\in S$ there exists $k\in \mathbb N$ such that the iterated derivative $X^k f$ is zero in the sense of distributions. First, we show that all $S$-polynomial functions (as well as distributions) are represented by analytic functions and, if the exponent $k$ in the previous defini…
Bohr radii of vector valued holomorphic functions
2012
Abstract Motivated by the scalar case we study Bohr radii of the N -dimensional polydisc D N for holomorphic functions defined on D N with values in Banach spaces.
The Vector QD Algorithm for Smooth Functions (f, f′)
1996
AbstractWe deal with the functionz↦(f(z), f′(z)) wheref(z)=∑i⩾0aizi, (ai∈C) with limi→∞ai+1×ai−1/(ai)2=q. We investigate the convergence of the vector QD algorithm. We give the asymptotic behaviour of the generalized Hankel determinants. A convergence result on the vector orthogonal polynomials is proved.