Dynamic intra-modal carpooling with transhipment: Formalization and first combinatorial exact solution

In this work, we propose a modeling and an implementation of an algorithm for the computerization of the N-intra-modal carpooling with transhipment. It's a new type of carpooling that allows modal shifts and subsequently a variability between the offer and the demand. Another advantage of our calculator is that it checks the possibility of proposing a return itinerary for a driver who has already carried out a modal shift on his outward journey. Also, the calculator guarantees the good operation for the classic carpooling without modal shifts. Some dynamic constraints are managed by our proposed solution. A system modeling work and managed data, multiple constraints formalization and system multiple objectives as well as implementing a matching motor will be presented in this paper. This motor is based on a greedy combinatorial optimization algorithm. Various tests are run, that prove the possibility of solving this problem based on an exact approach in a reasonable time.