{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T16:58:56Z","timestamp":1792688336029,"version":"4.5.0"},"reference-count":48,"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":[[2027,5,4]],"date-time":"2027-05-04T00:00:00Z","timestamp":1809388800000},"content-version":"am","delay-in-days":276,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"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\/501100020884","name":"National Agency for Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001738","name":"Israel Ministry of Innovation Science & Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001738","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["909\/23"],"award-info":[{"award-number":["909\/23"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2121028"],"award-info":[{"award-number":["2121028"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1817189"],"award-info":[{"award-number":["1817189"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1837779"],"award-info":[{"award-number":["1837779"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1935712"],"award-info":[{"award-number":["1935712"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2321786"],"award-info":[{"award-number":["2321786"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2112533"],"award-info":[{"award-number":["2112533"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006245","name":"Ministry of Science and Technology, Israel","doi-asserted-by":"publisher","award":["3-17385"],"award-info":[{"award-number":["3-17385"]}],"id":[{"id":"10.13039\/501100006245","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006245","name":"Ministry of Science and Technology, Israel","doi-asserted-by":"publisher","award":["3-16079"],"award-info":[{"award-number":["3-16079"]}],"id":[{"id":"10.13039\/501100006245","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2019703"],"award-info":[{"award-number":["2019703"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2021643"],"award-info":[{"award-number":["2021643"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.artint.2026.104542","type":"journal-article","created":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:09:34Z","timestamp":1777097374000},"page":"104542","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Approximate multi-objective search"],"prefix":"10.1016","volume":"357","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5265-7659","authenticated-orcid":false,"given":"Han","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4541-8219","authenticated-orcid":false,"given":"Oren","family":"Salzman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T. K. Satish","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel","family":"Felner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7947-3684","authenticated-orcid":false,"given":"Carlos","family":"Hern\u00e1ndez Ulloa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2026.104542_bib0001","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"40990","article-title":"Multi-objective search: algorithms, applications, and emerging directions","volume":"40","author":"Salzman","year":"2026"},{"issue":"7","key":"10.1016\/j.artint.2026.104542_bib0002","doi-asserted-by":"crossref","first-page":"258","DOI":"10.3390\/ijgi7070258","article-title":"Multi-objective optimisation based planning of power-line grid expansions","volume":"7","author":"Bachmann","year":"2018","journal-title":"ISPRS Int. J. Geo-Information"},{"key":"10.1016\/j.artint.2026.104542_bib0003","series-title":"Robotics: Science and Systems (RSS)","article-title":"Toward asymptotically-optimal inspection planning via efficient near-optimal graph search","author":"Fu","year":"2019"},{"key":"10.1016\/j.artint.2026.104542_bib0004","series-title":"IEEE International Conference on Robotics and Automation (ICRA)","first-page":"7449","article-title":"Computationally-efficient roadmap-based inspection planning via incremental lazy search","author":"Fu","year":"2021"},{"issue":"1","key":"10.1016\/j.artint.2026.104542_bib0005","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2014.08.005","article-title":"The Maximin HAZMAT routing problem","volume":"241","author":"Bronfman","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.artint.2026.104542_bib0006","series-title":"Multicriteria Optimization (2nd Ed.)","author":"Ehrgott","year":"2005"},{"key":"10.1016\/j.artint.2026.104542_bib0007","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cor.2016.06.022","article-title":"Analysis of FPTASes for the multi-objective shortest path problem","volume":"78","author":"Breugem","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.artint.2026.104542_bib0008","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/s00224-007-9096-4","article-title":"Multiobjective optimization: improved FPTAS for shortest paths and non-linear objectives with applications","volume":"45","author":"Tsaggouris","year":"2009","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10.1016\/j.artint.2026.104542_bib0009","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of pareto optima in multiple-objective, shortest-path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/j.artint.2026.104542_bib0010","series-title":"International Conference on Automated Planning and Scheduling (ICAPS)","first-page":"149","article-title":"Approximate bi-criteria search by efficient representation of subsets of the pareto-optimal frontier","author":"Goldin","year":"2021"},{"key":"10.1016\/j.artint.2026.104542_bib0011","series-title":"European Conference on Artificial Intelligence (ECAI)","first-page":"490","article-title":"Near admissible algorithms for multiobjective search","author":"Perny","year":"2008"},{"key":"10.1016\/j.artint.2026.104542_bib0012","series-title":"International Conference on Automated Planning and Scheduling (ICAPS)","first-page":"394","article-title":"A* pex: efficient approximate multi-objective search on graphs","author":"Zhang","year":"2022"},{"key":"10.1016\/j.artint.2026.104542_bib0013","series-title":"Advances in Neural Information Processing Systems","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"Likhachev","year":"2003"},{"key":"10.1016\/j.artint.2026.104542_bib0014","series-title":"Proceedings of the International Conference on Automated Planning and Scheduling","first-page":"137","article-title":"The joy of forgetting: faster anytime search via restarting","volume":"20","author":"Richter","year":"2010"},{"key":"10.1016\/j.artint.2026.104542_bib0015","unstructured":"S. Ahmadi, G. Tack, D. Harabor, P. Kilby, Enhanced Methods for the Weight Constrained Shortest Path Problem: Constrained Path Finding Meets Bi-objective Search, 2022a. in: arXiv: 2207.14744."},{"key":"10.1016\/j.artint.2026.104542_bib0016","series-title":"Symposium on Combinatorial Search (SoCS)","first-page":"2","article-title":"Weight constrained path finding with bidirectional A*","author":"Ahmadi","year":"2022"},{"issue":"2","key":"10.1016\/j.artint.2026.104542_bib0017","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/net.21960","article-title":"An exact bidirectional pulse algorithm for the constrained shortest path","volume":"76","author":"Cabrera","year":"2020","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.artint.2026.104542_bib0018","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/net.21856","article-title":"An exact bidirectional A* approach for solving resource-constrained shortest path problems","volume":"73","author":"Thomas","year":"2019","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.artint.2026.104542_bib0019","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A dual algorithm for the constrained shortest path problem","volume":"10","author":"Handler","year":"1980","journal-title":"Networks"},{"issue":"5","key":"10.1016\/j.artint.2026.104542_bib0020","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","article-title":"A simple efficient approximation scheme for the restricted shortest path problem","volume":"28","author":"Lorenz","year":"2001","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"10.1016\/j.artint.2026.104542_bib0021","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","article-title":"An improved FPTAS for restricted shortest path","volume":"83","author":"Ergun","year":"2002","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.artint.2026.104542_bib0022","series-title":"IJCAI","first-page":"7223","article-title":"Multi-objective search via lazy and efficient dominance checks","author":"Hern\u00e1ndez","year":"2023"},{"key":"10.1016\/j.artint.2026.104542_bib0023","series-title":"Multiobjective Optimization: Interactive and Evolutionary Approaches","volume":"5252","author":"Branke","year":"2008"},{"key":"10.1016\/j.artint.2026.104542_bib0024","series-title":"Nonlinear Multiobjective Optimization","volume":"12","author":"Miettinen","year":"2012"},{"key":"10.1016\/j.artint.2026.104542_bib0025","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01576-2","article-title":"Multi-Objective Decision Making","author":"Roijers","year":"2017"},{"issue":"6","key":"10.1016\/j.artint.2026.104542_bib0026","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","article-title":"Survey of multi-objective optimization methods for engineering","volume":"26","author":"Marler","year":"2004","journal-title":"Struct. Multidiscip. Optim."},{"key":"10.1016\/j.artint.2026.104542_bib0027","series-title":"Multiple Objective Decision Making-Methods and Applications: A State-of-the-Art Survey","volume":"164","author":"Hwang","year":"2012"},{"issue":"3","key":"10.1016\/j.artint.2026.104542_bib0028","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s11047-018-9685-y","article-title":"A tutorial on multiobjective optimization: fundamentals and evolutionary methods","volume":"17","author":"Emmerich","year":"2018","journal-title":"Nat. Comput."},{"issue":"2","key":"10.1016\/j.artint.2026.104542_bib0029","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.artint.2026.104542_bib0030","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","article-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: solving problems with box constraints","volume":"18","author":"Deb","year":"2013","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"10.1016\/j.artint.2026.104542_bib0031","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: a multiobjective evolutionary algorithm based on decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.artint.2026.104542_bib0032","series-title":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC\u201902 (Cat. No. 02TH8600)","first-page":"1051","article-title":"MOPSO: a proposal for multiple objective particle swarm optimization","volume":"2","author":"Coello","year":"2002"},{"issue":"4","key":"10.1016\/j.artint.2026.104542_bib0033","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1162\/EVCO_a_00038","article-title":"An adaptive evolutionary multi-objective approach based on simulated annealing","volume":"19","author":"Li","year":"2011","journal-title":"Evol. Comput."},{"key":"10.1016\/j.artint.2026.104542_bib0034","series-title":"2021 IEEE Congress on Evolutionary Computation (CEC)","first-page":"408","article-title":"An evolutionary approach for solving multi-objective WCSPs using mini-bucket elimination heuristics","author":"Lupoaie","year":"2021"},{"key":"10.1016\/j.artint.2026.104542_bib0035","series-title":"Symposium on Combinatorial Search (SoCS)","first-page":"142","article-title":"Bi-objective search with bi-directional a*","author":"Ahmadi","year":"2021"},{"key":"10.1016\/j.artint.2026.104542_bib0036","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103807","article-title":"Simple and efficient bi-objective search algorithms via fast dominance checks","volume":"314","author":"Hern\u00e1ndez","year":"2023","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2026.104542_bib0037","series-title":"IJCAI","first-page":"6759","article-title":"Heuristic-search approaches for the multi-objective shortest-path problem: progress and research opportunities","author":"Salzman","year":"2023"},{"key":"10.1016\/j.artint.2026.104542_bib0038","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2015.05.007","article-title":"Dimensionality reduction in multiobjective shortest path search","volume":"64","author":"Pulido","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.artint.2026.104542_bib0039","series-title":"International Conference on Automated Planning and Scheduling (ICAPS)","first-page":"143","article-title":"A simple and fast bi-objective search algorithm","author":"Hernandez","year":"2020"},{"key":"10.1016\/j.artint.2026.104542_bib0040","series-title":"Symposium on Combinatorial Search (SoCS)","first-page":"162","article-title":"Enhanced multi-objective A* using balanced binary search trees","volume":"15","author":"Ren","year":"2022"},{"issue":"3","key":"10.1016\/j.artint.2026.104542_bib0041","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.22174","article-title":"Targeted multiobjective Dijkstra algorithm","volume":"82","author":"Maristany de las Casas","year":"2023","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.artint.2026.104542_bib0042","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2019.01.007","article-title":"A biobjective Dijkstra algorithm","volume":"276","author":"Sede\u00f1o-Noda","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.artint.2026.104542_bib0043","series-title":"Symposium on Combinatorial Search (SoCS)","first-page":"65","article-title":"A preprocessing framework for efficient approximate bi-objective shortest-path computation in the presence of correlated objectives","author":"Halle","year":"2025"},{"key":"10.1016\/j.artint.2026.104542_bib0044","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2024.104260","article-title":"EMOA*: a framework for search-based multi-objective path planning","volume":"339","author":"Ren","year":"2025","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2026.104542_bib0045","series-title":"Symposium on Combinatorial Search (SoCS)","first-page":"199","article-title":"Anytime approximate bi-objective search","author":"Zhang","year":"2022"},{"key":"10.1016\/j.artint.2026.104542_bib0046","series-title":"The Traveling Salesman Problem: Optimization with the Attractor-Based Search System","first-page":"9","article-title":"Traveling salesman problem","author":"Li","year":"2023"},{"key":"10.1016\/j.artint.2026.104542_bib0047","series-title":"Algorithmic Foundations of Robotics","first-page":"261","article-title":"Hierarchical multiobjective shortest path problems","volume":"17","author":"Slutsky","year":"2021"},{"key":"10.1016\/j.artint.2026.104542_bib0048","series-title":"Workshop on the Algorithmic Foundations of Robotics (WAFR)","article-title":"Approximate multi-objective search under rulebooks","author":"Muhammetkulyyev","year":"2026"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370226000688?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370226000688?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T06:12:59Z","timestamp":1783145579000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370226000688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":48,"alternative-id":["S0004370226000688"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2026.104542","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximate multi-objective search","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2026.104542","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104542"}}