31 research outputs found
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to their theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed time budget. We follow this approach and present a fixed budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1 + 1) EA and (1 + λ) EA algorithms for the TSP in a smoothed complexity setting and derive the lower bounds of the expected fitness gain for a specified number of generations
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
A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem
Understanding the behaviour of well-known algorithms for classical NP-hard optimisation problems is still a difficult task. With this paper, we contribute to this research direction and carry out a feature based comparison of local search and the well-known Christofides approximation algorithm for the Traveling Salesperson Problem. We use an evolutionary algorithm approach to construct easy and hard instances for the Christofides algorithm, where we measure hardness in terms of approximation ratio. Our results point out important features and lead to hard and easy instances for this famous algorithm. Furthermore, our cross-comparison gives new insights on the complementary benefits of the different approaches.Samadhi Nallaperuma, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf Mersmann, Heike Trautmannhttp://www.sigevo.org/foga-2013
Recommended from our members
Optimal control and energy storage for DC electric train systems using evolutionary algorithms
Funder: Engineering and Physical Sciences Research Council; doi: http://dx.doi.org/10.13039/501100000266AbstractElectrified railways are becoming a popular transport medium and these consume a large amount of electrical energy. Environmental concerns demand reduction in energy use and peak power demand of railway systems. Furthermore, high transmission losses in DC railway systems make local storage of energy an increasingly attractive option. An optimisation framework based on genetic algorithms is developed to optimise a DC electric rail network in terms of a comprehensive set of decision variables including storage size, charge/discharge power limits, timetable and train driving style/trajectory to maximise benefits of energy storage in reducing railway peak power and energy consumption. Experimental results for the considered real-world networks show a reduction of energy consumption in the range 15%–30% depending on the train driving style, and reduced power peaks.</jats:p
Optical network physical layer parameter optimization for digital backpropagation using Gaussian processes
We present a novel methodology for optimizing fiber optic network performance by determining the ideal values for attenuation, nonlinearity, and dispersion parameters in terms of achieved signal-to-noise ratio (SNR) gain from digital backpropagation (DBP). Our approach uses Gaussian process regression, a probabilistic machine learning technique, to create a computationally efficient model for mapping these parameters to the resulting SNR after applying DBP. We then use simplicial homology global optimization to find the parameter values that yield maximum SNR for the Gaussian process model within a set of a priori bounds. This approach optimizes the parameters in terms of the DBP gain at the receiver. We demonstrate the effectiveness of our method through simulation and experimental testing, achieving optimal estimates of the dispersion, nonlinearity, and attenuation parameters. Our approach also highlights the limitations of traditional one-at-a-time grid search methods and emphasizes the interpretability of the technique. This methodology has broad applications in engineering and can be used to optimize performance in various systems beyond optical networks
Optimisation of Signal Timings in a Road Network
This is the author accepted manuscript. The final version is available from Springer via the DOI in this recordRoad network simulation models and tools are increasingly being used for strategic and operational traffic management with the use of widely available online traffic data. The widespread use of such models raises the prospect of transport system optimisation, improving energy consumption, delays and carbon emissions. Although strategic interventions such as the building of new roads or infrastructure is costly and time-consuming, significant savings can be made through the modelling and optimisation of the operation of the network through signal timings.Innovate U
Improved Fixed-Budget Results via Drift Analysis
Fixed-budget theory is concerned with computing or bounding the fitness value
achievable by randomized search heuristics within a given budget of fitness
function evaluations. Despite recent progress in fixed-budget theory, there is
a lack of general tools to derive such results. We transfer drift theory, the
key tool to derive expected optimization times, to the fixed-budged
perspective. A first and easy-to-use statement concerned with iterating drift
in so-called greed-admitting scenarios immediately translates into bounds on
the expected function value. Afterwards, we consider a more general tool based
on the well-known variable drift theorem. Applications of this technique to the
LeadingOnes benchmark function yield statements that are more precise than the
previous state of the art.Comment: 25 pages. An extended abstract of this paper will be published in the
proceedings of PPSN 202
Application of Metaheuristics in Signal Optimisation of Transportation Networks: A Comprehensive Survey
This is the author accepted manuscript. The final version is available from Elsevier via the DOI in this record.With rapid population growth, there is an urgent need for intelligent traffic control techniques in urban transportation networks to improve the network performance. In an urban transportation network, traffic signals have a significant effect on reducing congestion, improving safety, and improving environmental pollution. In recent years, researchers have been applied metaheuristic techniques for signal timing optimisation as one of the practical solution to enhance the performance of the transportation networks. Current study presents a comprehensive survey of such techniques and tools used in signal optimisation of transportation networks, providing a categorisation of approaches, discussion, and suggestions for future research
Feature-based diversity optimization for problem instance classification
Parallel Problem Solving from Nature – PPSN XIVUnderstanding the behaviour of heuristic search methods is a challenge. This even holds for simple local search methods such as 2-OPT for the Traveling Salesperson problem. In this paper, we present a general framework that is able to construct a diverse set of instances that are hard or easy for a given search heuristic. Such a diverse set is obtained by using an evolutionary algorithm for constructing hard or easy instances that are diverse with respect to different features of the underlying problem. Examining the constructed instance sets, we show that many combinations of two or three features give a good classification of the TSP instances in terms of whether they are hard to be solved by 2-OPT.Wanru Gao, Samadhi Nallaperuma, and Frank Neuman
RoboCup 2D Soccer Simulation League: Evaluation Challenges
We summarise the results of RoboCup 2D Soccer Simulation League in 2016
(Leipzig), including the main competition and the evaluation round. The
evaluation round held in Leipzig confirmed the strength of RoboCup-2015
champion (WrightEagle, i.e. WE2015) in the League, with only eventual finalists
of 2016 competition capable of defeating WE2015. An extended, post-Leipzig,
round-robin tournament which included the top 8 teams of 2016, as well as
WE2015, with over 1000 games played for each pair, placed WE2015 third behind
the champion team (Gliders2016) and the runner-up (HELIOS2016). This
establishes WE2015 as a stable benchmark for the 2D Simulation League. We then
contrast two ranking methods and suggest two options for future evaluation
challenges. The first one, "The Champions Simulation League", is proposed to
include 6 previous champions, directly competing against each other in a
round-robin tournament, with the view to systematically trace the advancements
in the League. The second proposal, "The Global Challenge", is aimed to
increase the realism of the environmental conditions during the simulated
games, by simulating specific features of different participating countries.Comment: 12 pages, RoboCup-2017, Nagoya, Japan, July 201