IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v14y2023i2p1-14.html
   My bibliography  Save this article

A Genetic Algorithm-Based Approach to Solve a New Time-Limited Travelling Salesman Problem

Author

Listed:
  • Moumita Mondal

    (Department of Computer Science and Engineering, Shri JJT University, Rajasthan, India)

  • Durgesh Srivastava

    (Department of Computer Science and Engineering, Chitkara University Institute of Engineering and Technology, Chitkara University, Rajpura, India)

Abstract

In this paper, the authors have explained a time limited travelling salesman problem (TSP) where a time limit is associated with each city. The traveller must reach each city on or before the predetermined time limit (that is fixed for each city) in his/her tour. Travel cost is also a parameter for the proposed model. This time limit indicates the maximum time unit by which the traveller must reach a particular city. Here, travel cost is the objective of the problem. Moreover, total travel time is also fixed for a complete tour. This research recently introduced this time limit for each of the cities. The proposed TSP is solved by using a genetic algorithm-based method. The cyclic crossover and special mutation operations have been adapted to GA for solving the proposed TSP. To show the effectiveness of proposed algorithm, the authors have considered some benchmark instances. Then the authors redefine a few benchmark instances for the proposed TSP. Computational results with different data sets are presented.

Suggested Citation

  • Moumita Mondal & Durgesh Srivastava, 2023. "A Genetic Algorithm-Based Approach to Solve a New Time-Limited Travelling Salesman Problem," International Journal of Distributed Systems and Technologies (IJDST), IGI Global, vol. 14(2), pages 1-14, January.
    • Handle: RePEc:igg:jdst00:v:14:y:2023:i:2:p:1-14
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJDST.317377
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Anke Stieber & Armin Fügenschuh, 2022. "Dealing with time in the multiple traveling salespersons problem with moving targets," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 991-1017, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdst00:v:14:y:2023:i:2:p:1-14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.