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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Korte, B., Vygen, J.: Combinatorial Optimization, Theory and Algorithms. Algorithms and Combinatorics, 21st edn. Springer, Berlin, Heidelberg, New York, Tokyo, Paris, Milan (2012)
Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin, Heidelberg, New York, Tokyo, Paris, Milan (2010)
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)
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)
Zadeh, L.A.: A computational approach to fuzzy quantifiers in natural languages. Comput. Math Appl. 9(1), 149–184 (1983)
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)
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)
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)
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)
Gouveia, L., Voss, S.: A classification of formulations for the (time-dependent) traveling salesman problem. Eur. J. Oper. Res. 83(1), 69–82 (1995)
Li, F., Golden, B., Wasil, E.: Solving the time dependent traveling salesman problem (2005)
Bortolan, G., Degani, R.: A review of some methods for ranking fuzzy subsets. Fuzzy Sets Syst. 15(1), 1–19 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)