Matheuristics to solve the Traveling Analyst Problem - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Matheuristics to solve the Traveling Analyst Problem

Résumé

Exploratory Data Analysis (EDA), the notoriously tedious task of interactively analyzing datasets to gain insights, has attracted a lot of attention lately in the data management community. We recently proposed a formal definition of EDA as a multi-objective optimization problem, coined the Traveling Analyst Problem (TAP) and inspired by the Orienteering Problem (OP). The present work investigates the use of matheuristics to compute near optimal solutions to the TAP. We introduce four heuristics including two Variable Partitioning Local Search matheuristics and two Local Branching matheuristics. We present the results of experiments on realistic instances of various sizes to illustrate their effectiveness.
Fichier principal
Vignette du fichier
TAP_VPLS.pdf (320.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY NC - Paternité - Pas d'utilisation commerciale

Dates et versions

hal-04125805 , version 1 (12-06-2023)

Identifiants

  • HAL Id : hal-04125805 , version 1

Citer

Alexandre Chanson, Vincent t'Kindt, Nicolas Labroche, Patrick Marcel. Matheuristics to solve the Traveling Analyst Problem. 2023. ⟨hal-04125805⟩
35 Consultations
26 Téléchargements

Partager

Gmail Facebook X LinkedIn More