An exact method for the biobjective shortest path problem for large-scale road networks
Recursive exact algorithm that implicitly enumerates all solutions. Fast method that works well on graphs of up to 1.2 million nodes and 2.8 million arcs. Consistently outperformed a top-performer benchmark algorithm for real road networks. Easily extensible to the multiobjective shortest path problem with three or more objectives.
biobjective shortest path multiobjective shortest path routing multiobjective combinatorial optimization (moco) pulse algorithm