Search results for " Local"
showing 10 items of 2101 documents
Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks
2016
The contribution of this study is twofold: First, we show that we can predict the performance of Iterated Local Search (ILS) in different landscapes with the help of Local Optima Networks (LONs) with escape edges. As a predictor, we use the PageRank Centrality of the global optimum. Escape edges can be extracted with lower effort than the edges used in a previous study. Second, we show that the PageRank vector of a LON can be used to predict the solution quality (average fitness) achievable by ILS in different landscapes.
COMPUTATION OF LOCAL VOLATILITIES FROM REGULARIZED DUPIRE EQUATIONS
2005
We propose a new method to calibrate the local volatility function of an asset from observed option prices of the underlying. Our method is initialized with a preprocessing step in which the given data are smoothened using cubic splines before they are differentiated numerically. In a second step the Dupire equation is rewritten as a linear equation for a rational expression of the local volatility. This equation is solved with Tikhonov regularization, using some discrete gradient approximation as penalty term. We show that this procedure yields local volatilities which appear to be qualitatively correct.
General Concepts in Metaheuristic Search
2017
Metaheuristics have become a very popular family of solution methods for optimization problems because they are capable of finding “acceptable” solutions in a “reasonable” amount of time. Most optimization problems in practice are too complex to be approached by exact methods that can guarantee finding global optimal solutions. The time required to find and verify globally optimal solutions is impractical in most applications. An entire computational theory, which we will not discussed here, has been developed around problem complexity. It suffices to say that it is now known that the great majority of the optimization problems found in practice fall within a category that makes them “compu…
Context-Independent Scatter and Tabu Search for Permutation Problems
2005
In this paper, we develop a general-purpose heuristic for permutations problems. The procedure is based on the scatter-search and tabu-search methodologies and treats the objective-function evaluation as a black box, making the search algorithm context-independent. Therefore, our main contribution consists of the development and testing of a procedure that uses no knowledge from the problem context to search for the optimal solution. We perform computational experiments with four well-known permutation problems to study the efficiency and effectiveness of the proposed method. These experiments include a comparison with two commercially available software packages that are also based on met…
Using penalties instead of rewards: Solving OCST problems with guided local search
2012
Abstract This paper considers the optimal communication spanning tree (OCST) problem. Previous work analyzed features of high-quality solutions and found that edges in optimal solutions have low weight and point towards the center of a tree. Consequently, integrating this problem-specific knowledge into a metaheuristic increases its performance for the OCST problem. In this paper, we present a guided local search (GLS) approach which dynamically changes the objective function to guide the search process into promising areas. In contrast to traditional approaches which reward promising solution features by favoring edges with low weights pointing towards the tree’s center, GLS penalizes low-…
Resource-constrained project scheduling: A critical activity reordering heuristic
2003
Abstract In this paper, we present a new metaheuristic algorithm for the resource-constrained project-scheduling problem. The procedure is a non-standard implementation of fundamental concepts of tabu search without explicitly using memory structures embedded in a population-based framework. The procedure makes use of a fan search strategy to intensify the search, whereas a strategic oscillation mechanism loosely related to the forward/backward technique provides the necessary diversification. Our implementation employs the topological order (TO) representation of schedules. To explore the TO vector space we introduce three types of moves, two of them based on the concept of relative critic…
Convergence for varying measures in the topological case
2023
In this paper convergence theorems for sequences of scalar, vector and multivalued Pettis integrable functions on a topological measure space are proved for varying measures vaguely convergent.
A Non-Local Two Dimensional Foundation Model
2012
Classical foundation models such as the Pasternak and the Reissner models have been recently reformulated within the framework of non-local mechanics, by using the gradient theory of elasticity. To contribute to the research effort in this field, this paper presents a two-dimensional foundation model built by using a mechanically based non-local elasticity theory, recently proposed by the authors. The foundation is thought of as an ensemble of soil column elements resting on an elastic base. It is assumed that each column element is acted upon by a local Winkler-like reaction force exerted by the elastic base, by contact shear forces and volume forces due, respectively, to adjacent and non-…
Some observations on the regularizing field for gradient damage models
2000
Gradient enhanced material models can potentially preserve well-posedness of incremental boundary value problems also after the onset of strain softening. Gradient dependent constitutive relations are rooted in the assumption that some scalar or tensor field, which appears in the yield function, has to be enriched by adding a term involving its second-order gradient field. For gradient-dependent plasticity this term is universally accepted to be the equivalent plastic strain. For gradient-dependent damage models different choices have been presented in the literature. They all possess the desired regularization of the solution, but they are not identical as regards the structural response. …
The Influence of Business Ecosystems on Innovation-Based Industries: A Research on the Mechanical Sector in Italy
2018
The business ecosystem perspective can be considered as a more advanced point of view for interpreting the development of local economic systems, if compared to more traditional concepts such as clusters, industrial districts, local or regional systems, and local networks. The business ecosystem perspective allows to better highlight the adaptive and evolutionary nature of local systems in front of the changing external environment and dynamics on national and international markets. The aim of the research was to analyze the key characteristics of firms belonging to a local business ecosystem specialized on an innovation-driven industry – the mechanical sector – in order to verify which kin…