Abstract

Few network techniques have been developed specically for modelling multimodal networks.In this work weighted coloured edge graphs are used as modeling tool, where colours represent the transport choices.Optimal paths are gotten by a partial order relation that compares each colour weight, resulting in a Pareto set of paths.A modied Dijkstra's algorithm is experimentally tested,yielding a promising average case for the Pareto set.The algorithm is shown to be practical for networks at least as large as networks found in previous literature but still retains the multimodal traits.