A Time-Dependent ATSP With Time Window and Precedence Constraints in Air Travel
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.References
Marcken, C. D. 2003. Computational Complexity of Air Travel Planning. Public Notes on Computational Complexity. Retrieved October, 22, 2015 from http://www.demarcken.org/carl/papers/
Robinson, S. 2002. Computer Scientists Find Unexpected Depths in Airfare Search Problem. SIAM NEWS. 35(6). Retrieved November, 14, 2015 from http://www.msri.org/people/members/sara/articles/airfares.pdf.
OpenFlights. 2015. The Air-Traveling Salesman. Retrieved October, 22, 2015 from https://sites.google.com/site/ travellingcudasalesman/
Touyz, J. 2013. The Travelling Tourist Problem: A Mixed Heuristic Approach. Retrieved October, 22, 2015 from http://issuu.com/jgetouyz/docs
Ascheuer, N., Jünger, M., and Reinelt, G. 2000. A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Computational Optimization and Application. 17(1): 61–84.
Picard, J.-C. and Queyranne, M. 1978. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling. Operations Research. 26(1): 86–101.
Applegate, D. L., Bixby, R. E., Chvátal, V., and Cook, W. J. 2007. The Traveling Salesman Problem: A Computational Study. New Jersey: Princeton University Press.
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., and Shmoys, D. B. 1995. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York: John Wiley & Sones.
Gutin, G. and Punnen, A. P. 2002. The Traveling Salesman Problem and Its Variations. US: Springer.
Cook, W. J. 2012. In Pursuit of the Traveling Salesman. New Jersey: Princeton University Press.
Solomon, M. M. and Desrosiers, J. 1988. Time Window Constrained Routing and Scheduling Problem. Transportation Science. 22(1): 1-13.
Kizilateş, G. and Nuriyeva, F. 2013. On the Nearest Neighbor Algorithms for the Traveling Salesman Problem. Advances in Computational Science, Engineering and Information Technology. 225: 111-118.
Hernández-Pérez, H. and Salazar-González, J. J. 2004. A Branch-andCut Algorithm for a Traveling Salesman Problem with Pickup and Deliver. Discrete Applied Mathematics. 145(1): 126-139.
Voudouris, C. and Tsang, E. 1999. Guided Local Search and Its Application to the Traveling Salesman Problem. European Journal of Operational Research. 113(2): 469-499.
Misevičius, A., Ostreika, A., Šimaitis, A., and Žilevičius, V. 2007. Improving Local Search for the Traveling Salesman Problem. Information Technology and Control. 36(2): 187-195.
Piriyaniti, I. and Pongchairerks, P. 2013. Variable Neighbourhood Search Algorithms for Asymmetric Travelling Salesman Problems. International Journal of Operational Research. 18(2): 157-170.
Saradatta, T. and Pongchairerks, P. 2015. Instances for TimeDependent ATSP with Time Window and Precedence Constraints in Air Travel. Retrieved November, 20, 2015 from https://drive.google.com/folderviewid=0B2XqS3TSsvP7UFFEa1E0
UlpWbHc&usp=sharing
Ray, S.S. and Bandyopadhyay, S. 2007. Genetic Operators for Combinatorial Optimization in TSP and Microarray Gene Ordering’, Applied Intelligence. 26(3): 183-195.
Guo, P. and Wenming, C. 2014. A General Variable Neighborhood Search for Single-Machine Total Tardiness Scheduling Problem with Step-Deteriorating Jobs. Journal of Industrial and Management Optimization. 10(4): 1071-1090.
Smitch, A. E. and Coit, D. W. 1997. Constraint-Handling Techniques -Penalty Functions. In Baeck, T., Fogel, D. and Michalewicz, Z. (Eds) Handbook of Evolutionary Computation (C 5.2). Bristol: Oxford University Pres.
Downloads
Published
How to Cite
Issue
Section
License
TRANSFER OF COPYRIGHT AGREEMENT
The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):
- All proprietary right other than copyright, such as patent rights
- The right to make further copies of all or part of the published article for my use in classroom teaching
- The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
- The right to make copies of the published work for internal distribution within the institution that employs me
I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.
