Optimization of ways search by a graph in the dynamic task of traveling salesman by the method of the modified ant algorithm
Abstract
The method of solving the task of minimum graph way search on the basis of using the modified ant algorithm, in which the length of ribs of bidirectional oriented graph is variable, is offered. The method of local search is used in order to optimize the parameters of probabilistic-proportional search of minimum ribs distance for a graph.Downloads
Published
2012-06-27
Issue
Section
Decision making and control in economic, technical, ecological and social systems