{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T05:04:49Z","timestamp":1779426289383,"version":"3.53.1"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100018970","name":"Telkom University","doi-asserted-by":"publisher","award":["007\/LIT06\/PPM-LIT\/2025"],"award-info":[{"award-number":["007\/LIT06\/PPM-LIT\/2025"]}],"id":[{"id":"10.13039\/501100018970","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ins.2026.123521","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:07:00Z","timestamp":1776294420000},"page":"123521","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A discrete battlefield optimization algorithm (DBf) for optimal route recommendation with weighted multi-criteria preferences"],"prefix":"10.1016","volume":"748","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0795-9559","authenticated-orcid":false,"given":"Z.K.A.","family":"Baizal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Agung Toto","family":"Wibowo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Putri Nurika","family":"Adila","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saskia","family":"Putri Ananda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123521_bib0005","doi-asserted-by":"crossref","DOI":"10.1007\/s10732-014-9242-5","article-title":"A survey on algorithmic approaches for solving tourist trip design problems","volume":"20","author":"Gavalas","year":"2014","journal-title":"J. Heuristics"},{"key":"10.1016\/j.ins.2026.123521_bib0010","series-title":"2024 2nd International Conference on Technology Innovation and Its Applications (ICTIIA)","first-page":"1","article-title":"Tourist route recommender system using whale optimization algorithm (a case study of Yogyakarta)","author":"Fitriani","year":"2024"},{"issue":"5","key":"10.1016\/j.ins.2026.123521_bib0015","article-title":"Improved whale optimization algorithm with variable neighbourhood search strategy (woa-vns) in solving vehicle routing problem (vrp) for recommending multi-days tourist routes in Yogyakarta","volume":"17","author":"Ananda","year":"2024","journal-title":"International Journal of Intelligent Engineering & Systems"},{"key":"10.1016\/j.ins.2026.123521_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2025.122223","article-title":"A multiobjective edge-based learning algorithm for the vehicle routing problem with time windows","volume":"715","author":"Zhou","year":"2025","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123521_bib0025","author":"Liu"},{"issue":"4","key":"10.1016\/j.ins.2026.123521_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0213777","article-title":"Orienteering problem with functional profits for multi-source dynamic path construction","volume":"14","author":"Mukhina","year":"2019","journal-title":"PLOS ONE"},{"key":"10.1016\/j.ins.2026.123521_bib0035","series-title":"Definitions and Mathematical Models of OP Variants","first-page":"21","author":"Vansteenwegen","year":"2019"},{"key":"10.1016\/j.ins.2026.123521_bib0040","doi-asserted-by":"crossref","DOI":"10.7717\/peerj-cs.3350","article-title":"KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm","volume":"11","author":"Baizal","year":"2025","journal-title":"Peerj Comput. Sci."},{"key":"10.1016\/j.ins.2026.123521_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106663","article-title":"Route recombination for deterministic and non-deterministic orienteering problems with time windows: a dynamic programming approach","volume":"167","author":"Tran","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ins.2026.123521_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105357","article-title":"A reinforcement learning approach to the orienteering problem with time windows","volume":"133","author":"Gama","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.ins.2026.123521_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.heliyon.2020.e04202","article-title":"A solution approach to the orienteering problem with time windows and synchronisation constraints","volume":"6","author":"Roozbeh","year":"2020","journal-title":"Heliyon"},{"key":"10.1016\/j.ins.2026.123521_bib0060","series-title":"Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland","year":"1975"},{"key":"10.1016\/j.ins.2026.123521_bib0065","doi-asserted-by":"crossref","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.ins.2026.123521_bib0070","doi-asserted-by":"crossref","DOI":"10.1109\/3477.484436","article-title":"Ant system: optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"key":"10.1016\/j.ins.2026.123521_bib0075","series-title":"Proceedings of ICNN\u201995 - International Conference on Neural Networks","first-page":"1942","article-title":"Particle swarm optimization","volume":"vol. 4","author":"Kennedy","year":"1995"},{"key":"10.1016\/j.ins.2026.123521_bib0080","series-title":"An Idea Based on Honey Bee Swarm for Numerical Optimization","author":"Karaboga","year":"2005"},{"key":"10.1016\/j.ins.2026.123521_bib0085","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","article-title":"The whale optimization algorithm","volume":"95","author":"Mirjalili","year":"2016","journal-title":"Adv. Eng. Softw."},{"key":"10.1016\/j.ins.2026.123521_bib0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.126097","article-title":"Battlefield optimization algorithm","volume":"266","author":"Setiawan","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123521_bib0095","series-title":"Proceedings of the 29th ACM Conference on User Modeling, Adaptation and Personalization","first-page":"119","article-title":"User-centered evaluation of popularity bias in recommender systems","author":"Abdollahpouri","year":"2021"},{"key":"10.1016\/j.ins.2026.123521_bib0100","author":"Abdollahpouri"},{"key":"10.1016\/j.ins.2026.123521_bib0105","author":"Abdollahpouri"},{"key":"10.1016\/j.ins.2026.123521_bib0110","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","article-title":"Heuristic methods applied to orienteering","volume":"35","author":"Tsiligirides","year":"1984","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.ins.2026.123521_bib0115","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","article-title":"The orienteering problem: a survey","volume":"209","author":"Vansteenwegen","year":"2011","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.ins.2026.123521_bib0120","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","article-title":"Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming","volume":"36","author":"Righini","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"10.1016\/j.ins.2026.123521_bib0125","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","article-title":"Iterated local search for the team orienteering problem with time windows","volume":"36","author":"Vansteenwegen","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ins.2026.123521_bib0130","series-title":"Advances in Systems Science","first-page":"609","article-title":"Genetic algorithm solving the orienteering problem with time windows","author":"Karbowska-Chilinska","year":"2014"},{"key":"10.1016\/j.ins.2026.123521_bib0135","series-title":"2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)","first-page":"1124","article-title":"Solving tourist trip planning problem via a simulated annealing algorithm","author":"Sylejmani","year":"2014"},{"key":"10.1016\/j.ins.2026.123521_bib0140","series-title":"2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","first-page":"128","article-title":"Multiobjective orienteering problem with time windows: an ant colony optimization algorithm","author":"Chen","year":"2015"},{"key":"10.1016\/j.ins.2026.123521_bib0145","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.cie.2014.06.004","article-title":"An artificial bee colony algorithm approach for the team orienteering problem with time windows","volume":"74","author":"Cura","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.ins.2026.123521_bib0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.128990","article-title":"Exploiting attributes and keywords for session-based recommendation with multi-view graph neural network","volume":"296","author":"Chen","year":"2026","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123521_bib0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.114095","article-title":"Disentangling multi-factor effects via graph contrastive learning for travel recommendation","volume":"186","author":"Chen","year":"2026","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.ins.2026.123521_bib0160","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s11257-021-09294-8","article-title":"Interplay between upsampling and regularization for provider fairness in recommender systems","volume":"31","author":"Boratto","year":"2021","journal-title":"User Model. User-Adapt. Interact."},{"key":"10.1016\/j.ins.2026.123521_bib0165","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107439","article-title":"Ant colony optimization for traveling salesman problem based on parameters optimization","volume":"107","author":"Wang","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.ins.2026.123521_bib0170","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","article-title":"A swap sequence based artificial bee colony algorithm for traveling salesman problem","volume":"44","author":"Khan","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.ins.2026.123521_bib0175","doi-asserted-by":"crossref","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","article-title":"Solving travelling salesman problem using black hole algorithm","volume":"22","author":"Hatamlou","year":"2018","journal-title":"Soft Comput."},{"key":"10.1016\/j.ins.2026.123521_bib0180","article-title":"A hierarchic approach based on swarm intelligence to solve the traveling salesman problem","volume":"23","author":"G\u00fcnd\u00fcz","year":"2015","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"10.1016\/j.ins.2026.123521_bib0185","doi-asserted-by":"crossref","first-page":"4971","DOI":"10.1016\/j.matpr.2020.10.384","article-title":"A simulated annealing approach to solve a multi traveling salesman problem in a fmcg company","volume":"46","author":"Srinivas Rao","year":"2021","journal-title":"Mater. Today Proc."},{"key":"10.1016\/j.ins.2026.123521_bib0190","series-title":"Digital Ecosystems: Interconnecting Advanced Networks with AI Applications","first-page":"506","article-title":"Investigation of a genetic algorithm for solving the travelling salesman problem","author":"Pyrih","year":"2024"},{"key":"10.1016\/j.ins.2026.123521_bib0195","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107275","article-title":"Djaya: a discrete Jaya algorithm for solving traveling salesman problem","volume":"105","author":"Gunduz","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.ins.2026.123521_bib0200","series-title":"Advances in Global Optimization","first-page":"137","article-title":"A discrete state transition algorithm for generalized traveling salesman problem","author":"Tang","year":"2015"},{"key":"10.1016\/j.ins.2026.123521_bib0205","series-title":"2025 Joint International Conference on Automation-Intelligence-Safety (ICAIS) & International Symposium on Autonomous Systems (ISAS)","first-page":"1","article-title":"Particle swarm optimization-based algorithms for traveling salesman problem","author":"Jin","year":"2025"},{"key":"10.1016\/j.ins.2026.123521_bib0210","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/s40558-024-00297-w","article-title":"Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques","volume":"26","author":"Sylejmani","year":"2024","journal-title":"Inf. Technol. Tour."},{"key":"10.1016\/j.ins.2026.123521_bib0215","doi-asserted-by":"crossref","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.ins.2026.123521_bib0220","first-page":"879","article-title":"A discrete tree-seed algorithm for solving symmetric traveling salesman problem","volume":"23","author":"Cinar","year":"2020","journal-title":"Eng. Sci. Technol. Int. J."},{"key":"10.1016\/j.ins.2026.123521_bib0225","doi-asserted-by":"crossref","DOI":"10.1145\/321105.321111","article-title":"Dynamic programming treatment of the travelling Salesman problem","volume":"9","author":"Bellman","year":"1962","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"10.1016\/j.ins.2026.123521_bib0230","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/ijoc.2013.0570","article-title":"Optimization-based approaches for maximizing aggregate recommendation diversity","volume":"26","author":"Adomavicius","year":"2014","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.ins.2026.123521_bib0235","doi-asserted-by":"crossref","first-page":"10","DOI":"10.4102\/aveh.v80i1.612","article-title":"Remarks on the use of pearson\u2019s and spearman\u2019s correlation coefficients in assessing relationships in ophthalmic data","volume":"80","author":"Alsaqr","year":"2021","journal-title":"Afr. Vis. Eye Health"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004524?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004524?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T04:05:20Z","timestamp":1779422720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526004524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":47,"alternative-id":["S0020025526004524"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123521","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A discrete battlefield optimization algorithm (DBf) for optimal route recommendation with weighted multi-criteria preferences","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123521","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123521"}}