Hybrid control systems and the dynamic traveling salesman problem

DOI10.1007/S10513-008-1005-ZMaRDI QIDQ1002845zbMATH OpenOpenAlexFDO

Authors S. Sergeev

Publication date 26 February 2009

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

Full work available at URL https://doi.org/10.1007/s10513-008-1005-z

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
• scientific article; zbMATH DE number 1241090
• Discrete optimization by optimal control methods. II: The static traveling salesman problem
• The travelling-salesman problem with moving objects
• Dynasearch algorithms for solving time dependent traveling salesman problem

Cited in

(6)

• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• The routing bottlenecks problem (optimization within zones)
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Dynamic programming method in extremal constrained routing problems
• Hybrid encoding based differential evolution algorithms for Dubins traveling salesman problem with neighborhood
• An extremal constrained routing problem with internal losses

This page was built for publication: Hybrid control systems and the dynamic traveling salesman problem

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