Machine learning algorithm application in trip planning
Articles
Grantas Gadliauskas
Kaunas University of Technology, Lithuania
Andrius Kriščiūnas
Kaunas University of Technology, Lithuania
Published 2022-05-13
https://doi.org/10.15388/LMITT.2022.3
PDF

Keywords

travelling salesman problem
flight search
combinatorial optimization
neural network

How to Cite

Gadliauskas G. and Kriščiūnas A. (2022) “Machine learning algorithm application in trip planning”, Vilnius University Open Series, pp. 25-34. doi: 10.15388/LMITT.2022.3.

Abstract

This article explores how machine learning can be applied in efficiently solving a variation of the Travelling Salesman Problem (TSP) in the context of air travel tourism. Large number of cities create too many trip route combinations to be efficiently evaluated in real time. The method proposed uses a feedforward neural network to narrow down the number of trip route combinations, while a more traditional algorithm based on dynamic programming is then able to select the best trip offers. It was shown that the method could be applied in practice to achieve almost real-time generation of best possible trip offers while evaluating a large amount of real-world flight data.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.