[AAAI 2026 Oral] MOTIF: Multi-strategy Optimization via Turn-based Interactive Framework
July 7, 2026 ยท View on GitHub
A competitive multi-agent framework that evolves combinatorial optimization strategies through LLM-powered turn-based interactions.
๐ฐ 1. News
| Date | Update |
|---|---|
| ๐ Dec. 2025 | Refactored codebase for better modularity and extensibility |
| ๐ Nov. 2025 | Paper accepted for oral presentation at AAAI 2026! |
| ๐ Aug. 2025 | Released first version of MOTIF |
๐ 2. Overview
MOTIF is a turn-based, multi-agent framework for improving combinatorial optimization solvers by jointly evolving multiple algorithmic strategies rather than tuning a single heuristic.
Key Features
- ๐ฎ Competitive-Collaborative Learning: Two LLM agents take alternating turns to refine components
- ๐ Dynamic Baselines: Performance guided by adaptive baseline comparisons
- ๐ Opponent Feedback: Each agent learns from the other's improvements
- ๐งฉ Structured Operators: Modular prompts enable targeted strategy refinement
- ๐ Broad Search Space: Competitive dynamics encourage diverse adaptations
๐ 3. Quick Start
Step 1. Set Up Environment Variables
Create a .env file in the project root:
OPENAI_API_KEY="your-openai-api-key-here"
Step 2. Install Dependencies
pip install -r requirements.txt
Step 3. Run Default Experiment
python main.py
Step 4. Run Custom Experiments
Specify a solver:
python main.py solver=tsp_aco
python main.py solver=cvrp_dr_f1_f2_f3
Configure MCTS parameters:
python main.py \
solver=tsp_aco \
mcts.outer_iterations=20 \
mcts.inner_iterations=10 \
mcts.final_iterations=10
Customize LLM settings:
python main.py \
llm.model=gpt-4o \
llm.temperature=0.8
Step 5. Results
Results are saved to ./results/:
F*_final_best.py: Final optimized strategy implementations*_round_*.json: Detailed experiment logs with performance metrics
๐ 4. Supported Problems and Solvers
| Solver | Problems | Strategies |
|---|---|---|
| ACO | TSP, CVRP, MKP | - F1: Heuristic & Pheromone Initialization - F2: Probabilistic Transition Rule - F3: Pheromone Update Rule |
| ACO | OP, BPP | - F1: Heuristic & Pheromone Initialization - F2: Pheromone Update Rule |
| GLS | TSP | - F1: Guide Matrix Initialization |
| DR | TSP, CVRP, BPP | - F1: Initial Solution Construction Rule - F2: Deconstruction Rule - F3: Repair Rule |
๐ง 5. Customization and Extension
MOTIF is designed for easy extension. Follow these guides to add new problems and solvers.
Step 1. Create the problem directory:
problems/
โโโ problem_solver/
โโโ __init__.py
โโโ solver.py # Solver implementation
โโโ eval.py # Evaluation functions
โโโ generator.py # Instance generator
โโโ prompts.py # LLM prompts for each strategy
โโโ F1.py # Strategy component 1 (baseline)
โโโ F2.py # Strategy component 2 (baseline)
โโโ F3.py # Strategy component 3 (baseline)
โโโ datasets/ # Training and test datasets
Step 2. Implement core files:
prompts.py: DefinePROBLEM_DESCRIPTION,CONSTRAINTS, and strategy prompts (F1,F2,F3)F*.py: Provide baseline implementations for each strategy component
Step 3. Create solver configuration:
# @package _global_.solver
base_path: ${paths.problems_dir}/problem_solver # Path to problem-solver directory
functions: [F1, F2] # Strategy files to optimize
๐ 6. Citation
If you find MOTIF useful in your research, please consider citing our paper:
@inproceedings{nguyen2026motif,
title = {MOTIF: Multi-Strategy Optimization via Turn-based Interactive Framework},
author = {Kiet, Nguyen Viet Tuan and Tung, Dao Van and Dao, Tran Cong and Binh, Huynh Thi Thanh},
booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence (AAAI)},
year = {2026},
address = {Singapore},
month = {January},
note = {Oral Presentation}
}
Made with โค๏ธ for the optimization research community!