A Time-Dependent ATSP With Time Window and Precedence Constraints in Air Travel

Authors

  • Thanaboon Saradatta Faculty of Engineering, Thai-Nichi Institute of Technology, Bangkok, Thailand.
  • Pisut Pongchairerks Faculty of Engineering, Thai-Nichi Institute of Technology, Bangkok, Thailand.

Keywords:

Travelling Salesman Problem, TSP, Asymmetric Travelling Salesman Problem, ATSP, Local Search Algorithm, Air Transportation, Time Window, TimeDependent, Precedence Constraint,

Abstract

This paper considers a time-dependent asymmetric travelling salesman problem with time window and precedence constraints, based on the real application of air transport. This problem is much more complicated than the classical asymmetric travelling salesman problem due to the properties of the airfare prices, the time window constraints and the precedence constraints. To solve this problem, this paper proposes a modified nearest neighbor algorithm and two local search algorithms.

Downloads

Download data is not yet available.

Downloads

Published

2017-06-01

How to Cite

Saradatta, T., & Pongchairerks, P. (2017). A Time-Dependent ATSP With Time Window and Precedence Constraints in Air Travel. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(2-3), 149–153. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2345

Issue

Vol. 9 No. 2-3: Circuit and System Advancement in Modern World II

Section

Articles

License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)