IDEAS home Printed from https://ideas.repec.org/a/zna/indecs/v18y2020i3p352-359.html
   My bibliography  Save this article

Intuitionistic fuzzy rule-base model for the time dependent traveling salesman problem

Author

Listed:
  • Ruba S. Almahasneh

    (Budapest University of Technology and Economics, Budapest, Hungary)

  • Laszlo T. Koczy

    (Budapest University of Technology and Economics; Széchenyi István University Budapest, Hungary; Gyõr, Hungary)

Abstract

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem. There are many different extensions and modifications of the original problem, such as The Time Dependent Traveling Salesman Problem (TDTSP), this specific extension of the original TSP towards more realistic traffic conditions assessment. In TDTSP the "distances" (costs) between nodes vary in time, they are considered longer during the rush hour period or in the traffic jam region, e.g. the city centre. In this article we introduce an even more realistic approach, the IFTDTSP (Intuitionistic Fuzzy Time Dependent Traveling Salesman Problem); which is an extension of the TDTSP with the additional notion of intuitionistic fuzzy sets (which is a generalization of the original fuzzy sets). Our goal is to give a useful extended, alternative model instead of the original abstract problem. By demonstrating that the addition of intuitionistic fuzzy elements to quantify the intangible jam factors creates an inference system that approximates the tour cost in a more practical way. Hence, we are one step closer to offering a more realistic solution for the generalized TSP problem. The results of two simple toy examples showed the general effectiveness of the model.

Suggested Citation

  • Ruba S. Almahasneh & Laszlo T. Koczy, 2020. "Intuitionistic fuzzy rule-base model for the time dependent traveling salesman problem," Interdisciplinary Description of Complex Systems - scientific journal, Croatian Interdisciplinary Society Provider Homepage: http://indecs.eu, vol. 18(3), pages 352-359.
    • Handle: RePEc:zna:indecs:v:18:y:2020:i:3:p:352-359
    as

    Download full text from publisher

    File URL: http://indecs.eu/2020/indecs2020-pp352-359.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Schneider, Johannes, 2002. "The time-dependent traveling salesman problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 314(1), pages 151-155.
    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. Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
    2. Merve Kayacı Çodur & Mustafa Yılmaz, 2020. "A time-dependent hierarchical Chinese postman problem," 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. 28(1), pages 337-366, March.
    3. Rifki, Omar & Chiabaut, Nicolas & Solnon, Christine, 2020. "On the impact of spatio-temporal granularity of traffic conditions on the quality of pickup and delivery optimal tours," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    4. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    5. Ivana Semanjski & Sidharta Gautama, 2024. "Sustainable Time-Dependent Cheapest Path Problem with Integrated Collaborative Stakeholders’ Perspectives," Sustainability, MDPI, vol. 16(9), pages 1-19, April.

    More about this item

    Keywords

    Intuitionistic Fuzzy Sets; Time Dependent Traveling Salesman Problem; Traveling Salesman Problem; Intuitionistic Fuzzy Time Dependent Traveling Salesman Problem;
    All these keywords.

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory

    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:zna:indecs:v:18:y:2020:i:3:p:352-359. 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: Josip Stepanic (email available below). General contact details of provider: .

    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.