Perfect Edge-Transmitting Recombination of Permutations
- URL: http://arxiv.org/abs/2005.01113v1
- Date: Sun, 3 May 2020 15:15:49 GMT
- Title: Perfect Edge-Transmitting Recombination of Permutations
- Authors: Adriaan Merlevede and Carl Troein
- Abstract summary: We derive an algorithm for crossover of permutations that achieves perfect transmission of edges.
We also describe a modification of the algorithm that generates the mathematically optimal offspring for the asymmetric travelling salesman problem.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Crossover is the process of recombining the genetic features of two parents.
For many applications where crossover is applied to permutations, relevant
genetic features are pairs of adjacent elements, also called edges in the
permutation order. Recombination of edges without errors is thought to be an
NP-hard problem, typically approximated by heuristics that either introduce new
edges or are only able to produce a small variety of offspring. Here, we derive
an algorithm for crossover of permutations that achieves perfect transmission
of edges and produces a uniform sampling of all possible offspring, in
quadratic average computation time. The algorithm and its derivation reveal a
link between cycle crossover (CX) and edge assembly crossover (EAX), offering a
new perspective on these well-established algorithms. We also describe a
modification of the algorithm that generates the mathematically optimal
offspring for the asymmetric travelling salesman problem.
Related papers
- Accelerating Cutting-Plane Algorithms via Reinforcement Learning
Surrogates [49.84541884653309]
A current standard approach to solving convex discrete optimization problems is the use of cutting-plane algorithms.
Despite the existence of a number of general-purpose cut-generating algorithms, large-scale discrete optimization problems continue to suffer from intractability.
We propose a method for accelerating cutting-plane algorithms via reinforcement learning.
arXiv Detail & Related papers (2023-07-17T20:11:56Z) - A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman
Problem [0.9790236766474201]
This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP)
A novel crossover operator is designed to combine similar tours from two parents and offers great diversity for the population.
Our algorithm outperforms all existing algorithms on average, with similar cutoff time thresholds, when tested against benchmark sets.
arXiv Detail & Related papers (2023-07-14T01:57:10Z) - Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications.
This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
arXiv Detail & Related papers (2023-01-30T15:46:39Z) - Kernelized multi-graph matching [0.0]
We introduce a novel kernelized multigraph matching technique that handles both the attributes of the pair and the edges of the graphs.
We propose several projectors leading to improved stability of the results.
arXiv Detail & Related papers (2022-10-11T07:22:47Z) - Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity.
We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
arXiv Detail & Related papers (2022-03-01T19:47:16Z) - Regularization for Shuffled Data Problems via Exponential Family Priors
on the Permutation Group [8.40077201352607]
"Shuffled data" is data in which the correct pairing of (X, Y)-pairs is represented via an unknown index permutation.
We propose a flexible exponential family prior on the permutation group for this purpose.
Inference is based on the EM algorithm in which the intractable E-step is approximated by the Fisher-Yates algorithm.
arXiv Detail & Related papers (2021-11-02T17:43:28Z) - Sparse Quadratic Optimisation over the Stiefel Manifold with Application
to Permutation Synchronisation [71.27989298860481]
We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function.
We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
arXiv Detail & Related papers (2021-09-30T19:17:35Z) - Hybrid Trilinear and Bilinear Programming for Aligning Partially
Overlapping Point Sets [85.71360365315128]
In many applications, we need algorithms which can align partially overlapping point sets are invariant to the corresponding corresponding RPM algorithm.
We first show that the objective is a cubic bound function. We then utilize the convex envelopes of trilinear and bilinear monomial transformations to derive its lower bound.
We next develop a branch-and-bound (BnB) algorithm which only branches over the transformation variables and runs efficiently.
arXiv Detail & Related papers (2021-01-19T04:24:23Z) - Benchmarking a $(\mu+\lambda)$ Genetic Algorithm with Configurable
Crossover Probability [4.33419118449588]
We investigate a family of $(mu+lambda)$ Genetic Algorithms (GAs) which creates offspring either from mutation or by recombining two randomly chosen parents.
By scaling the crossover probability, we can thus interpolate from a fully mutation-only algorithm towards a fully crossover-based GA.
arXiv Detail & Related papers (2020-06-10T15:22:44Z) - Optimal Randomized First-Order Methods for Least-Squares Problems [56.05635751529922]
This class of algorithms encompasses several randomized methods among the fastest solvers for least-squares problems.
We focus on two classical embeddings, namely, Gaussian projections and subsampled Hadamard transforms.
Our resulting algorithm yields the best complexity known for solving least-squares problems with no condition number dependence.
arXiv Detail & Related papers (2020-02-21T17:45:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.