Exact N-modal Itineraries Generation for Ad Hoc Interconnection of Transportation Networks

International audienceCIMO is a combinatorial system which computes optimal multimodal itineraries consisting in itineraries which are sorted, multimodal and trans-territorial. In this work we propose the formalism of ad hoc multimodal itinerary problematic, the multi-constraints based dynamic programming algorithm approach, and a realistic evaluation of the solution proposed which address new aggregation of operational transportation territories. The solution is based on a dynamic programming algorithm ”cut”, ”price” and ”share”. This solution is multi-objectives and multi-constraints. Progressive versions of this algorithm are proposed following a methodological approach that enables evaluation of efficiency and complexity’s gain. Test benchmarks are run to validate the contributions, until the overall system shows its capacity to propose multimodal itineraries for real metropolis area. Other parameters are defined as the speed up and the relative gain. This work also provides a set of evaluations of CIMO’s versions: from a real illustration basedon two extractions transport networks with small overlap (bus) and connected transversely by two other modes (train and cars), to a simulation of territorial areas comprising the territories served by 3-modes transport services (bus, car and train) of AOTS prefectures and sub-prefectures (2 x 800 stations, 2 x 20 lines, journey time-tabling’s ranging from 6 am to 20 pm, lines of trains and buses serving longitudinally these 2 networks). This study shows that an optimal itinerary can be calculated with an exact, dynamic programming algorithm ”cut” and ”price” and ”share” which generates 3-modes itinerary over two connected transportation networks, deserving 300,000 inhabitants