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

The problem of visiting of a finite system of sets by several participants is considered. The proposed solution algorithm for the complex problem is based on a combination of a greedy algorithm of job distribution and the dynamic programming method in the problems of routing of every participant. A...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer & systems sciences international 2010-08, Vol.49 (4), p.570-578
Main Authors: Ivanko, E. E., Chentsov, A. G., Chentsov, P. A.
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Computer programming
Control
Costs
Dynamic programming
Dynamical systems
Dynamics
Engineering
Greedy algorithms
Mathematical analysis
Mathematical models
Mechatronics
Movements
Nuclear power plants
Optimization
Optimization Methods
Personal computers
Robotics
Routing
Studies
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of visiting of a finite system of sets by several participants is considered. The proposed solution algorithm for the complex problem is based on a combination of a greedy algorithm of job distribution and the dynamic programming method in the problems of routing of every participant. A PC program is developed and an extensive computational experiment is conducted.
ISSN:1064-2307
1555-6530
DOI:10.1134/S1064230710040076