In this study, we propose a travel itinerary problem (TIP) which aims to find itineraries with the lowest cost for travelers visiting multiple cities, under the constraints of time horizon, stop times at cities and transport alternatives with fixed departure times, arrival times, and ticket prices. First, we formulate the TIP into a 0-1 integer programming model. Then, we decompose the itinerary optimization into a macroscopic tour (i.e., visiting sequence between cities) selection process and a microscopic number (i.e., flight number, train number for each piece of movement) selection process, and use an implicit enumeration algorithm to solve the optimal combination of tour and numbers. By integrating the itinerary optimization approach and Web crawler technology, we develop a smart travel system that is able to capture online transport data and recommend the optimal itinerary that satisfies travelers' preferences in departure time, arrival time, cabin class, and transport mode. Finally, we present case studies based on real-life transport data to illustrate the usefulness of itinerary optimization for minimizing travel cost, the computational efficiency of the implicit enumeration algorithm, and the feasibility of the smart travel system.
Corresponding author firstname.lastname@example.org
Project name国家自然科学基金:城市轨道交通节能型列车运行计划集成优化方法;其他:Fundamental Research Funds for the Central Universities;;其他:Beijing Nova Program;;其他:Beijing Social Science Fund
Project No.城市轨道交通节能型列车运行计划集成优化方法:71371027;;Fundamental Research Funds for the Central Universities:Buctrc201503;;Beijing Nova Program:Z14111000180000;;Beijing Social Science Fund:13JGC087
- Implicit enumeration algorithm
- SALESMAN PROBLEM
- Smart travel
- Travel itinerary problem