Intelligent Supporting System: Heuristic Algorithms for Vehicle Routing Problem

Author: Giorgi Marjanidze
Annotation:

The following master's thesis deals with the vehicle routing problem (VRP) in difficult and extreme environments. In such cases, there is no objective data as in classic VRP, but the only way to solve the problem is using expert knowledge and the expert data. This kind of data includes: the estimated time spent by the vehicle while driving the route; possibility of movement of the vehicle between the points on time and so forth. Expert data gives us the opportunity to solve the VRP with classic criteria, but also considering the reliability of the routes. The introductory chapter of the thesis briefly presents Fuzzy-sets theory, which is a mathematical instrument for solving the problem. The classic vehicle routing problem is also formulated. The main part of the paper deals with the traveling salesman problem which plays the key role in VRPs. The paper discusses several options for dealing with this problem, presents corresponding software and examples. There exist VRP approaches, when the problem is reduced to the covering problems. Appendix deals with the task of solving covering problems with Monte-Carlo method, its software implementation and testing examples.

Lecture files:

ანოტაცია [ka]
ნაშრომი [ka]
პრეზენტაცია [ka]