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

DOI10.1134/S1064562423701119MaRDI QIDQ6204267zbMATH OpenOpenAlexFDO

Authors 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

deep neural networksreinforcement learningvehicle routing problem

Mathematics Subject Classification ID

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

Recommendations

• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis
• Efficiently solving very large-scale routing problems
• Asynchronous optimization of part logistics routing problem

Cites work

• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Deep policy dynamic programming for vehicle routing problems
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Solution of a Large-Scale Traveling-Salesman Problem

Cited in

(1)

• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204267)