Related Experiment Video
Updated: Jan 27, 2026

Determination of Plasma Membrane Partitioning for Peripherally-associated Proteins
Published on: June 15, 2018
A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima
Renato Tinós1, Darrell Whitley2, Gabriela Ochoa3
1Department of Computing and Mathematics, University of São Paulo, Ribeirão Preto, SP, Brazil rtinos@ffclrp.usp.br.
Abstract:
Generalized Partition Crossover (GPX) is a deterministic recombination operator developed for the Traveling Salesman Problem. Partition crossover operators return the best of reachable offspring, where is the number of recombining components. This article introduces a new GPX2 operator, which finds more recombining components than GPX or Iterative Partial Transcription (IPT). We also show that GPX2 has O() runtime complexity, while also introducing new enhancements to reduce the execution time of GPX2. Finally, we experimentally demonstrate the efficiency of GPX2 when it is used to improve solutions found by the multitrial Lin-Kernighan-Helsgaum (LKH) algorithm. Significant improvements in performance are documented on large () and very large () instances of the Traveling Salesman Problem.
Related Concept Videos
Travelling Waves
Water waves, sound waves, and seismic waves are some examples of mechanical waves. For water waves, the wave propagation medium is...
Crossover Experiments
Crossover designs are performed even with smaller sample sizes since the samples can act as their controls. These are better than simple randomized trials since patients are exposed to all the treatments.
Traveling Waves: Lossless Lines
Generalized Hooke's Law
Generalized Anxiety Disorder
Social Foundations of Self II: The Generalized Other

