User Settings
Open AccessArticle10.24867/32ih02curcic

ПРИМЕНА ГЕНЕТСКОГ АЛГОРИТМА НА РЕШАВАЊЕ ВРЕМЕНСКИ ОГРАНИЧЕНОГ ПРОБЛЕМА ТРГОВАЧКОГ ПУТНИКА СА САКУПЉАЊЕМ НАГРАДА

TL;DRAbstract

This paper analyzes the synthesis of an optimal strategy for the Eurobot robotics competition using a genetic algorithm. The primary objectives of the research are the development of an efficient algorithm and the optimization of the strategy for specific tasks. The tasks and constraints that must be integrated into the generated strategy are defined. The problem is modeled as a variation of the prize collecting traveling salesman problem. Various cases with different types of constraints and parameters of the genetic algorithm were analyzed, and their effectiveness was compared.

Chat with Paper

AI Agents for this Paper

This paper analyzes the synthesis of an optimal strategy for the Eurobot robotics competition using a genetic algorithm. The primary objectives of the research are the development of an efficient algorithm and the optimization of the strategy for specific tasks. The tasks and constraints that must be integrated into the generated strategy are defined. The problem is modeled as a variation of the prize collecting traveling salesman problem. Various cases with different types of constraints and parameters of the genetic algorithm were analyzed, and their effectiveness was compared.

Chat

Click to start Chat