Flying tourist problem: Flight time and cost minimization in complex routes

作者：

Highlights：

• The NP-hard Flying Tourist Problem, a model for multi-city flight requests.

• An efficient solution of the problem, based on a meta-heuristic methodology.

• High quality solutions can be identified in real-time, even for large instances.

• Provides the traveller with the ability to save significant amounts of time and money.

摘要

•The NP-hard Flying Tourist Problem, a model for multi-city flight requests.•An efficient solution of the problem, based on a meta-heuristic methodology.•High quality solutions can be identified in real-time, even for large instances.•Provides the traveller with the ability to save significant amounts of time and money.

论文关键词：Flight search,Traveling salesman problem,Combinatorial optimization,Evolutionary algorithms.

论文评审过程：Received 26 October 2018, Revised 11 March 2019, Accepted 11 April 2019, Available online 16 April 2019, Version of Record 23 April 2019.

论文官网地址：https://doi.org/10.1016/j.eswa.2019.04.024