Routing under constraints: problem of visit to megalopolises

DOI10.1134/S0005117916110060zbMath1356.90153MaRDI QIDQ510285

P. A. Chentsov, A. G. Chentsov

Publication date: 17 February 2017

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

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39) Attainable sets, reachability (93B03)

Related Items (15)

On sequential traversal of sets ⋮ Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints ⋮ A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ Dynamic programming in the routing problem: decomposition variant ⋮ Two-stage dynamic programming in the routing problem with decomposition ⋮ On the question of the optimization of permutations in the problem with dynamic constraints ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ On one routing task with the optimization of the start-finish point ⋮ The routing problems with optimization of the starting point: dynamic programming ⋮ To the question of optimization of the starting point in the routing problem with restrictions ⋮ Solving a Routing Problem with the Aid of an Independent Computations Scheme ⋮ Optimizing insertions in a constraint routing problem with complicated cost functions ⋮ On one routing problem modeling movement in radiation fields ⋮ Оptimization of the Start Point in the Gtsp with the Precedence Conditions ⋮ ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION

Cites Work

• Unnamed Item
• Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
• Problem of successive megalopolis traversal with the precedence conditions
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• The traveling salesman problem and its variations
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Generalized Model of Courier with Additional Restrictions
• To question of routing of works complexes
• A Dynamic Programming Approach to Sequencing Problems
• Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
• In Pursuit of the Traveling Salesman

This page was built for publication: Routing under constraints: problem of visit to megalopolises