Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 429))

Abstract

A new generalisation of the travelling salesman problem is proposed. First of all, the nodes of the problem are allowed to be networks themselves, in which travelling salesman subproblems have to be solved. Then, a stage dependent problem is considered, in which the nodes have different inner travel times parameters in various stages of the travelling salesman route. Such a problem is considered in a fuzzy version, when the travel time parameters may be imprecise and variable, due, for example, to weather or traffic conditions. Corresponding integer linear programming models are formulated. An example is used to illustrate the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Korte, B., Vygen, J.: Combinatorial Optimization, Theory and Algorithms. Algorithms and Combinatorics, 21st edn. Springer, Berlin, Heidelberg, New York, Tokyo, Paris, Milan (2012)

    Google Scholar 

  2. Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin, Heidelberg, New York, Tokyo, Paris, Milan (2010)

    Google Scholar 

  3. Orman, A.J., Williams, H.P.: A survey of different integer programming formulations of the travelling salesman problem. In: Kontoghiorghes, E.J., Gatu, C. (eds.) Econometric and Financial Analysis. Advances in Computational Management Science, pp. 93–108. Springer, Berlin, Germany (2006)

    Google Scholar 

  4. Botzheim, J., Földesi P., Kóczy T.L.: Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. In: Proceedings of IFSA-EUSFLAT, pp. 1667–1672 (2009)

    Google Scholar 

  5. Zadeh, L.A.: A computational approach to fuzzy quantifiers in natural languages. Comput. Math Appl. 9(1), 149–184 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Changdar, C., Mahapatra, G.S., Kumar Pal, R.: An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness. Swarm Evol. Comput. 15(0), 27–37 (2014)

    Google Scholar 

  7. Gupta, A., Kumar, A., Sharma, M.K.: Applications of fuzzy linear programming with generalized LR flat fuzzy parameter. Fuzzy Inf. Eng. 5(4), 475–492 (2013)

    Article  MathSciNet  Google Scholar 

  8. Isleyen, S.K., Kesen, S.E., Baykoç, Ö.F.: From analytical perspective to heuristic approach: travelling salesman problem with discrete fuzzy travel times. Gazi Univ. J. Sci. 22(4), 267–276 (2009)

    Google Scholar 

  9. Cordeau, J., Ghiani, G., Guerriero, E.: Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem. Transp. Sci. 48(1), 46–58 (2014)

    Article  Google Scholar 

  10. Gouveia, L., Voss, S.: A classification of formulations for the (time-dependent) traveling salesman problem. Eur. J. Oper. Res. 83(1), 69–82 (1995)

    Article  MATH  Google Scholar 

  11. Li, F., Golden, B., Wasil, E.: Solving the time dependent traveling salesman problem (2005)

    Google Scholar 

  12. Bortolan, G., Degani, R.: A review of some methods for ranking fuzzy subsets. Fuzzy Sets Syst. 15(1), 1–19 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dorota Kuchta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kuchta, D. (2016). Fuzzy Stage Dependent Travelling Salesman Problem with Networks as Nodes. In: Borzemski, L., Grzech, A., Świątek, J., Wilimowska, Z. (eds) Information Systems Architecture and Technology: Proceedings of 36th International Conference on Information Systems Architecture and Technology – ISAT 2015 – Part I. Advances in Intelligent Systems and Computing, vol 429. Springer, Cham. https://doi.org/10.1007/978-3-319-28555-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28555-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28553-5

  • Online ISBN: 978-3-319-28555-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics