An extremal constrained routing problem with internal losses

DOI10.3103/S1066369X10060071MaRDI QIDQ1956632zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 23 September 2010

Published in Russian Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s1066369x10060071

zbMATH Keywords

dynamic programminginternal coststraveling salesman problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39)

Review text

Traveling salesman problems (TSP) are considered, taking into account that a finite number of sets have to be visited and certain work has to be done at these sets. Performing this work, some related expenses arise. A dynamic programming procedure is then developed to find the global extremum of this TSP with internal costs.

Recommendations

• Dynamic programming method in extremal constrained routing problems
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• On a bottleneck routing problem
• About one route problem with interior works
• Iteration method in a routing problem with internal losses

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• A modification of the dynamic programming method for the travelling-salesman problem
• An Algorithm for the Traveling Salesman Problem
• An assignment problem
• Dynamic programming in a nonstationary route problem
• Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 4081311 (Why is no real title available?)
• scientific article; zbMATH DE number 6025714 (Why is no real title available?)
• scientific article; zbMATH DE number 3298367 (Why is no real title available?)
• Hybrid control systems and the dynamic traveling salesman problem
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• Route optimization by a dynamic programming technique
• The iterations method in generalized courier problem with singularity in the definition of cost functions
• The traveling salesman problem. II: Exact methods

Cited in

(7)

• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• Dynamic programming method in extremal constrained routing problems
• Elements of dynamic programming in extremal routing problems
• On an iterative procedure for solving a routing problem with constraints
• Iteration method in a routing problem with internal losses
• On a bottleneck routing problem

This page was built for publication: An extremal constrained routing problem with internal losses

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