Multi-City Flight Route Optimization System Using Big-Data Analytics
暂无分享,去创建一个
This paper proposes a multi-city flight route optimization system using big-data analytics. When one plans a travel for visiting a set of cities, the sequence of visiting should be determined so the total travel cost is minimized. Such problem is known as the travelling salesman problem (TSP) in the literature. We present a variant of TSP considering the dynamic travel costs between two cities and a total travel duration. We present a mixed integer programming formulation for solving the problem, with developing a flight price trend prediction model. The goal of the flight price trend prediction model is to reduce time and cost that are required to construct the route optimization problem. We employed big-data analytics to build the appropriate price trend prediction model that involves massive web crawling, statistical analysis, and regression. A web-based system was, then, built on the developed models for demonstrating the validity of the proposed approach.
[1] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[2] Stephen C. Graves,et al. An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 2016 .
[3] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[4] 김형석,et al. Evaluating Variable Selection Techniques for Linear Regression , 2016 .