67,498 research outputs found
A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms
Bi-level optimisation problems have gained increasing interest in the field
of combinatorial optimisation in recent years. With this paper, we start the
runtime analysis of evolutionary algorithms for bi-level optimisation problems.
We examine two NP-hard problems, the generalised minimum spanning tree problem
(GMST), and the generalised travelling salesman problem (GTSP) in the context
of parameterised complexity.
For the generalised minimum spanning tree problem, we analyse the two
approaches presented by Hu and Raidl (2012) with respect to the number of
clusters that distinguish each other by the chosen representation of possible
solutions. Our results show that a (1+1) EA working with the spanning nodes
representation is not a fixed-parameter evolutionary algorithm for the problem,
whereas the global structure representation enables to solve the problem in
fixed-parameter time. We present hard instances for each approach and show that
the two approaches are highly complementary by proving that they solve each
other's hard instances very efficiently.
For the generalised travelling salesman problem, we analyse the problem with
respect to the number of clusters in the problem instance. Our results show
that a (1+1) EA working with the global structure representation is a
fixed-parameter evolutionary algorithm for the problem
The random link approximation for the Euclidean traveling salesman problem
The traveling salesman problem (TSP) consists of finding the length of the
shortest closed tour visiting N ``cities''. We consider the Euclidean TSP where
the cities are distributed randomly and independently in a d-dimensional unit
hypercube. Working with periodic boundary conditions and inspired by a
remarkable universality in the kth nearest neighbor distribution, we find for
the average optimum tour length = beta_E(d) N^{1-1/d} [1+O(1/N)] with
beta_E(2) = 0.7120 +- 0.0002 and beta_E(3) = 0.6979 +- 0.0002. We then derive
analytical predictions for these quantities using the random link
approximation, where the lengths between cities are taken as independent random
variables. From the ``cavity'' equations developed by Krauth, Mezard and
Parisi, we calculate the associated random link values beta_RL(d). For d=1,2,3,
numerical results show that the random link approximation is a good one, with a
discrepancy of less than 2.1% between beta_E(d) and beta_RL(d). For large d, we
argue that the approximation is exact up to O(1/d^2) and give a conjecture for
beta_E(d), in terms of a power series in 1/d, specifying both leading and
subleading coefficients.Comment: 29 pages, 6 figures; formatting and typos correcte
Convergence of Gradient Descent for Low-Rank Matrix Approximation
This paper provides a proof of global convergence of gradient search for low-rank matrix approximation. Such approximations have recently been of interest for large-scale problems, as well as for dictionary learning for sparse signal representations and matrix completion. The proof is based on the interpretation of the problem as an optimization on the Grassmann manifold and Fubiny-Study distance on this space
Recommended from our members
Genetic algorithm approach to find the best input variable partitioning
Conference PaperThis paper presents a variable partition algorithm which combines the quasi-reduced ordered multiple-terminal multiple-valued decision diagrams and genetic algorithms (GAs). The algorithm is better than the previous techniques which find a good functional decomposition by non-exhaustive search and expands the range of searching for the best decomposition providing the optimal subtable multiplicity. The possible solutions are evaluated using the gain of decomposition for a multiple-output multiple-valued logic function. The distinct feature of GA is the possible solutions being coded by real numbers. Here the simplex-based crossover is proposed to use for the recombination stage of GA. It permits to increase the GA coverag
A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)
Constrained Optimum Path (COP) problems appear in many real-life
applications, especially on communication networks. Some of these problems have
been considered and solved by specific techniques which are usually difficult
to extend. In this paper, we introduce a novel local search modeling for
solving some COPs by local search. The modeling features the compositionality,
modularity, reuse and strengthens the benefits of Constrained-Based Local
Search. We also apply the modeling to the edge-disjoint paths problem (EDP). We
show that side constraints can easily be added in the model. Computational
results show the significance of the approach
- …