Bi-objective Search with Bi-directional A

Bi-objective search is a well-known algorithmic problem, concerned with finding a set of optimal solutions in a two-dimensional domain. This problem has a wide variety of applications such as planning in transport systems or optimal control in energy systems. Recently, bi-objective A*-based search (BOA*) has shown state-of-the-art performance in large networks. This paper develops a bidirectional and parallel variant of BOA*, enriched with several speed-up heuristics. Our experimental results on 1,000 benchmark cases show that our bi-directional A* algorithm for bi-objective search (BOBA*) can optimally solve all of the benchmark cases within the time limit, outperforming the state of the art BOA*, bi-objective Dijkstra and bi-directional bi-objective Dijkstra by an average runtime improvement of a factor of five over all of the benchmark instances. 2012 ACM Subject Classification Computing methodologies → Search methodologies; Theory of computation → Shortest paths

[1]  W. Matthew Carlyle,et al.  Near‐shortest and K‐shortest simple paths , 2003, Networks.

[2]  Charalampos Konstantopoulos,et al.  Minimizing the fuel consumption and the risk in maritime transportation: A bi-objective weather routing approach , 2017, Comput. Oper. Res..

[3]  Jorge A. Baier,et al.  A Simple and Fast Bi-Objective Search Algorithm , 2020, ICAPS.

[4]  Andrea Raith Speed-up of Labelling Algorithms for Biobjective Shortest Path Problems , 2010 .

[5]  Matthias Ehrgott,et al.  A comparison of solution strategies for biobjective shortest path problems , 2009, Comput. Oper. Res..

[6]  Lawrence Mandow,et al.  Multiobjective heuristic search in road maps , 2012, Expert Syst. Appl..

[7]  R. Musmanno,et al.  Label Correcting Methods to Solve Multicriteria Shortest Path Problems , 2001 .

[8]  Antonio Sedeño-Noda,et al.  A biobjective Dijkstra algorithm , 2019, Eur. J. Oper. Res..

[9]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[10]  Andrés L. Medaglia,et al.  An exact method for the biobjective shortest path problem for large-scale road networks , 2015, Eur. J. Oper. Res..

[11]  Nathan R. Sturtevant,et al.  Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract , 2019, SOCS.

[12]  A. Shamsai,et al.  Multi-objective Optimization , 2017, Encyclopedia of Machine Learning and Data Mining.

[13]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[14]  Nathan R. Sturtevant,et al.  A Brief History and Recent Achievements in Bidirectional Search , 2018, AAAI.

[15]  William H. K. Lam,et al.  An energy-efficient reliable path finding algorithm for stochastic road networks with electric vehicles , 2019, Transportation Research Part C: Emerging Technologies.

[16]  Lawrence Mandow,et al.  Dimensionality reduction in multiobjective shortest path search , 2015, Comput. Oper. Res..

[17]  Kim Allan Andersen,et al.  A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..