Solving large-scale routing optimization problems with networks and only networks

DOI10.1134/s1064562423701119OpenAlexW4391679244MaRDI QIDQ6204267

A. G. Soroka, A. V. Meshcheryakov

Publication date: 27 March 2024

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562423701119

zbMATH Keywords

reinforcement learningvehicle routing problemdeep neural networks

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research and management science (90Bxx) Operations research, mathematical programming (90-XX)

Cites Work

• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Deep policy dynamic programming for vehicle routing problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Solution of a Large-Scale Traveling-Salesman Problem
• Unnamed Item

This page was built for publication: Solving large-scale routing optimization problems with networks and only networks