Search results for " algorithm"

A Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

2009

In this paper, we discuss the idea of incorporating preference information into evolutionary multi-objective optimization and propose a preference-based evolutionary approach that can be used as an integral part of an interactive algorithm. One algorithm is proposed in the paper. At each iteration, the decision maker is asked to give preference information in terms of his or her reference point consisting of desirable aspiration levels for objective functions. The information is used in an evolutionary algorithm to generate a new population by combining the fitness function and an achievement scalarizing function. In multi-objective optimization, achievement scalarizing functions are widel…

An advanced pavement management system based on a genetic algorithm for a motorway network

2013

Maintenance and improvement, through the rehabilitation, of the road infrastructure is a strategic and priority objective for road agencies, nevertheless the economic resources required are often inadequate. Within road management, the pavement management system (PMS) plays an essential role because of both the money needed and the performance that should be provided in terms of safety, ride quality and transport cost. The PMS is based on searching for a balanced solution between the lowest cost and the increased level of performance (i.e. pavement condition). In this paper a PMS multi-objective optimization method, was proposed, using a genetic algorithm (GA) to identify the best solution …

A Study of Nash-Evolutionary Algorithms for Reconstruction Inverse Problems in Structural Engineering

2014

In this paper we deal with solving inverse problems in structural engineering (both the reconstruction inverse problem and the fully stressed design problem are considered). We apply a game-theory based Nash-evolutionary algorithm and compare it with the standard panmictic evolutionary algorithm. The procedure performance is analyzed on a ten bar sized test case of discrete real cross-section types structural frame, where a significant increase of performance is achieved using the Nash approach, even achieving super-linear speed-up.

A Domain Decomposition/Nash Equilibrium Methodology for the Solution of Direct and Inverse Problems in Fluid Dynamics with Evolutionary Algorithms

2008

Obtaining the best value for money in adaptive sequential estimation

2010

Abstract In [Kujala, J. V., Richardson, U., & Lyytinen, H. (2010). A Bayesian-optimal principle for learner-friendly adaptation in learning games. Journal of Mathematical Psychology , 54(2), 247–255], we considered an extension of the conventional Bayesian adaptive estimation framework to situations where each observable variable is associated with a certain random cost of observation. We proposed an algorithm that chooses each placement by maximizing the expected gain in utility divided by the expected cost. In this paper, we formally justify this placement rule as an asymptotically optimal solution to the problem of maximizing the expected utility of an experiment that terminates when the…

Combinatorial Gray codes for classes of pattern avoiding permutations

2007

The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.

Mappings of finite distortion: The sharp modulus of continuity

2003

We establish an essentially sharp modulus of continuity for mappings of subexponentially integrable distortion.

Computing continuous numerical solutions of matrix differential equations

1995

Abstract In this paper, we construct analytical approximate solutions of initial value problems for the matrix differential equation X ′( t ) = A ( t ) X ( t ) + X ( t ) B ( t ) + L ( t ), with twice continuously differentiable functions A ( t ), B ( t ), and L ( t ), continuous. We determine, in terms of the data, the existence interval of the problem. Given an admissible error e, we construct an approximate solution whose error is smaller than e uniformly, in all the domain.

A recurrence-free variant of strassen’s algorithm on hypercube

1995

In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algorithm is suitable to run on parallel environments. Two computational schemes have been worked out exploiting different parallel approaches on hypercube architecture. A comparative analysis is reported. The experiments have been carried out on an nCUBE-2 supercomputer, housed at CNUCE in Pisa, supporting the Express parallel operating system. © 1995, Taylor & Francis Group, LLC. All rights reserved.

On the methodologies for the calibration of static electricity meters in the presence of harmonic distortion

2010

This paper is focused on the problems related to the calibration of static electricity meters with nonsinusoidal test waveforms. This is an up-to-date issue since the harmonic distortion levels are ever increasing, especially in low-voltage power systems, and in such conditions the performances of the modern static electricity meters can be negatively affected, depending on the implemented measurement algorithm. Thus it is important to test the meters with nonsinusoidal waveforms. The paper analyzes the problems related to both the choice of the test signals to be used for calibration and the implemented metric, with a particular focus on the reactive energy meters. The analysis is supporte…