Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints

DOI10.1134/S0005117917040087zbMath1366.90209MaRDI QIDQ2362374

Yanyan Li

Publication date: 7 July 2017

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

zbMATH Keywords

dynamic programmingprecedence constraintsroute

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (3)

A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane ⋮ Optimizing insertions in a constraint routing problem with complicated cost functions

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
• An inexact algorithm for the sequential ordering problem
• 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
• Extremal routing problem with internal losses
• To question of routing of works complexes
• Local dynamic programming incuts in routing problems with restrictions

This page was built for publication: Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints