Property analysis of symmetric travelling salesman problem instances acquired through evolution
J. I. van Hemert
Abstract
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling sale sman problem.
Create a lesson
Related papers
DyssomniaNN: Multi-Scale Spiking Neural Modeling of Human Sleep Disorders and Perceived Restedness
Daniel Szelogowski
REMBGO for Evaluation-Limited Optimization: CEC2022 Benchmarking and EAF-STATCOM Generalization
Vikram Chekuri, Narapareddy Ramarao, Prashanth N A
Learning to Orchestrate Evolutionary Search: Progression-Aware Deep Reinforcement Learning for Dynamic DE-CMA-ES Coordination in Optimization and Structural Model Updating
Lechen Li, Rongye Shi, Wanhuan Zhou
Evolutionary Architecture Search for Chlorophyll-a Prediction in Lakes using Sentinel-2
Kursat Komurcu, Linas Petkevicius
The Modular CMA-ES: A Framework for Modern Evolution Strategies
Jacob de Nobel, Diederick Vermetten, Anna V. Kononova et al.
Relocating Nonlinearity: How a Downstream Learner Reshapes What Genetic Programming Must Evolve
Nam H. Le