AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems

Nawal Benabbou, Cassandre Leroy, Thibaut Lust

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Multi-objective optimization · 29 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
apply crossover/mutation on preference parameters instead of solutions (ablation)RIGA · MTSP 300 citieserror (%): 19.63 -> 0.22 (n=4)Improved
apply crossover/mutation on preference parameters instead of solutions (ablation)RIGA · MTSP 300 citiesqueries: 2.01 -> 17.92 (n=3)Mixed
use RIGA instead of IEEP0.02 at n=7RIGA · MTSP 300 cities, n=7time (s): 2336.73 -> 202.23Improved
use RIGA instead of IEEP0.02 at n=3RIGA · MTSP 300 cities, n=3time (s): 50.46 -> 130.80Hurt
use RIGA instead of Two-Phase0.02RIGA · MTSP 300 cities, n=7error (%): 3.78 -> 1.97Improved
use RIGA instead of exact IEEP0RIGA · MTSP 300 cities, n=5queries: 56.30 -> 21.88Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy