Research map / Learning theory and algorithms / Combinatorial and search optimization
Neural Combinatorial Optimization for Time Dependent Traveling Salesman Problem
Ruixiao Yang, Chuchu Fan
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
- Neural Combinatorial Optimization for Robust Routing Problem with Uncertain Travel Times (NeurIPS 2024 · similarity 0.89)
- GLOP: Learning Global Partition and Local Construction for Solving Large-Scale Routing Problems in Real-Time (AAAI 2024 · similarity 0.89)
- Improving Generalization of Neural Combinatorial Optimization for Vehicle Routing Problems via Test-Time Projection Learning (NeurIPS 2025 · similarity 0.87)
- DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem (AAAI 2025 · similarity 0.87)
- Neural Solver Selection for Combinatorial Optimization (ICML 2025 · similarity 0.87)
- Memory-Enhanced Neural Solvers for Routing Problems (NeurIPS 2025 · similarity 0.87)
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.
