Partial order approach to compute shortest paths in multimodal networks

Details Partial order approach to compute shortest paths in multimodal networks Partial order approach to compute shortest paths in multimodal networks

2011-12-14

arxiv.org/abs/1112.3366v1

Computer Science

Other Computer Science

Scientific paper

Many networked systems involve multiple modes of transport. Such systems are called multimodal, and examples include logistic networks, biomedical phenomena, manufacturing process and telecommunication networks. Existing techniques for determining optimal paths in multimodal networks have either required heuristics or else application-specific constraints to obtain tractable problems, removing the multimodal traits of the network during analysis. In this paper weighted coloured--edge graphs are introduced to model multimodal networks, where colours represent the modes of transportation. Optimal paths are selected using a partial order that compares the weights in each colour, resulting in a Pareto optimal set of shortest paths. This approach is shown to be tractable through experimental analyses for random and real multimodal networks without the need to apply heuristics or constraints.

Affiliated with

Also associated with

No associations

Rating

Partial order approach to compute shortest paths in multimodal networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partial order approach to compute shortest paths in multimodal networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partial order approach to compute shortest paths in multimodal networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561426