Find in Library

One of the most basic problems in logistics is the problem of route rationalization. Route rationalization may be based on different criterions, but at its core it always can be reduced to classic mathematical problems, such as travelling salesman problem (TSP). This study discusses methods, used to find approximate solutions for TSP and proposes authors modification of classic genetic algorithm (GA) for solving vessel’s route rationalization problem. Test results and strategies for vessel’s route rationalization are discussed. A number of conclusions on best strategies for route rationalization is carried out.