Solving Large-Scale Routing Optimization Problems with Networks and Only Networks

For the first time, a fully neural approach has been proposed, capable of solving the optimization problem of routes of extremely large dimensions (~5000 points) with real-world constraints such as cargo capacity, time windows, and delivery sequencing. The proposed solution allows for rapid suboptim...

Full description

Saved in:
Bibliographic Details
Published in:Doklady. Mathematics 2023-12, Vol.108 (Suppl 2), p.S242-S247
Main Authors: Soroka, A. G., Meshcheryakov, A. V.
Format: Article
Language:English
Subjects:
Cargo capacity
Heuristic methods
Mathematics
Mathematics and Statistics
Optimization
Problem solving
Windows (intervals)
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For the first time, a fully neural approach has been proposed, capable of solving the optimization problem of routes of extremely large dimensions (~5000 points) with real-world constraints such as cargo capacity, time windows, and delivery sequencing. The proposed solution allows for rapid suboptimal problem solving for small and medium dimensions (1000 points), thereby representing a state-of-the-art (SotA) solution in the field of route optimization with real-world constraints and extremely large dimensions.
ISSN:1064-5624
1531-8362
DOI:10.1134/S1064562423701119