278 research outputs found
When is it Beneficial to Reject Improvements?
We investigate two popular trajectory-based algorithms from biology and physics to answer a question of general significance: when is it beneficial to reject improvements? A distinguishing factor of SSWM (Strong Selection Weak Mutation), a popular model from population genetics, compared to the Metropolis algorithm (MA), is that the former can reject improvements, while the latter always accepts them. We investigate when one strategy outperforms the other. Since we prove that both algorithms converge to the same stationary distribution, we concentrate on identifying a class of functions inducing large mixing times, where the algorithms will outperform each other over a long period of time. The outcome of the analysis is the definition of a function where SSWM is efficient, while Metropolis requires at least exponential time
An immune algorithm based fuzzy predictive modeling mechanism using variable length coding and multi-objective optimization allied to engineering materials processing
In this paper, a systematic multi-objective fuzzy
modeling approach is proposed, which can be regarded
as a three-stage modeling procedure. In the first stage, an
evolutionary based clustering algorithm is developed to
extract an initial fuzzy rule base from the data. Based on
this model, a back-propagation algorithm with momentum
terms is used to refine the initial fuzzy model. The refined
model is then used to seed the initial population of an
immune inspired multi-objective optimization algorithm
in the third stage to obtain a set of fuzzy models with
improved transparency. To tackle the problem of
simultaneously optimizing the structure and parameters, a
variable length coding scheme is adopted to improve the
efficiency of the search. The proposed modeling approach
is applied to a real data set from the steel industry.
Results show that the proposed approach is capable of
eliciting not only accurate but also transparent fuzzy
models
Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems
Memetic algorithms are popular hybrid search heuristics that integrate
local search into the search process of an evolutionary algorithm
in order to combine the advantages of rapid exploitation and global
optimisation. However, these algorithms are not well understood and
the field is lacking a solid theoretical foundation that explains when
and why memetic algorithms are effective.
We provide a rigorous runtime analysis of a simple memetic algorithm,
the (1+1) MA, on the Hurdle problem class, a landscape class
of tuneable difficulty that shows a “big valley structure”, a characteristic
feature of many hard problems from combinatorial optimisation.
The only parameter of this class is the hurdle width w, which describes
the length of fitness valleys that have to be overcome. We show
that the (1+1) EA requires Θ(n
w) expected function evaluations to
find the optimum, whereas the (1+1) MA with best-improvement and
first-improvement local search can find the optimum in Θ(n
2 +n
3/w2
)
and Θ(n
3/w2
) function evaluations, respectively. Surprisingly, while
increasing the hurdle width makes the problem harder for evolutionary
algorithms, the problem becomes easier for memetic algorithms.
We discuss how these findings can explain and illustrate the success of
memetic algorithms for problems with big valley structures
How to Escape Local Optima in Black Box Optimisation: When Non-elitism Outperforms Elitism
Escaping local optima is one of the major obstacles to function optimisation. Using the metaphor of a fitness landscape, local optima correspond to hills separated by fitness valleys that have to be overcome. We define a class of fitness valleys of tunable difficulty by considering their length, representing the Hamming path between the two optima and their depth, the drop in fitness. For this function class we present a runtime comparison between stochastic search algorithms using different search strategies. The ((Formula presented.)) EA is a simple and well-studied evolutionary algorithm that has to jump across the valley to a point of higher fitness because it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population genetics, are both able to cross the fitness valley by accepting worsening moves. We show that the runtime of the ((Formula presented.)) EA depends critically on the length of the valley while the runtimes of the non-elitist algorithms depend crucially on the depth of the valley. Moreover, we show that both SSWM and Metropolis can also efficiently optimise a rugged function consisting of consecutive valleys
Imitating individualized facial expressions in a human-like avatar through a hybrid particle swarm optimization - tabu search algorithm
This thesis describes a machine learning method for automatically imitating a particular person\u27s facial expressions in a human-like avatar through a hybrid Particle Swarm Optimization - Tabu Search algorithm. The muscular structures of the facial expressions are measured by Ekman and Friesen\u27s Facial Action Coding System (FACS). Using a neutral face as a reference, the minute movements of the Action Units, used in FACS, are automatically tracked and mapped onto the avatar using a hybrid method. The hybrid algorithm is composed of Kennedy and Eberhart\u27s Particle Swarm Optimization algorithm (PSO) and Glover\u27s Tabu Search (TS). Distinguishable features portrayed on the avatar ensure a personalized, realistic imitation of the facial expressions. To evaluate the feasibility of using PSO-TS in this approach, a fundamental proof-of-concept test is employed on the system using the OGRE avatar. This method is analyzed in-depth to ensure its proper functionality and evaluate its performance compared to previous work
Chaotic Quantum Double Delta Swarm Algorithm using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues
Quantum Double Delta Swarm (QDDS) Algorithm is a new metaheuristic algorithm
inspired by the convergence mechanism to the center of potential generated
within a single well of a spatially co-located double-delta well setup. It
mimics the wave nature of candidate positions in solution spaces and draws upon
quantum mechanical interpretations much like other quantum-inspired
computational intelligence paradigms. In this work, we introduce a Chebyshev
map driven chaotic perturbation in the optimization phase of the algorithm to
diversify weights placed on contemporary and historical, socially-optimal
agents' solutions. We follow this up with a characterization of solution
quality on a suite of 23 single-objective functions and carry out a comparative
analysis with eight other related nature-inspired approaches. By comparing
solution quality and successful runs over dynamic solution ranges, insights
about the nature of convergence are obtained. A two-tailed t-test establishes
the statistical significance of the solution data whereas Cohen's d and Hedge's
g values provide a measure of effect sizes. We trace the trajectory of the
fittest pseudo-agent over all function evaluations to comment on the dynamics
of the system and prove that the proposed algorithm is theoretically globally
convergent under the assumptions adopted for proofs of other closely-related
random search algorithms.Comment: 27 pages, 4 figures, 19 table
Planning and reconfigurable control of a fleet of unmanned vehicles for taxi operations in airport environment
The optimization of airport operations has gained increasing interest by the aeronautical community, due to the substantial growth in the number of airport movements (landings and take-offs) experienced in the past decades all over the world. Forecasts have confirmed this trend also for the next decades. The result of the expansion of air traffic is an increasing congestion of airports, especially in taxiways and runways, leading to additional amount of fuel burnt by airplanes during taxi operations, causing additional pollution and costs for airlines. In order to reduce the impact of taxi operations, different solutions have been proposed in literature; the solution which this dissertation refers to uses autonomous electric vehicles to tow airplanes between parking lots and runways. Although several analyses have been proposed in literature, showing the feasibility and the effectiveness of this approach in reducing the environmental impact, at the beginning of the doctoral activity no solutions were proposed, on how to manage the fleet of unmanned vehicles inside the airport environment. Therefore, the research activity has focused on the development of algorithms able to provide pushback tractor (also referred as tugs) autopilots with conflict-free schedules. The main objective of the optimization algorithms is to minimize the tug energy consumption, while performing just-in-time runway operations: departing airplanes are delivered only when they can take-off and the taxi-in phase starts as soon as the aircraft clears the runway and connects to the tractor. Two models, one based on continuous time and one on discrete time evolution, were developed to simulate the taxi phases within the optimization scheme. A piecewise-linear model has also been proposed to evaluate the energy consumed by the tugs during the assigned missions. Furthermore, three optimization algorithms were developed: two hybrid versions of the particle swarm optimization and a tree search heuristic. The following functional requirements for the management algorithm were defined: the optimization model must be easily adapted to different airports with different layout
(reconfigurability); the generated schedule must always be conflict-free; and the computational time required to process a time horizon of 1h must be less than 15min. In order to improve its performance, the particle swarm optimization was hybridized with a hill-climb meta-heuristic; a second hybridization was performed by means of the random variable search, an algorithm of the family of the variable neighborhood search. The neighborhood size for the random variable search was considered varying with inverse proportionality to the distance between the actual considered solution and the optimal one found so far. Finally, a tree search heuristic
was developed to find the runway sequence, among all the possible sequences of take-offs and landings for a given flight schedule, which can be realized with a series of taxi trajectories that require minimum energy consumption. Given the taxi schedule generated by the aforementioned optimization algorithms a tug dispatch algorithm, assigns a vehicle to each mission. The three optimization schemes and the two mathematical models were tested on several test cases among three airports: the Turin-Caselle airport, the Milan-Malpensa airport, and the Amsterdam airport Schiphol. The cost required to perform the generated schedules using the autonomous tugs was compared to the cost required to perform the taxi using the aircraft engines. The proposed approach resulted always more convenient than the classical one
- …