CovoitArtois is a decision-making tool for building clusters in a regular carpooling problem with a same destination
CovoitArtois, developed as part of Yuhan Guo’s thesis, is a decision-making tool for building clusters in a regular carpooling problem with a same destination. It is a sub-problem of the classic carpooling problem where the departures and arrivals are multiple. We focused in a context where there is only one destination, this concerns for examples : employees of a company or students of a university. Users submit request consisting of a starting point, a arrival time window and a return time window. The objective of the application is to propose a solution composed a set of clusters (cars) and their routes which minimize the total traveled distance to satisfy the demands. The application has 2 parts:
a java solver which determines all the clusters and their routes with the theoretical or real instances
a web interface which visualize the routes of the clusters in a real context.