Two-stage dynamic programming in the routing problem with decomposition

DOI10.1134/S0005117923050053MaRDI QIDQ6078066zbMATH OpenOpenAlexFDO

Authors A. G. Chentsov, P. A. Chentsov

Publication date 27 September 2023

Published in Automation and Remote Control (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingmegalopolisprecedence conditionsroute

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• The routing problems with optimization of the starting point: dynamic programming
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
• Some applications of optimization routing problems with additional constraints
• Routing under constraints: problem of visit to megalopolises
• About routing in the sheet cutting

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• An Algorithm for the Traveling Salesman Problem
• Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
• Dynamic programming in the routing problem: decomposition variant
• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 3648418 (Why is no real title available?)
• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3264065 (Why is no real title available?)
• scientific article; zbMATH DE number 3400017 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
• Problem of successive megalopolis traversal with the precedence conditions
• Routing under constraints: problem of visit to megalopolises
• The traveling salesman problem and its variations
• The traveling salesman problem. Approximate algorithms

Cited in

(7)

• Some applications of optimization routing problems with additional constraints
• Dynamic programming in the routing problem: decomposition variant
• scientific article; zbMATH DE number 7112467 (Why is no real title available?)
• Minimax routing problem with a system of priority tasks
• Dynamic programming and decomposition in extreme routing problems
• Multi-level dynamic programming in routing problems with constraints
• Dynamic programming in multi-level routing problems with constraints

This page was built for publication: Two-stage dynamic programming in the routing problem with decomposition

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