skip to main content
10.1145/3396474.3396485acmotherconferencesArticle/Chapter ViewAbstractPublication PagesismsiConference Proceedingsconference-collections
research-article

Ant Colony Optimization for Time-Dependent Travelling Salesman Problem

Published: 30 May 2020 Publication History

Abstract

In this paper, the time-dependent travelling salesman problem (TDTSP) is reviewed and the heuristic based on ant colony optimization for solving the TDTSP is proposed. The TDTSP is an extension of the classical travelling salesman problem in which the edge costs depend on the order in which the edges are visited. This extension is even more computationally complex than the original problem and therefore a heuristic must be used in order to get a solution close to the optimal one for larger-scale problems. We combine the ant colony optimization algorithm with a modified local search and apply the heuristic to a simplified version of the flying tourist problem.

References

[1]
Miller, C. E., Tucker, A. W., and Zemlin, R. A. 1960. Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 7(4), 326--329.
[2]
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--110.
[3]
Fox, K. R., Gavish, B., and Graves, S. C. 1980. An n-constraint formulation of the (time-dependent) traveling salesman problem. Operations Research, 28(4), 1018--1021.
[4]
Godinho, M. T., Gouveia, L., and Pesneau, P. 2014. Natural and extended formulations for the time-dependent traveling salesman problem. Discrete Applied Mathematics, 164, 138--153.
[5]
Gouveia, L., and Voß, S. 1995. A classification of formulations for the (time-dependent) traveling salesman problem. European Journal of Operational Research, 83(1), 69--82.
[6]
Vander Wiel, R. J., and Sahinidis, N. V. 1996. An exact solution approach for the time - dependent traveling -salesman problem. Naval Research Logistics (NRL), 43(6), 797--820.
[7]
Bigras, L. P., Gamache, M., and Savard, G. 2008. The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optimization, 5(4), 685--699.
[8]
Abeledo, H., Fukasawa, R., Pessoa, A., and Uchoa, E. 2013. The time dependent traveling salesman problem: polyhedra and algorithm. Mathematical Programming Computation, 5(1), 27--55.
[9]
Malandraki, C., and Dial, R. B. 1996. A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operational Research, 90(1), 45--55.
[10]
Bentner, J., Bauer, G., Obermair, G. M., Morgenstern, I., and Schneider, J. 2001. Optimization of the time-dependent traveling salesman problem with Monte Carlo methods. Physical Review E, 64(3), 036701.
[11]
Schneider, J. 2002. The time-dependent traveling salesman problem. Physica A: Statistical Mechanics and its Applications, 314(1-4), 151--155.
[12]
Verbeeck, C., Sórensen, K., Aghezzaf, E. H., and Vansteenwegen, P. 2014. A fast solution method for the time-dependent orienteering problem. European Journal of Operational Research, 236(2), 419--432.
[13]
Aggarwal, Divya, and Vijay Kumar. 2019. Mixed integer programming for vehicle routing problem with time windows. International Journal of Intelligent Systems Technologies and Applications, 18(1-2), 4--19.
[14]
Marques, R., Russo, L., and Roma, N. 2019. Flying tourist problem: Flight time and cost minimization in complex routes. Expert Systems with Applications, 130, 172--187.
[15]
Dorigo, M., and Gambardella, L. M. 1997. Ant colonies for the travelling salesman problem. biosystems, 43(2), 73--81.
[16]
Holý, V., and Tomanová, P. 2017. Řešení časově závislé úlohy obchodního cestujících pomocí optimalizace mravenčí kolonií a lokálního vyhledávání. Využitie kvantitatívnych metód vo vedecko-výskumnej činnosti a v praxi XII. Bratislava: Ekonóm, 75--81.

Cited By

View all
  • (2023)Multiple travelling salesman problem with fuzzy c-means and ant colony optimization algorithmsMultiple travelling salesman problem with fuzzy c-means and ant colony optimization algorithmsBalıkesir Üniversitesi Sosyal Bilimler Enstitüsü Dergisi10.31795/baunsobed.100507026:49(185-201)Online publication date: 23-Jun-2023
  • (2023)An Effective Path Convergence Approach Founded on Recurrent Ant Colony Optimization (RECACO) in Mobile Ad Hoc Networks2023 9th International Conference on Signal Processing and Communication (ICSC)10.1109/ICSC60394.2023.10441147(221-226)Online publication date: 21-Dec-2023
  • (2023)Traveling Salesman Problem with Ant Colony Optimization2023 2nd International Conference on Edge Computing and Applications (ICECAA)10.1109/ICECAA58104.2023.10212262(481-485)Online publication date: 19-Jul-2023
  • Show More Cited By

Index Terms

  1. Ant Colony Optimization for Time-Dependent Travelling Salesman Problem

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ISMSI '20: Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence
    March 2020
    142 pages
    ISBN:9781450377614
    DOI:10.1145/3396474
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    In-Cooperation

    • University of Delhi

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 30 May 2020

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Ant colony optimization
    2. heuristic
    3. local search
    4. time-dependent travelling salesman problem

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Funding Sources

    • Internal Grant Agency of University of Economics, Prague

    Conference

    ISMSI '20

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)19
    • Downloads (Last 6 weeks)3
    Reflects downloads up to 14 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Multiple travelling salesman problem with fuzzy c-means and ant colony optimization algorithmsMultiple travelling salesman problem with fuzzy c-means and ant colony optimization algorithmsBalıkesir Üniversitesi Sosyal Bilimler Enstitüsü Dergisi10.31795/baunsobed.100507026:49(185-201)Online publication date: 23-Jun-2023
    • (2023)An Effective Path Convergence Approach Founded on Recurrent Ant Colony Optimization (RECACO) in Mobile Ad Hoc Networks2023 9th International Conference on Signal Processing and Communication (ICSC)10.1109/ICSC60394.2023.10441147(221-226)Online publication date: 21-Dec-2023
    • (2023)Traveling Salesman Problem with Ant Colony Optimization2023 2nd International Conference on Edge Computing and Applications (ICECAA)10.1109/ICECAA58104.2023.10212262(481-485)Online publication date: 19-Jul-2023
    • (2022)A New Fast Ant Colony Optimization Algorithm: The Saltatory Evolution Ant Colony Optimization AlgorithmMathematics10.3390/math1006092510:6(925)Online publication date: 14-Mar-2022

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media