Travel Planning Application: Combining Linear Programming and Shortest Route Problem to Optimize Travelers’ Satisfactions

Authors

  • Athapol Ruangkanjanases Chulalongkorn Business School, Chulalongkorn University, Thailand.
  • Phattharaphong Kaoian Chulalongkorn Business School, Chulalongkorn University, Thailand.

Keywords:

Mobile, Travel, Application, Satisfaction, Gender, Linear Programming, Transportation,

Abstract

Travelers around the world use mobile applications to plan their holiday trips. However, none of the existing applications in the market is capable of optimizing satisfaction of a trip which travelers have different genders and various interests. This research proposes theoretical foundation for mobile application developers to create an application personalized for travel couples. A good trip for a couple is made of shared interests of both travelers. However, places and activities that are interesting for women may not satisfy men’s interests and vice versa. Variables such as time, budget, stamina, satisfaction of a male traveler, and satisfaction of female traveler factors to the constraints of the trip. By using the variables as mentioned above, the model is developed with the objective to maximize satisfaction of the trip while balancing the interests of both genders. The shortest path models, both forward and backward routes, are combined with linear programming to set the constraints. The results of the simulation are applicable. The couple gets a solution for travel spots to visit, transportation route, money and time used for transportation, money and time used for visiting places, as well as the total satisfaction of both travelers.

Downloads

Published

2018-09-26

How to Cite

Ruangkanjanases, A., & Kaoian, P. (2018). Travel Planning Application: Combining Linear Programming and Shortest Route Problem to Optimize Travelers’ Satisfactions. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 10(3-2), 13–19. Retrieved from https://jtec.utem.edu.my/jtec/article/view/4705