{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T20:24:49Z","timestamp":1770150289596,"version":"3.49.0"},"publisher-location":"New Delhi","reference-count":31,"publisher":"Springer India","isbn-type":[{"value":"9788132226932","type":"print"},{"value":"9788132226956","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,10,25]],"date-time":"2015-10-25T00:00:00Z","timestamp":1445731200000},"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-81-322-2695-6_26","type":"book-chapter","created":{"date-parts":[[2015,10,25]],"date-time":"2015-10-25T00:41:10Z","timestamp":1445733670000},"page":"295-314","source":"Crossref","is-referenced-by-count":4,"title":["Profit Maximization of TSP with Uncertain Parameters Through a Hybrid Algorithm"],"prefix":"10.1007","author":[{"given":"Aditi","family":"Khanra","sequence":"first","affiliation":[]},{"given":"Manas Kumar","family":"Maiti","sequence":"additional","affiliation":[]},{"given":"Manoranjan","family":"Maiti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,25]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.: The Traveling Salesman Problem. Princeton University Press, Princeton (2007)"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"CN Fiechter","year":"1994","unstructured":"Fiechter, C.N.: A parallel tabu search algorithm for large traveling salesman problems. Discret. Appl. Math. 51(3), 243\u2013267 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.ejor.2008.10.012","volume":"198","author":"TS Chang","year":"2009","unstructured":"Chang, T.S., WahWan, Y., Ooi, W.T.: A stochastic dynamic traveling salesman problem with hard time windows. Eur. J. Oper. Res. 198(3), 748\u2013759 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Chen, C.H., Liu, Y.C., Lin, C.J., Lin, C.T.: A hybrid of cooperative particle swarm optimization and cultural algorithm for neural fuzzy networks. In: FUZZ-IEEE, IEEE, 238\u2013245 (2008)","DOI":"10.1109\/FUZZY.2008.4630371"},{"issue":"10","key":"26_CR5","doi-asserted-by":"publisher","first-page":"8947","DOI":"10.1016\/j.eswa.2012.02.029","volume":"39","author":"Y Nagata","year":"2012","unstructured":"Nagata, Y., Soler, D.: A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst. Appl. 39(10), 8947\u20138953 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"26_CR6","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1109\/3468.709611","volume":"28","author":"CC Lo","year":"1998","unstructured":"Lo, C.C., Hsu, C.C.: An annealing framework with learning memory. Trans. Syst. Man Cyber. Part A 28(5), 648\u2013661 (1998)","journal-title":"Trans. Syst. Man Cyber. Part A"},{"key":"26_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms $$+$$ +","author":"Z Michalewicz","year":"1992","unstructured":"Michalewicz, Z.: Genetic Algorithms $$+$$ + Data Structures $$=$$ = Evolution Programs. Springer, New York (1992)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1007\/3-540-45712-7_85","volume-title":"PPSN","author":"L Bianchi","year":"2002","unstructured":"Bianchi, L., Gambardella, L.M., Dorigo, M.: An ant colony optimization approach to the probabilistic traveling salesman problem. In: Guerv\u00f3s, J.J.M., Adamidis, P., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) PPSN. Lecture Notes in Computer Science, vol. 2439, pp. 883\u2013892. Springer, Berlin (2002)"},{"key":"26_CR9","volume-title":"Fundamentals of Computational Swarm Intelligence","author":"AP Engelbrecht","year":"2006","unstructured":"Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Hoboken (2006)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. Perth, Australia, IEEE Service Center, Piscataway, NJ (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"9","key":"26_CR11","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"J Majumdar","year":"2011","unstructured":"Majumdar, J., Bhunia, A.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235(9), 3063\u20133078 (2011)","journal-title":"J. Comput. Appl. Math."},{"issue":"10","key":"26_CR12","doi-asserted-by":"publisher","first-page":"2949","DOI":"10.1016\/j.cor.2005.11.008","volume":"34","author":"YH Liu","year":"2007","unstructured":"Liu, Y.H.: A hybrid scatter search for the probabilistic traveling salesman problem. Comput. Oper. Res. 34(10), 2949\u20132963 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/0360-8352(94)90340-9","volume":"27","author":"R Cheng","year":"1994","unstructured":"Cheng, R., Gen, M.: 16th annual conference on computers and industrial engineering crossover on intensive search and traveling salesman problem. Comput. Ind. Eng. 27(1), 485\u2013488 (1994)","journal-title":"Comput. Ind. Eng."},{"issue":"1-4","key":"26_CR14","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0360-8352(95)00132-K","volume":"29","author":"Runwei Cheng","year":"1995","unstructured":"Cheng, R., Gen, M., Sasaki, M.: Film-copy deliverer problem using genetic algorithms. In: Proceedings of the 17th International Conference on Computers and Industrial Engineering Computers and Industrial Engineering 29(14) 549\u2013553 (1995)","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"26_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for tsp and generalized tsp. Inf. Process. Lett. 103(5), 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon, C., Kim, J., Choi, G., Seo, Y.: An encient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 140, 606\u2013617 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"26_CR17","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc, M., Kennedy, J.: The particle swarm\u2014explosion, stability, and convergence in a multidimensional complex space. Trans. Evol. Comput. 6(1), 58\u201373 (2002)","journal-title":"Trans. Evol. Comput."},{"issue":"910","key":"26_CR18","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1016\/j.mcm.2006.11.035","volume":"46","author":"CB Cheng","year":"2007","unstructured":"Cheng, C.B., Mao, C.P.: A modified ant colony system for solving the travelling salesman problem with time windows. Math. Comput. Model. 46(910), 1225\u20131235 (2007)","journal-title":"Math. Comput. Model."},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.asoc.2010.03.002","volume":"11","author":"S Ghafurian","year":"2011","unstructured":"Ghafurian, S., Javadian, N.: An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems. Appl. Soft Comput. 11(1), 1256\u20131262 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"26_CR20","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","volume":"14","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the tsptw. INFORMS J. Comput. 14(4), 403\u2013417 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"26_CR21","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1016\/j.asoc.2012.04.008","volume":"13","author":"Jie Bai","year":"2013","unstructured":"Bai, J., Yang, G.K., Chen, Y.W., Hu, L.S., Pan, C.C.: A model induced max-min ant colony optimization for asymmetric traveling salesman problem. Appl. Soft Comput. 13(3) 1365\u20131375 (2013) Hybrid evolutionary systems for manufacturing processes","journal-title":"Applied Soft Computing"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.neucom.2004.02.006","volume":"62","author":"KS Leung","year":"2004","unstructured":"Leung, K.S., Jin, H., Xu, Z.: An expanding self-organizing neural network for the traveling salesman problem. Neurocomputing 62, 267\u2013292 (2004)","journal-title":"Neurocomputing"},{"issue":"4","key":"26_CR23","doi-asserted-by":"publisher","first-page":"3873","DOI":"10.1016\/j.eswa.2010.09.048","volume":"38","author":"SM Chen","year":"2011","unstructured":"Chen, S.M., Chien, C.Y.: Parallelized genetic ant colony systems for solving the traveling salesman problem. Expert Syst. Appl. 38(4), 3873\u20133883 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"26_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73\u201381 (1997)","journal-title":"Biosystems"},{"issue":"9","key":"26_CR25","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1016\/j.cor.2009.11.015","volume":"37","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2010","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Blum, C.: Beam-aco for the travelling salesman problem with time windows. Comput. Oper. Res. 37(9), 1570\u20131583 (2010)","journal-title":"Comput. Oper. Res."},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, 39\u201343 (1995)","DOI":"10.1109\/MHS.1995.494215"},{"issue":"1","key":"26_CR27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ejor.2008.08.009","volume":"198","author":"HL Petersen","year":"2009","unstructured":"Petersen, H.L., Madsen, O.B.G.: The double travelling salesman problem with multiple stacks\u2014formulation and heuristic solution approaches. Eur. J. Oper. Res. 198(1), 139\u2013147 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"26_CR28","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TEVC.2004.826071","volume":"8","author":"A Ratnaweera","year":"2004","unstructured":"Ratnaweera, A., Halgamuge, S.K., Watson, H.C.: Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans. Evol. Comput. 8(3), 240\u2013255 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"26_CR29","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L Zadeh","year":"1965","unstructured":"Zadeh, L.: Fuzzy sets. Inf. Control. 8, 338\u2013356 (1965)","journal-title":"Inf. Control."},{"key":"26_CR30","first-page":"883","volume-title":"Parallel Problem Solving from Nature PPSN VII","author":"L Bianchi","year":"2002","unstructured":"Bianchi, L., Gambardella, L., Dorigo, M.: An ant colony optimization approach to the probabilistic traveling salesman problem. Parallel Problem Solving from Nature PPSN VII, vol. 2439, pp. 883\u2013892. Springer, Berlin (2002)"},{"issue":"10","key":"26_CR31","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1016\/j.ins.2008.12.016","volume":"179","author":"TAS Masutti","year":"2009","unstructured":"Masutti, T.A.S., de Castro, L.N.: A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf. Sci. 179(10), 1454\u20131468 (2009)","journal-title":"Inf. Sci."}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the 4th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA) 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-2695-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T03:55:49Z","timestamp":1748663749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-81-322-2695-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,25]]},"ISBN":["9788132226932","9788132226956"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-2695-6_26","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,25]]}}}