RIEŠENIE PROBLÉMU VIACERÝCH OBCHODNÝCH CESTUJÚCICH POMOCOU GENETICKÉHO ALGORITMU
Abstract
Article deals with application of the multiple traveling salesman problem (MTSP)
into environment of postal operator. MTSP involves scheduling m > 1 salesmen to visit a set
of n > m nodes so that each node is visited exactly once. The objective is to minimize the total
distance traveled by all the salesmen. This combinatorial optimization method has a
multiplicity of applications, mostly in the areas of routing and scheduling. Simulation of
MTSP has been applied on regional postal network. Results show that used software proves to
be sufficiently functional for field of postal transport networks.
Subject
Postal network , graph theory , metaheuristic methods , genetic algorithm , traveling salesman
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by/4.0/