{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:48:47Z","timestamp":1725850127866},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319285535"},{"type":"electronic","value":"9783319285559"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28555-9_8","type":"book-chapter","created":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T15:13:16Z","timestamp":1456240396000},"page":"89-100","source":"Crossref","is-referenced-by-count":1,"title":["Fuzzy Stage Dependent Travelling Salesman Problem with Networks as Nodes"],"prefix":"10.1007","author":[{"given":"Dorota","family":"Kuchta","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,24]]},"reference":[{"key":"8_CR1","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization","author":"Bernhard Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization, Theory and Algorithms. Algorithms and Combinatorics, 21st edn. Springer, Berlin, Heidelberg, New York, Tokyo, Paris, Milan (2012)"},{"key":"8_CR2","volume-title":"How to Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2010","unstructured":"Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin, Heidelberg, New York, Tokyo, Paris, Milan (2010)"},{"key":"8_CR3","unstructured":"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\u2013108. Springer, Berlin, Germany (2006)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Botzheim, J., F\u00f6ldesi P., K\u00f3czy T.L.: Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. In: Proceedings of IFSA-EUSFLAT, pp. 1667\u20131672 (2009)","DOI":"10.1109\/ISCIII.2009.5342281"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0898-1221(83)90013-5","volume":"9","author":"LA Zadeh","year":"1983","unstructured":"Zadeh, L.A.: A computational approach to fuzzy quantifiers in natural languages. Comput. Math Appl. 9(1), 149\u2013184 (1983)","journal-title":"Comput. Math Appl."},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","volume":"15","author":"Chiranjit Changdar","year":"2014","unstructured":"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\u201337 (2014)","journal-title":"Swarm and Evolutionary Computation"},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s12543-013-0159-8","volume":"5","author":"A Gupta","year":"2013","unstructured":"Gupta, A., Kumar, A., Sharma, M.K.: Applications of fuzzy linear programming with generalized LR flat fuzzy parameter. Fuzzy Inf. Eng. 5(4), 475\u2013492 (2013)","journal-title":"Fuzzy Inf. Eng."},{"key":"8_CR8","unstructured":"Isleyen, S.K., Kesen, S.E., Bayko\u00e7, \u00d6.F.: From analytical perspective to heuristic approach: travelling salesman problem with discrete fuzzy travel times. Gazi Univ. J. Sci. 22(4), 267\u2013276 (2009)"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/trsc.1120.0449","volume":"48","author":"J Cordeau","year":"2014","unstructured":"Cordeau, J., Ghiani, G., Guerriero, E.: Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem. Transp. Sci. 48(1), 46\u201358 (2014)","journal-title":"Transp. Sci."},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0377-2217(93)E0238-S","volume":"83","author":"L Gouveia","year":"1995","unstructured":"Gouveia, L., Voss, S.: A classification of formulations for the (time-dependent) traveling salesman problem. Eur. J. Oper. Res. 83(1), 69\u201382 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR11","unstructured":"Li, F., Golden, B., Wasil, E.: Solving the time dependent traveling salesman problem (2005)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0165-0114(85)90012-0","volume":"15","author":"G Bortolan","year":"1985","unstructured":"Bortolan, G., Degani, R.: A review of some methods for ranking fuzzy subsets. Fuzzy Sets Syst. 15(1), 1\u201319 (1985)","journal-title":"Fuzzy Sets Syst."}],"container-title":["Advances in Intelligent Systems and Computing","Information Systems Architecture and Technology: Proceedings of 36th International Conference on Information Systems Architecture and Technology \u2013 ISAT 2015 \u2013 Part I"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28555-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:36:56Z","timestamp":1559403416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28555-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319285535","9783319285559"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28555-9_8","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}