Local dynamic programming incuts in routing problems with restrictions

DOI10.20537/VM140204MaRDI QIDQ2932448zbMATH OpenOpenAlexFDO

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

Publication date 1 December 2014

Published in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/vuu427

zbMATH Keywords

preceding conditionsrouting problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• About routing in the sheet cutting
• The Bellmann insertions in route problems with constraints and complicated cost functions. II
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• Optimizing insertions in a constraint routing problem with complicated cost functions
• Routing under constraints: problem of visit to megalopolises

Cited in

(7)

• Optimizing insertions in a constraint routing problem with complicated cost functions
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• About routing in the sheet cutting
• Dynamic programming in the routing problem: decomposition variant
• Optimizing multi-inserts in routing problems with constraints
• On the question of the optimization of permutations in the problem with dynamic constraints
• Local optimization of dynamic programs with guaranteed satisfaction of path constraints

This page was built for publication: Local dynamic programming incuts in routing problems with restrictions

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