Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem

2016/04/27 by Bökler, Fritz, Mutzel, Petra
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1604.08147

Abstract

In this paper, we re-evaluate the basic strategies for label correcting algorithms for the multiobjective shortest path (MOSP) problem, i.e., node and label selection. In contrast to common believe, we show that---when carefully implemented---the node-selection strategy usually beats the label-selection strategy. Moreover, we present a new pruning method which is easy to implement and performs very well on real-world road networks. In this study, we test our hypotheses on artificial MOSP instances from the literature with up to 15 objectives and real-world road networks with up to almost 160,000 nodes.

Related

• Multi-Constraint Shortest Path using Forest Hop Labeling
• Targeted Multiobjective Dijkstra Algorithm
• Enhanced Multi-Objective A* with Partial Expansion
• Binary Weight Allocation for Multi-Objective Path Optimization: Efficient Earliest and Latest Path Discovery in Network Systems
• Enhanced Multi-Objective A* Using Balanced Binary Search Trees