Memetic Tabu Search: Hybrid Optimization

Updated 1 February 2026

MTS is a metaheuristic that blends population-based recombination and mutation with a deterministic tabu search to efficiently explore solution spaces.
It addresses complex problems like LABS, graph coloring, and multi-objective optimization through targeted local improvement and GPU-parallel strategies.
Quantum-enhanced variants using DCQO seeding offer improved time-to-solution scaling, pushing forward the frontier in combinatorial optimization.

Memetic Tabu Search (MTS) is a metaheuristic optimization framework that hybridizes evolutionary (memetic) population models with deterministic local improvement via tabu search. Originally applied to challenging binary and combinatorial optimization problems, MTS combines global exploration via recombination and mutation with targeted intensification using adaptive tabu memory, consistently yielding state-of-the-art results across paradigmatic testbeds such as low-autocorrelation binary sequences (LABS), minimum sum coloring, and multi-objective function optimization. Quantum-enhanced variants that leverage digitized counterdiabatic quantum optimization (DCQO) as a seeding mechanism demonstrate provable scaling advantages beyond classical heuristics (Cadavid et al., 6 Nov 2025, Zhang et al., 1 Apr 2025, Jin et al., 2013, Hajlaoui et al., 2011).

1. Core Algorithmic Structure

The canonical Memetic Tabu Search framework consists of a population-based memetic layer, a recombination operator (such as crossover), mutation with tunable probability, and a local improvement step driven by short-term tabu search. For binary optimization (e.g., the LABS problem), each solution is a binary vector (spin sequence) $s \in \{\pm 1\}^N$ ; for graph coloring, a solution is an integer vector representing vertex assignments; for multi-objective settings, solutions may be bitstrings or higher-dimensional encodings.

A generic MTS generation proceeds as follows:

Population evolution: With probability $p_{\text{comb}}$ , select and recombine two parents via crossover; otherwise, copy a random individual.
Mutation: Each bit is mutated with probability $p_{\text{mut}}$ .
Local improvement: The offspring undergoes a bounded tabu search, which performs iterative one-bit flips (or equivalent moves) subject to a tabu list forbidding recently visited states.
Replacement and elitism: The improved offspring replaces a random individual in the population; global best is updated if improvement is observed.
Termination: Iteration halts when a solution matching a known optimum or target threshold is found, or when the generation limit $G_{\max}$ is reached.

Pseudocode (LABS flavor) (Cadavid et al., 6 Nov 2025, Zhang et al., 1 Apr 2025):

Algorithm MTS(N, K, p_comb, p_mut, G_max)
  Initialize population P of size K with random sequences
  s* ← best in P
  For generation g=1…G_max:
    With probability p_comb:
      select parents p1, p2 by tournament
      c ← crossover(p1, p2)
    Else:
      c ← random member of P
    c ← mutate(c, p_mut)
    c' ← TabuSearch(c)  # local improvement
    if E(c') < E(s*): s* ← c'
    replace a random member of P by c'
    if E(s*) = E_opt: break
  Return s*

2. Tabu Search Subroutine

Within MTS, the tabu search operates on the child solution by iteratively exploring its neighborhood, forbidding recently altered features by a tabu tenure and maintaining a list to prevent short cycles.

For LABS-type problems:

Neighborhood: all one-bit flips, $s \oplus e_i$ .
Move evaluation: energy difference $\Delta E_i$ per flip, computed in $\mathcal{O}(N)$ via partial sums.
Tabu mechanism: After flipping bit $i$ at step $t$ , set $\text{TabuList}[i]=t+\tau$ , where $\tau$ is randomly drawn from $[\theta_{\min}, \theta_{\max}]$ .
Acceptance: always accept the best non-tabu move; override tabu if the move improves the global best ("aspiration").
Termination: fixed iteration budget $M \in [N/2, 3N/2]$ .

In graph coloring (MSCP), the DNTS local improvement alternates between two neighborhoods: one-vertex moves (class transfer) and component exchanges (chain swaps), with aspiration and perturbation schemes to diversify search (Jin et al., 2013).

3. Population Recombination and Diversification

MTS leverages advanced recombination operators for population diversity and solution quality. In LABS and binary problems, crossover is typically one-point or two-point. For graph coloring, the multi-parent generalized partition crossover (MGPX) greedily constructs offspring by inheriting the largest available color classes from allowed parents, temporarily forbidding repeated inheritance to promote diversity.

Diversification is achieved at two levels:

Inline random restarts and randomized tabu tenures
Population-level perturbation (e.g., for MSCP: reallocating part of the largest color class to a new class upon stagnation) (Jin et al., 2013)
In multi-objective MTS, diversification is explicit via the Diversificator Tabu Search (DTS), which targets sparsely covered regions of the Pareto front (Hajlaoui et al., 2011).

4. Parallelization and Computational Enhancements

Recent work demonstrates the effectiveness of MTS on modern GPU architectures, exploiting both block-level and thread-level parallelism. Each replica runs an independent MTS instance (using different random seeds) in a CUDA block; threads within a block parallelize neighborhood scans and state updates. Shared memory is employed for state (tabu lists, partial sums, bit-packed sequences), enabling significant memory compression and computational acceleration.

Key empirical findings (A100 GPU, LABS problem):

Speedup factor: 8×–26× compared to 16-core CPU for $N$ up to 83.
Data packing: Sequences and upper-triangular product tables are bit-packed for minimum shared memory usage ( $\sim5$ KByte/block for $N\leq187, K=100$ ).
Early exit: Atomic global flag for termination when any replica reaches the target (Zhang et al., 1 Apr 2025).

A plausible implication is that such embarrassingly-parallel, bit-packed MTS implementations extend to other binary combinatorial problems (e.g., Max-Cut, Quadratic Assignment), provided similar locality structures exist.

Platform	Problem Size ( $N$ )	Speedup vs CPU
Nvidia A100 GPU	68	26.5×
Nvidia A100 GPU	75	∼20×
Nvidia A100 GPU	83	∼8×

5. Quantum-Enhanced Memetic Tabu Search

The integration of quantum-enhanced seeding—specifically, DCQO—into MTS (QE-MTS) produces provable scaling improvements for LABS. DCQO leverages digitized counterdiabatic evolution to generate high-quality low-energy seeds, using shallow quantum circuits (six-fold less depth than QAOA-12), and is analyzed as follows (Cadavid et al., 6 Nov 2025):

DCQO generates $n_{\text{shots}}=10^5$ bitstrings; the best is used as the initial population.
The empirical time-to-solution (TTS) scaling for MTS is $\mathcal{O}(1.34^N)$ ; DCQO-seeded QE-MTS achieves $\mathcal{O}(1.24^N)$ for $N\in[27,37]$ .
A two-stage bootstrap fit projects a conservative crossover point $N_\times \approx 46.6$ (95% CI $[44.9,48.9]$ ), above which QE-MTS outperforms classical methods even for typical quantiles.

This provides evidence that quantum enhancement can directly improve classical combinatorial optimization scaling, not only shifting the TTS intercept but reducing its exponential base.

Method	Quantile	$\kappa=\exp(\beta)$	$R^2$
QE-MTS	0.50	[1.23, 1.25]	[0.86, 0.89]
MTS	0.50	[1.36, 1.37]	[0.85, 0.87]

6. Empirical Results and Application Domains

MTS variants have set new state-of-the-art records across several domains:

LABS: GPU-parallel MTS yields new best-known merit factors for problem sizes $N=92$ –$118$ and, crucially, surpasses skew-symmetric-only methods for odd $N$ (e.g., $N=99,107$ ). This suggests that unrestricted general-purpose solvers are essential even in domains with strong combinatorial structure (Zhang et al., 1 Apr 2025).
Minimum Sum Coloring (MSCP): MTS with dual-neighborhood tabu search and multi-parent crossover improved or matched 54 of 59 tested instances, produced 17 new best bounds, and furnished first-time bounds for 18 DIMACS/COLOR instances, outperforming multiple state-of-the-art heuristics (Jin et al., 2013).
Multi-objective Optimization: MTS hybridized with a Strength Pareto Evolutionary Algorithm (COMOEATS) enhances contribution and entropy on ZDT benchmarks, effectively covering under-explored regions of Pareto fronts (Hajlaoui et al., 2011).

Domain	Achievements	Paper
LABS	New best-known merit factors for N=92–118; proved non-optimality of skew-symmetry for odd N	(Zhang et al., 1 Apr 2025)
Graph coloring	State-of-the-art bounds, high performance on large graphs	(Jin et al., 2013)
Multi-objective	Enhanced Pareto front coverage and uniformity	(Hajlaoui et al., 2011)
LABS + quantum	Reduced TTS scaling base from ∼1.37 to ∼1.24, crossover at N~47	(Cadavid et al., 6 Nov 2025)

7. Implementation Considerations and Generalization

Key implementation techniques include bit-packed representations for efficient memory usage, CUDA block/thread mapping for replica and intra-replica parallelism, randomized local-search budgets and tabu tenures for diversification, and atomic flags for rapid global shutdown.

Portability guidelines for applying MTS to other binary optimization problems are:

Use a population-based framework with independent search replicas.
Structure local neighborhoods so that move score differences can be updated in $O(1)$ or $O(n)$ .
Employ data-packing and tune kernel/block/thread resources to problem size and hardware limits.
Parameterize tabu and local-search strategies per-replica.
Integrate problem-specific initializers where available for improved population seeding.

A plausible implication is that the combinatorial and parallelization principles of MTS are extensible to general 0–1 QUBO models and large-scale CSPs, provided efficient local-update schemes and neighborhood evaluations are available.

8. Significance, Challenges, and Future Directions

MTS demonstrates that the combination of memetic exploration and tabu-driven intensification yields scalable, general-purpose solvers for hard combinatorial problems. Quantum-enhanced versions establish that classical heuristic scaling limits can be breached with systematic seeding from quantum optimization modules.

Significant findings include:

The superiority of general-purpose (non-structured) MTS strategies over methods exploiting combinatorial symmetries in certain contexts.
The critical importance of memory and computation-efficient implementations for reaching intractable regimes ( $N>100$ ).
The value of hybrid frameworks (COMOEATS) in multi-objective problems for balanced coverage and convergence.

Challenges remain for highly structured dense problems, and empirical evidence motivates further research on adaptive parameter control, advanced neighborhood moves (e.g., Kempe chains), and integration with constraint-programming paradigms. Quantum–classical hybridization is established as a promising trajectory for further reducing computational scaling exponents in combinatorial optimization.

For foundational algorithms, empirical data, parallelization strategies, and quantum-classical integration, see (Cadavid et al., 6 Nov 2025, Zhang et al., 1 Apr 2025, Jin et al., 2013, Hajlaoui et al., 2011).