Colored-edge graph approach for the modeling of multimodal transportation systems

Lillo-Viedma, Felipe; Ensor, Andrew

Mostrar el registro sencillo de la publicación

dc.contributor.author	Lillo-Viedma, Felipe
dc.contributor.author	Ensor, Andrew
dc.date.accessioned	2017-09-26T19:10:44Z
dc.date.available	2017-09-26T19:10:44Z
dc.date.issued	2016
dc.identifier.uri	http://repositorio.ucm.cl/handle/ucm/216
dc.description.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 N P-complete, the approach is shown to be tractable through experimental analyses without the need to apply heuristics or constraints.	es_CL
dc.language.iso	en	es_CL
dc.rights	Atribución-NoComercial-SinDerivadas 3.0 Chile	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/cl/	*
dc.source	Asia-Pacific Journal of Operational Research, 33(1), 1650005	es_CL
dc.subject	Multimodal transportation system	es_CL
dc.subject	Shortest path	es_CL
dc.subject	Weighted colored-edge graph	es_CL
dc.title	Colored-edge graph approach for the modeling of multimodal transportation systems	es_CL
dc.type	Article	es_CL
dc.ucm.facultad	Facultad de Ciencias Sociales y Económicas	es_CL
dc.ucm.indexacion	Scopus	es_CL
dc.ucm.indexacion	Isi	es_CL
dc.ucm.doi	doi.org/10.1142/S0217595916500056	es_CL