Saved in:
Bibliographic Details
Main Author: Davis, Ethan
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.05027
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916991453888512
author Davis, Ethan
author_facet Davis, Ethan
contents We introduce a framework for applying metaheuristic algorithms, such as ant colony optimization (ACO), to combinatorial optimization problems (COPs) like the traveling salesman problem (TSP). The framework consists of three sequential stages: broad exploration of the parameter space, exploitation of top-performing parameters, and uncertainty quantification (UQ) to assess the reliability of results. As a case study, we apply ACO to the TSPLIB berlin52 dataset, which has a known optimal tour length of 7542. Using our framework, we calculate that the probability of ACO finding the global optimum is approximately 1/40 in a single run and improves to 1/5 when aggregated over ten runs.
format Preprint
id arxiv_https___arxiv_org_abs_2510_05027
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Exploration-Exploitation-Evaluation (EEE): A Framework for Metaheuristic Algorithms in Combinatorial Optimization
Davis, Ethan
Neural and Evolutionary Computing
We introduce a framework for applying metaheuristic algorithms, such as ant colony optimization (ACO), to combinatorial optimization problems (COPs) like the traveling salesman problem (TSP). The framework consists of three sequential stages: broad exploration of the parameter space, exploitation of top-performing parameters, and uncertainty quantification (UQ) to assess the reliability of results. As a case study, we apply ACO to the TSPLIB berlin52 dataset, which has a known optimal tour length of 7542. Using our framework, we calculate that the probability of ACO finding the global optimum is approximately 1/40 in a single run and improves to 1/5 when aggregated over ten runs.
title Exploration-Exploitation-Evaluation (EEE): A Framework for Metaheuristic Algorithms in Combinatorial Optimization
topic Neural and Evolutionary Computing
url https://arxiv.org/abs/2510.05027