Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems

DOI10.1142/S0217595916500056zbMath1405.90032MaRDI QIDQ2800805

Felipe Lillo, Andrew Ensor

Publication date: 18 April 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

shortest pathmultimodal transportation systemweighted colored-edge graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic network models in operations research (90B10)

Related Items (1)

On the tractability of shortest path problems in weighted edge-coloured graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicriteria path problem minimizing the cost and minimizing the number of labels
• A matrix-based approach to searching colored paths in a weighted colored multidigraph
• A comparison of solution strategies for biobjective shortest path problems
• Opportunities for OR in intermodal freight transport research: A review.
• On the tractability of shortest path problems in weighted edge-coloured graphs
• On the bicriterion - minimal cost/minimal label - spanning tree problem
• Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
• Transfer Graph Approach for Multimodal Transport Problems
• Multimodal Express Package Delivery: A Service Network Design Application
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms

This page was built for publication: Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems