ROUTE OPTIMIZATION OF MULTIPLE-AGENT TRAVELLING SALESMAN PROBLEM

Abstrakt

Route optimization is quotidian engineering problem. Problem of finding the optimal and suboptimal routes is one of the most studied optimization problem. In this paper, author firstly presented a short literature overview of the history of routing problems and namely travelling salesman problem (TSP). In the second chapter author presented the usual mathematical formulations for single and multiple agent travelling salesman problem (TSP and mTSP). In chapter three, author used a case study TSP given in the literature which involves one agent and fifteen nodes, modelled the problem in a standard software package (MS Excel’s Visual Basic VBA), solved it by the evolutionary solver in the same software package, confirmed the result and withal verified the model. In the following step, author added one more agent as a hypothetical case of mTSP and solved the problem. In the final chapter author discussed the results and gave conclusions which can be used for further development of the study. The solution was gained in reasonably short computational time and considered as optimal.