Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1604.08147 v1 pith:BO3C6TXU submitted 2016-04-27 cs.DS math.OC

Fritz Bökler , Petra Mutzel This is my paper · ORCID
classification cs.DSmath.OC
keywords algorithmslabelmospmultiobjectivenetworkspathproblempruning
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools