Optimizing insertions in a constraint routing problem with complicated cost functions

DOI10.1134/S106423071901012XMaRDI QIDQ2290475zbMATH OpenOpenAlexWikidataFDO

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

Publication date 28 January 2020

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59) Control/observation systems involving computers (process control, etc.) (93C83)

Recommendations

• Optimizing multi-inserts in routing problems with constraints
• The Bellmann insertions in the route problem with constraints and complicated cost functions
• The Bellmann insertions in route problems with constraints and complicated cost functions. II
• Local dynamic programming incuts in routing problems with restrictions
• Some applications of optimization routing problems with additional constraints

Cites work

• A minimum cost network flow model for the maximum covering and patrol routing problem
• Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
• Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• Finitely additive measures in extension constructions of some game problems
• Local dynamic programming incuts in routing problems with restrictions
• Problem of successive megalopolis traversal with the precedence conditions
• Routing under constraints: problem of visit to megalopolises
• Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
• The Bellmann insertions in route problems with constraints and complicated cost functions. II
• The Bellmann insertions in the route problem with constraints and complicated cost functions
• The traveling salesman problem and its variations
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• To question of routing of works complexes

Cited in

(4)

• Local dynamic programming incuts in routing problems with restrictions
• The Bellmann insertions in the route problem with constraints and complicated cost functions
• Optimizing multi-inserts in routing problems with constraints
• The Bellmann insertions in route problems with constraints and complicated cost functions. II

This page was built for publication: Optimizing insertions in a constraint routing problem with complicated cost functions

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