Muliarevych O. Solving dynamic travelling salesman problem using ant colony behavior model in multiagent systems.

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0416U004706

Thesis Registration Form

0416U004706.pdf

Applicant for

Specialization

  • 05.13.05 - Комп'ютерні системи та компоненти

28-10-2016

Specialized Academic Board

Д 35.052.08

Lviv Polytechnic National University

Essay

The thesis is devoted to popular scientific task – dynamic travelling salesman problem solving using ant colony behavior model in multiagent systems. In thesis a model of multiagent system was firstly developed, based on applying ant colony behavior model with distributed placement of digital marks on communication nodes, which enables to solve dynamic asymmetric travelling salesman problem in conditions of a partly unknown input data. Based method was improved by modification of digital marks’ values initialization procedure and procedure of next node selection for movement of ant-agent.

Read more

Files

aref.doc

dis.doc

Similar theses

0524U000165

Vadym V. Shkarupylo

Methods and means for safety-critical systems’ software and algorithmic constituent design process artifacts control

0524U000048

Anna V. Khakhanova

Federated computing of vector-matrix transactions in cyber-social systems

0424U000015

Oleksandr Melnyk

Methods and means of forming graphic primitives on a hexagonal grid

0422U100014

Saprykin Oleksandr Sergiyovych

Models for automated analysis and diagnosis of polymorphic viruses in computer systems and networks

0421U103964

Uzdenov Taras Amurovych

Task scheduling methods for GRID-systems with inalienable resources