Search results for "Mathematical optimization"
showing 10 items of 1300 documents
A time evolution model for total-variation based blind deconvolution
2007
Departamento Matematica Aplicada, Universidad de Valencia, Burjassot 46100, Spain.We propose a time evolution model for total-variation based blind deconvolution consisting of two evolution equations evolv-ing the signal by means of a nonlinear scale space method and the kernel by using a diffusion equation starting from the zerosignal and a delta function respectively. A preliminary numerical test consisting of blind deconvolution of a noiseless blurredimage is presented.
Robust Allocation Rules in Dynamical Cooperative TU Games
2011
Robust dynamic coalitional TU games are repeated TU games where the values of the coalitions are unknown but bounded variables. We set up the game supposing that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to re-adjust the allocations among the players. As main result, we provide a constructive method for designing allocation rules that converge to the core of the average game. Both the set up and the solution approach also provide an insight on commonalities between coalitional games and stability theory.
The mixed capacitated general routing problem with turn penalties
2011
In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing problems, and it takes into account turn penalties and forbidden turns, which are crucial in many real-life applications, such as mail delivery, waste collection and street maintenance operations. Through a polynomial transformation of the considered problem into a Generalized Vehicle routing problem, we suggest a new approach for solving this new problem by transforming it into an Asymmetric Capacitated Vehicle routing problem. In this way, we can solve the new problem both optimally and heuristically using existing algorithms. A powerfu…
Boundary value steady solutions of a class of hydrodynamic models for vehicular traffic flow
2003
This paper deals with the solution of a boundary value problem related to a steady nonuniform description of a class of traffic flow models. The models are obtained by the closure of the mass conservation equation with a phenomenological relation linking the local mass velocity to the local density. The analysis is addressed to define the proper framework toward the identification of the parameter characterizing the model. The last part of the paper develops a critical analysis also addressed to the design of new traffic flow models.
On interactive multiobjective optimization with NIMBUS® in chemical process design
2005
We study multiobjective optimization problems arising from chemical process simulation. The interactive multiobjective optimization method NIMBUS®, developed at the University of Jyvaskyla, is combined with the BALAS® process simulator, developed at the VTT Technical Research Center of Finland, in order to provide a new interactive tool for designing chemical processes. Continuous interaction between the method and the designer provides a new efficient approach to explore Pareto optimal solutions and helps the designer to learn about the behaviour of the process. As an example of how the new tool can be used, we report the results of applying it in a heat recovery system design problem rela…
An output-only stochastic parametric approach for the identification of linear and nonlinear structures under random base excitations: Advances and c…
2014
In this paper a time domain output-only Dynamic Identification approach for Civil Structures (DICS) first formulated some years ago is reviewed and presented in a more generalized form. The approach in question, suitable for multi- and single-degrees-of-freedom systems, is based on the statistical moments and on the correlation functions of the response to base random excitations. The solving equations are obtained by applying the Itô differential stochastic calculus to some functions of the response. In the previous version ([21] Cavaleri, 2006; [22] Benfratello et al., 2009), the DICS method was based on the use of two classes of models (Restricted Potential Models and Linear Mass Proport…
Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems
2019
In this work, we propose a heuristic procedure for a stochastic version of the uncapacitated r-allocation p-hub median problem with nonstop services. In particular, we assume that the number of hubs to which a terminal can be allocated is bounded from above by r. Additionally, we consider the possibility of shipping traffic directly between terminals (nonstop services). Uncertainty is associated with the traffic to be shipped between nodes and with the transportation costs. If we assume that such uncertainty can be captured by a finite set of scenarios, each of which with a probability known in advance, it is possible to develop a compact formulation for the deterministic equivalent proble…
Model approximation for two-dimensional Markovian jump systems with state-delays and imperfect mode information
2014
Published version of an article in the journal: Multidimensional Systems and Signal Processing. Also available from the publisher at: http://dx.doi.org/10.1007/s11045-013-0276-x This paper is concerned with the problem of {Mathematical expression} model approximation for a class of two-dimensional (2-D) discrete-time Markovian jump linear systems with state-delays and imperfect mode information. The 2-D system is described by the well-known Fornasini-Marchesini local state-space model, and the imperfect mode information in the Markov chain simultaneously involves the exactly known, partially unknown and uncertain transition probabilities. By using the characteristics of the transition proba…
Producer's spatial equilibrium with a fuzzy constraint
1980
The classical theory of the producer’s equilibrium rests on two sets of particularly restrictive hypotheses. First it is implicitely assumed that all inputs and outputs are located in a single place where the producer is also implanted and where the production is carried out. Next it is assumed that the producer follows a precise behaviour pattern, by this we mean that the producer has complete information concerning the conditions of hisproductive activity and he has perfect command over both the set of inputs and the set of outputs; he realises the maximum profit allowed by the technological constraint which limits his possible actions and by the given price system. The aim of this study …
Orientation matters
2008
The optimal communication spanning tree (OCST) problem is a well known $\mathcal{NP}$-hard combinatorial optimization problem which seeks a spanning tree that satisfies all given communication requirements for minimal total costs. It has been shown that optimal solutions of OCST problems are biased towards the much simpler minimum spanning tree (MST) problem. Therefore, problem-specific representations for EAs like heuristic variants of edge-sets that are biased towards MSTs show high performance.In this paper, additional properties of optimal solutions for Euclidean variants of OCST problems are studied. Experimental results show that not only edges in optimal trees are biased towards low-…