Name
Abstract | ||
|---|---|---|
Many networked systems involve multiple modes of transport. Such systems are called multimodal, and examples include logistic networks, biomedical phenomena and telecommunication networks. Existing techniques for determining minimal 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 colored-edge graphs are introduced for modeling multimodal networks, where colors represent the modes of transportation. Minimal paths are selected using a partial order that compares the weights in each color, resulting in a Pareto set of minimal paths. Although the computation of minimal paths is theoretically intractable and NP-complete, the approach is shown to be tractable through experimental analyses without the need to apply heuristics or constraints. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1142/S0217595916500056 | ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH |
Keywords | Field | DocType |
Multimodal transportation system,shortest path,weighted colored-edge graph | Multiple modes,Graph,Mathematical optimization,Colored,Shortest path problem,Heuristics,Pareto principle,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
33 | 1 | 0217-5959 |
Citations | PageRank | References |
1 | 0.40 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Ensor | 1 | 10 | 4.23 |
| Felipe Lillo | 2 | 2 | 1.79 |