An approach to solution of the movements routing problem with several participants

DOI10.1134/S1064230710040076MaRDI QIDQ357112zbMATHFDO

Authors A. G. Chentsov, P. A. Chentsov, E. E. Ivanko

Publication date 29 July 2013

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

zbMATH Keywords

dynamic programminggreedy algorithm

Mathematics Subject Classification ID

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

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 problem of route optimization and its applications.
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• A generalized Courier problem with the cost function depending on the list of tasks

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3972626 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A modification of the dynamic programming method for the travelling-salesman problem
• An assignment problem
• Dynamic programming in the problem of decomposition optimization
• Dynamic programming method in the generalized courier problem
• Job distribution algorithms
• Partitioning a finite set by a dynamic programming method
• Reduction of route optimization problems
• Solving the routing optimization problem using the dynamic programming method

This page was built for publication: An approach to solution of the movements routing problem with several participants

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