Show simple item record

dc.contributor.authorLillo-Viedma, Felipe
dc.contributor.authorEnsor, Andrew
dc.description.abstractMany 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 N P-complete, the approach is shown to be tractable through experimental analyses without the need to apply heuristics or constraints.es_CL
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 Chile*
dc.sourceAsia-Pacific Journal of Operational Research, 33(1), 1650005es_CL
dc.subjectMultimodal transportation systemes_CL
dc.subjectShortest pathes_CL
dc.subjectWeighted colored-edge graphes_CL
dc.titleColored-edge graph approach for the modeling of multimodal transportation systemses_CL
dc.ucm.facultadFacultad de Ciencias Sociales y Económicases_CL

Files in this item

Vista Previa No Disponible

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 3.0 Chile
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 Chile