{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T14:51:35Z","timestamp":1780066295633,"version":"3.54.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T00:00:00Z","timestamp":1583193600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T00:00:00Z","timestamp":1583193600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00521-020-04798-7","type":"journal-article","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T13:03:08Z","timestamp":1583240588000},"page":"13953-13969","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A multi-objective open set orienteering problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Joydeep","family":"Dutta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Partha Sarathi","family":"Barma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anupam","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samarjit","family":"Kar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tanmay","family":"De","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,3,3]]},"reference":[{"key":"4798_CR1","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"E Lawler","year":"1985","unstructured":"Lawler E, Lenstra J, Rinnooy K, Shmoys D (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, NY"},{"key":"4798_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas E (1989) The prize collecting traveling salesman problem. Networks 19:621\u2013636","journal-title":"Networks"},{"issue":"3","key":"4798_CR3","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti M, Gonzlez JJS, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45(3):378\u2013394","journal-title":"Oper Res"},{"key":"4798_CR4","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transpor Sci 39:188\u2013205","journal-title":"Transpor Sci"},{"key":"4798_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G, Ramser J (1959) The truck dispatching problem\u2019. Manag Sci 6:80. https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manag Sci"},{"key":"4798_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides T (1984) Heuristic methods applied to orienteering. J Oper Res Soc 35:797\u2013809","journal-title":"J Oper Res Soc"},{"key":"4798_CR7","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.ejor.2014.04.006","volume":"238","author":"E Angelelli","year":"2014","unstructured":"Angelelli E, Archetti C, Vindigni M (2014) The clustered orienteering problem. Eur J Oper Res 238:404\u2013414","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4798_CR8","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.ejor.2017.11.009","volume":"267","author":"C Archetti","year":"2017","unstructured":"Archetti C, Carrabs F, Cerulli R (2017) The set orienteering problem. Eur J Oper Res 267(1):264\u2013272","journal-title":"Eur J Oper Res"},{"key":"4798_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.01.047","author":"R P\u011bni\u010dka","year":"2019","unstructured":"P\u011bni\u010dka R, Faigl J, Saska M (2019) Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2019.01.047","journal-title":"Eur J Oper Res"},{"key":"4798_CR10","doi-asserted-by":"crossref","unstructured":"Faigl J, P\u011bni\u010dka R, Best G (2016) Self-organizing map-based solution for the orienteering problem with neighborhoods. In: Proceedings of the IEEE international conference on systems, man, and cybernetics, pp 1315\u20131321","DOI":"10.1109\/SMC.2016.7844421"},{"issue":"2","key":"4798_CR11","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1109\/LRA.2017.2666261","volume":"2","author":"R P\u011bni\u010dka","year":"2017","unstructured":"P\u011bni\u010dka R, Faigl J, V\u00e1\u02c7na P, Saska M (2017) Dubins orienteering problem. IEEE Robot Autom Lett 2(2):1210\u20131217","journal-title":"IEEE Robot Autom Lett"},{"key":"4798_CR12","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"I Chao","year":"1996","unstructured":"Chao I, Golden B, Wasil E (1996) Theory and methodology\u2014a fast and effective heuristic for the orienteering problem. Eur J Oper Res 88:475\u2013489","journal-title":"Eur J Oper Res"},{"key":"4798_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte G, Martello S (1990) The selective traveling salesman problem. Discrete Appl Math 26:193\u2013207","journal-title":"Discrete Appl Math"},{"issue":"4","key":"4798_CR14","first-page":"515","volume":"31","author":"S Kataoka","year":"1988","unstructured":"Kataoka S, Morito S (1988) An algorithm for the single constraint maximum collection problem. J Oper Res Soc Jpn 31(4):515\u2013530","journal-title":"J Oper Res Soc Jpn"},{"key":"4798_CR15","doi-asserted-by":"crossref","unstructured":"Arkin E, Mitchell J, Narasimhan G (1998) Resource-constrained geometric network optimization. In: Proceedings 14th ACM symposium on computational geometry, June, pp 307\u2013316","DOI":"10.1145\/276884.276919"},{"key":"4798_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen P, Souffriau W, Van Oudheusden D (2011) The orienteering problem: a survey. Eur J Oper Res 209:1\u201310. https:\/\/doi.org\/10.1016\/j.ejor.2010.03.045","journal-title":"Eur J Oper Res"},{"key":"4798_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.059","author":"A Gunawan","year":"2016","unstructured":"Gunawan A, Lau H, Vansteenwegen P (2016) Orienteering problem: a survey of recent variants, solution approaches, and applications. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2016.04.059","journal-title":"Eur J Oper Res"},{"issue":"4","key":"4798_CR18","doi-asserted-by":"publisher","first-page":"e0213777","DOI":"10.1371\/journal.pone.0213777","volume":"14","author":"K Mukhina","year":"2019","unstructured":"Mukhina K, Visheratin A, Nasonov D (2019) Orienteering problem with functional profits for multi-source dynamic path construction. PLoS ONE 14(4):e0213777. https:\/\/doi.org\/10.1371\/journal.pone.0213777","journal-title":"PLoS ONE"},{"key":"4798_CR19","doi-asserted-by":"crossref","unstructured":"Hanafi S, Mansini R, Zanotti R (2019) The\u00a0multi-visit team\u00a0orienteering\u00a0problem\u00a0with precedence constraints. In: European journal of operational research (In Press)","DOI":"10.1016\/j.ejor.2019.09.045"},{"key":"4798_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106084","author":"V Yu","year":"2019","unstructured":"Yu V, Redi A, Jewpanya P, Gunawan A (2019) Selective discrete particle swarm optimization for the team\u00a0orienteering\u00a0problem\u00a0with time windows and partial scores. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2019.106084","journal-title":"Comput Ind Eng"},{"issue":"3","key":"4798_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11721-009-0029-5","volume":"3","author":"M Schilde","year":"2009","unstructured":"Schilde M, Doerner KF, Hartl RF, Kiechle G (2009) Metaheuristics for the bi-objective orienteering problem. Swarm Intelligence. 3(3):179\u2013201. https:\/\/doi.org\/10.1007\/s11721-009-0029-5","journal-title":"Swarm Intelligence."},{"key":"4798_CR22","doi-asserted-by":"publisher","unstructured":"Chen YH, Sun WJ, Chiang TC (2015) Multiobjective orienteering problem with time windows: An ant colony optimization algorithm. In: 2015 conference on technologies and applications of artificial intelligence, pp 128\u2013135 (TAAI) https:\/\/doi.org\/10.13140\/rg.2.1.2461.3849","DOI":"10.13140\/rg.2.1.2461.3849"},{"key":"4798_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.03.053","author":"Y Mei","year":"2016","unstructured":"Mei Y, Salim F, Li X (2016) Efficient meta-heuristics for the multi-objective time-dependent orienteering problem. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2016.03.053","journal-title":"Eur J Oper Res"},{"key":"4798_CR24","unstructured":"Yu V, Jewpanya P, Yang ZY, Redi P, Agus Y, Idrakarna P (2017) Solving the multi-objective orienteering problem with time windows using simulated annealing. In: Proceedings of the international conference on innovation and management 2017, Tokyo, Japan"},{"issue":"4","key":"4798_CR25","doi-asserted-by":"publisher","first-page":"2287","DOI":"10.3233\/JIFS-171331","volume":"34","author":"J Wang","year":"2018","unstructured":"Wang J, Guo J, Zheng M, Wang Z, Li Z (2018) Uncertain multiobjective orienteering problem and its application to UAV reconnaissance mission planning. J Intell Fuzzy Syst 34(4):2287\u20132299. https:\/\/doi.org\/10.3233\/JIFS-171331","journal-title":"J Intell Fuzzy Syst"},{"key":"4798_CR26","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.asoc.2018.08.026","volume":"73","author":"W Hu","year":"2018","unstructured":"Hu W, Fathi M, Pardalos P (2018) A multi-objective evolutionary algorithm based on decomposition and constraint programming for the multi-objective team orienteering problem with time windows. Appl Soft Comput 73:383\u2013393","journal-title":"Appl Soft Comput"},{"issue":"4","key":"4798_CR27","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s40092-019-0315-9","volume":"15","author":"I Hapsari","year":"2019","unstructured":"Hapsari I, Surjandari I, Komarudin KJ, Int Ind Eng (2019) Solving multi-objective team orienteering problem with time windows using adjustment iterated local search. J Ind Eng Int 15(4):679\u2013693. https:\/\/doi.org\/10.1007\/s40092-019-0315-9","journal-title":"J Ind Eng Int"},{"key":"4798_CR28","doi-asserted-by":"publisher","unstructured":"Yahiaoui AE, Moukrim A, Serairi M (2017) Hybrid Heuristic for the clustered orienteering problem. In: Bekta\u015f T, Coniglio S, Martinez-Sykora A, Vo\u00df S. (eds) Computational logistics. ICCL 2017. Lecture Notes in Computer Science, Springer, Cham, vol 10572, pp 19\u201333. https:\/\/doi.org\/10.1007\/978-3-319-68496-3_2","DOI":"10.1007\/978-3-319-68496-3_2"},{"key":"4798_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.08.012","author":"E \u00c1lvarez-Miranda","year":"2017","unstructured":"\u00c1lvarez-Miranda E, Luipersbeck M, Sinnl M (2017) Gotta (efficiently) catch them all: pok\u00e9mon GO meets orienteering problems. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2017.08.012","journal-title":"Eur J Oper Res"},{"key":"4798_CR30","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"4798_CR31","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary Algorithm. TIK-Report, p 103"},{"key":"4798_CR32","doi-asserted-by":"publisher","unstructured":"Goldberg D, Lingle R (1985) Alleles, Loci and the traveling salesman problem. In: Proceedings of the 1st international conference on genetic algorithms and their applications, Los Angeles, USA, pp 154\u2013159. https:\/\/doi.org\/10.1155\/2017\/7430125","DOI":"10.1155\/2017\/7430125"},{"key":"4798_CR33","unstructured":"Veldhuizen DA, Lamont GB (1998) Multiobjective evolutionary algorithm research: a history and analysis. Technical Report TR-98-03, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright Paterson, AFB, OH"},{"key":"4798_CR34","unstructured":"Zhou A, Jin Y, Zhang Q, Sendho B, Tsang E (2006) Combining model-based and genetics-based offspring generation for multiobjective optimization using a convergence criterion. In: 2006 IEEE congress on evolutionary computation (Sheraton Vancouver Wall Center Vancouver, BC, Canada, pp 3234\u20133241"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-04798-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-020-04798-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-04798-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T01:08:04Z","timestamp":1614733684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-020-04798-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,3]]},"references-count":34,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["4798"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-04798-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,3]]},"assertion":[{"value":"27 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors of this research paper declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}