AI Paper Atlas

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

Neural Combinatorial Optimization for Time Dependent Traveling Salesman Problem

Ruixiao Yang, Chuchu Fan

NeurIPS 2025 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes a neural combinatorial optimization approach for the time-dependent traveling salesman problem, whose edge weights vary with departure time.

Problem

The Time-Dependent Traveling Salesman Problem (TDTSP), where edge weights depend on departure time and the problem violates symmetry, triangle inequality, and cyclic invariance of classical TSP.

Approach

Applies neural combinatorial optimization to TDTSP, which the abstract describes as handling the violated TSP properties; the specific architecture is not stated in the abstract.

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