← Search

Jiwoo Son

7 accepted papers

2026

Towards Real-World Routing with Neural Combinatorial Optimization

ICLR 2026poster

The practical deployment of Neural Combinatorial Optimization (NCO) for Vehicle Routing Problems (VRPs) is hindered by a critical sim-to-real gap. This gap stems not only from training on oversimplified Euclidean data but also from node-based architectures incapable of handling the node-and-edge-bas…

Cited by 0Source ↗code ↗Scholar ↗
2026

USPR: Learning a Unified Solver for Profiled Routing

AAAI 2026technical

The Profiled Vehicle Routing Problem (PVRP) extends the classical VRP by incorporating vehicle–client-specific preferences and constraints, reflecting real‑world requirements such as zone restrictions and service‑level preferences. While recent reinforcement‑learning solvers have shown promising per

Cited by 0Source ↗PDF ↗Scholar ↗
2025

Ant Colony Sampling with GFlowNets for Combinatorial Optimization

AISTATS 2025poster

We present the Generative Flow Ant Colony Sampler (GFACS), a novel meta-heuristic method that hierarchically combines amortized inference and parallel stochastic search. Our method first leverages Generative Flow Networks (GFlowNets) to amortize a multi-modal prior distribution over combinatorial so…

Cited by 74Source ↗Scholar ↗
2025

PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization

NeurIPS 2025poster

Combinatorial optimization problems involving multiple agents are notoriously challenging due to their NP-hard nature and the necessity for effective agent coordination. Despite advancements in learning-based methods, existing approaches often face critical limitations, including suboptimal agent co…

Cited by 0Source ↗code ↗Scholar ↗
2024

Equity-Transformer: Solving NP-Hard Min-Max Routing Problems as Sequential Generation with Equity Context

AAAI 2024technical

Min-max routing problems aim to minimize the maximum tour length among multiple agents as they collaboratively visit all cities, i.e., the completion time. These problems include impactful real-world applications but are known as NP-hard. Existing methods are facing challenges, particularly in large…

2023

Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization

ICML 2023poster

This paper proposes Meta-SAGE, a novel approach for improving the scalability of deep reinforcement learning models for combinatorial optimization (CO) tasks. Our method adapts pre-trained models to larger-scale problems in test time by suggesting two components: a scale meta-learner (SML) and sched…