Abstract:
There is a range of algorithms available to solve biobjective shortest path problems. Here, we focus on biobjective labelling algorithms and propose an acceleration tech- nique, which is easily implemented. We compare the performance of the algorithms with and without the proposed improvements on the basis of test instances with three di erent network structures. The usage of di erent data structures within label setting algorithms and their e ect on run times is also discussed.
