{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:56:29Z","timestamp":1777870589472,"version":"3.51.4"},"reference-count":60,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-20-THIA-0019"],"award-info":[{"award-number":["ANR-20-THIA-0019"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["AI@IMT"],"award-info":[{"award-number":["AI@IMT"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-22-CE22-0016-01"],"award-info":[{"award-number":["ANR-22-CE22-0016-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejor.2025.12.029","type":"journal-article","created":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T16:12:23Z","timestamp":1765901543000},"page":"414-428","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Feature-guided metaheuristic with diversity management for solving the capacitated vehicle routing problem"],"prefix":"10.1016","volume":"333","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8285-2383","authenticated-orcid":false,"given":"Bachtiar","family":"Herdianto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2614-3822","authenticated-orcid":false,"given":"Romain","family":"Billot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5789-9027","authenticated-orcid":false,"given":"Flavien","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3855-9072","authenticated-orcid":false,"given":"Marc","family":"Sevaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejor.2025.12.029_bib0001","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.orl.2022.01.018","article-title":"Guidelines for the computational testing of machine learning approaches to vehicle routing problems","volume":"50","author":"Accorsi","year":"2022","journal-title":"Operations Research Letters"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.029_bib0002","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/trsc.2021.1059","article-title":"A fast and scalable heuristic for the solution of large-scale capacitated vehicle routing problems","volume":"55","author":"Accorsi","year":"2021","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.12.029_bib0003","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.cor.2019.03.006","article-title":"Efficiently solving very large-scale routing problems","volume":"107","author":"Arnold","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.107957","article-title":"PILS: Exploring high-order neighborhoods by pattern mining and injection","volume":"116","author":"Arnold","year":"2021","journal-title":"Pattern Recognition"},{"key":"10.1016\/j.ejor.2025.12.029_bib0005","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.cor.2019.01.002","article-title":"Knowledge-guided local search for the vehicle routing problem","volume":"105","author":"Arnold","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0006","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.cor.2018.02.007","article-title":"What makes a VRP solution good? The generation of problem-specific knowledge for heuristics","volume":"106","author":"Arnold","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0007","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.inffus.2019.12.012","article-title":"Explainable artificial intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible ai","volume":"58","author":"Arrieta","year":"2020","journal-title":"Information Fusion"},{"key":"10.1016\/j.ejor.2025.12.029_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103667","article-title":"Relation between prognostics predictor evaluation metrics and local interpretability SHAP values","volume":"306","author":"Baptista","year":"2022","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.029_bib0009","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","article-title":"Machine learning for combinatorial optimization: A methodological tour d\u2019horizon","volume":"290","author":"Bengio","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0010","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Machine Learning"},{"key":"10.1016\/j.ejor.2025.12.029_bib0011","series-title":"Classification and regression trees","author":"Breiman","year":"2017"},{"key":"10.1016\/j.ejor.2025.12.029_bib0012","series-title":"Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining","first-page":"785","article-title":"Xgboost: A scalable tree boosting system","author":"Chen","year":"2016"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.029_bib0013","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.029_bib0014","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.029_bib0015","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"Dem\u0161ar","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0016","first-page":"1189","article-title":"Greedy function approximation: A gradient boosting machine","author":"Friedman","year":"2001","journal-title":"Annals of Statistics"},{"issue":"1-3","key":"10.1016\/j.ejor.2025.12.029_bib0017","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","article-title":"Ejection chains, reference structures and alternating path methods for traveling salesman problems","volume":"65","author":"Glover","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2025.12.029_bib0018","first-page":"1","article-title":"Tabu search and adaptive memory programming-advances, applications and challenges","author":"Glover","year":"1997","journal-title":"Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies"},{"key":"10.1016\/j.ejor.2025.12.029_bib0019","first-page":"653","article-title":"Fundamentals of scatter search and path relinking","volume":"Vol. 29, no 3","author":"Glover","year":"2000","journal-title":"Control and Cybernetics"},{"issue":"5","key":"10.1016\/j.ejor.2025.12.029_bib0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3236009","article-title":"A survey of methods for explaining black box models","volume":"51","author":"Guidotti","year":"2018","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"10.1016\/j.ejor.2025.12.029_bib0021","series-title":"The elements of statistical learning: data mining, inference, and prediction","volume":"vol. 2","author":"Hastie","year":"2009"},{"key":"10.1016\/j.ejor.2025.12.029_bib0022","article-title":"An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems","volume":"12","author":"Helsgaun","year":"2017","journal-title":"Roskilde: Roskilde University"},{"key":"10.1016\/j.ejor.2025.12.029_bib0023","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10732-006-4192-1","article-title":"Path relinking for the vehicle routing problem","volume":"12","author":"Ho","year":"2006","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2025.12.029_bib0024","series-title":"International conference on learning representations","article-title":"Efficient active search for combinatorial optimization problems","author":"Hottung","year":"2022"},{"key":"10.1016\/j.ejor.2025.12.029_bib0025","series-title":"Ecai 2020","first-page":"443","article-title":"Neural large neighborhood search for the capacitated vehicle routing problem","author":"Hottung","year":"2020"},{"key":"10.1016\/j.ejor.2025.12.029_bib0026","unstructured":"Joshi, C. K., Laurent, T., & Bresson, X. (2019). An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv: 1906.01227."},{"key":"10.1016\/j.ejor.2025.12.029_bib0027","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0927-0507(05)80121-5","article-title":"Chapter 4 the traveling salesman problem","volume":"vol. 7","author":"J\u00fcnger","year":"1995","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"10.1016\/j.ejor.2025.12.029_bib0028","article-title":"Lightgbm: A highly efficient gradient boosting decision tree","volume":"30","author":"Ke","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/j.ejor.2025.12.029_bib0029","series-title":"Integration of constraint programming, artificial intelligence, and operations research","first-page":"190","article-title":"Deep policy dynamic programming for vehicle routing problems","author":"Kool","year":"2022"},{"key":"10.1016\/j.ejor.2025.12.029_bib0030","series-title":"International conference on learning representations","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2019"},{"issue":"12","key":"10.1016\/j.ejor.2025.12.029_bib0031","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","article-title":"Intensification and diversification with elite tabu search solutions for the linear ordering problem","volume":"26","author":"Laguna","year":"1999","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.029_bib0032","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","article-title":"Fifty years of vehicle routing","volume":"43","author":"Laporte","year":"2009","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.12.029_bib0033","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.cor.2019.05.025","article-title":"A comment on \u201cwhat makes a VRP solution good? the generation of problem-specific knowledge for heuristics\u201d","volume":"110","author":"Lucas","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0034","series-title":"Learning and intelligent optimization: 14th international conference, LION 14, athens, greece, may 24\u201328, 2020, revised selected papers 14","first-page":"143","article-title":"Reducing space search in combinatorial optimization using machine learning tools","author":"Lucas","year":"2020"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.029_bib0035","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1038\/s42256-019-0138-9","article-title":"From local explanations to global understanding with explainable AI for trees","volume":"2","author":"Lundberg","year":"2020","journal-title":"Nature Machine Intelligence"},{"key":"10.1016\/j.ejor.2025.12.029_bib0036","article-title":"A unified approach to interpreting model predictions","volume":"30","author":"Lundberg","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/j.ejor.2025.12.029_bib0037","series-title":"Thirty-seventh conference on neural information processing systems","article-title":"Learning to search feasible and infeasible regions of routing problems with flexible neural K-OPT","author":"Ma","year":"2023"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.029_bib0038","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.10.012","article-title":"Multi-start methods for combinatorial optimization","volume":"226","author":"Mart\u00ed","year":"2013","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.029_bib0039","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","article-title":"Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator","volume":"8","author":"Matsumoto","year":"1998","journal-title":"ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.029_bib0040","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1016\/j.ejor.2022.06.040","article-title":"Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times","volume":"305","author":"Parmentier","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.1016\/j.ejor.2025.12.029_bib0041","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","article-title":"A simple and effective evolutionary algorithm for the vehicle routing problem","volume":"31","author":"Prins","year":"2004","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0042","series-title":"Metaheuristics for vehicle routing problems","first-page":"407","author":"Prodhon","year":"2016"},{"key":"10.1016\/j.ejor.2025.12.029_bib0043","unstructured":"Queiroga, E., Sadykov, R., Uchoa, E., & Vidal, T. (2021). 10,000 Optimal CVRP solutions for testing machine learning based heuristics. AAAI-22 Workshop on Machine Learning for Operations Research (ML4OR),. https:\/\/openreview.net\/forum?id=yHiMXKN6nTl."},{"issue":"3","key":"10.1016\/j.ejor.2025.12.029_bib0044","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","article-title":"Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms","volume":"27","author":"Rego","year":"2001","journal-title":"Parallel Computing"},{"key":"10.1016\/j.ejor.2025.12.029_bib0045","series-title":"GRASP with path-relinking: Recent advances and applications","first-page":"29","author":"Resende","year":"2005"},{"key":"10.1016\/j.ejor.2025.12.029_bib0046","article-title":"Designing and managing the supply chain: Concepts, strategies, and case studies","author":"Simchi-Levi","year":"2002"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.029_bib0047","doi-asserted-by":"crossref","first-page":"254","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":"Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2025.12.029_bib0048","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1016\/j.cor.2004.09.011","article-title":"MA|PM: Memetic algorithms with population management","volume":"33","author":"S\u00f6rensen","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0049","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.cie.2017.03.022","article-title":"Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem","volume":"107","author":"Soto","year":"2017","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"10.1016\/j.ejor.2025.12.029_bib0050","doi-asserted-by":"crossref","first-page":"3197","DOI":"10.1016\/j.cor.2013.02.005","article-title":"Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem","volume":"40","author":"S\u00f6rensen","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.029_bib0051","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.029_bib0052","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","article-title":"The granular tabu search and its application to the vehicle-routing problem","volume":"15","author":"Toth","year":"2003","journal-title":"Informs Journal on Computing"},{"key":"10.1016\/j.ejor.2025.12.029_bib0053","series-title":"Vehicle routing: problems, methods, and applications","author":"Toth","year":"2014"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.029_bib0054","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","article-title":"New benchmark instances for the capacitated vehicle routing problem","volume":"257","author":"Uchoa","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105643","article-title":"Hybrid genetic search for the CVRP: Open-source implementation and swap* neighborhood","volume":"140","author":"Vidal","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.029_bib0056","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","article-title":"A unified solution framework for multi-attribute vehicle routing problems","volume":"234","author":"Vidal","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0057","article-title":"Pointer networks","volume":"28","author":"Vinyals","year":"2015","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"9","key":"10.1016\/j.ejor.2025.12.029_bib0058","doi-asserted-by":"crossref","first-page":"5057","DOI":"10.1109\/TNNLS.2021.3068828","article-title":"Learning improvement heuristics for solving routing problems","volume":"33","author":"Wu","year":"2021","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.029_bib0059","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.ejor.2021.10.032","article-title":"A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties","volume":"300","author":"Zhang","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.029_bib0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.patrec.2025.03.011","article-title":"Machine-learning-based hyper-heuristics for solving the knapsack problem","author":"Z\u00e1rate-Aranda","year":"2025","journal-title":"Pattern Recognition Letters"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009968?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009968?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:25:17Z","timestamp":1777566317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0377221725009968"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.029","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Feature-guided metaheuristic with diversity management for solving the capacitated vehicle routing problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.029","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}