The Shortest Route Problem concerns routing one vehicle to one customer while minimizing some objective functions. The problem is essentially a shortest path problem and has been studied extensively in the literature. We report a system with the objective to address two dynamic aspects of the Shortest Route Problem. The first aspect corresponds to handing incremental changes during the routing plan. The second one is about finding the most probable shortest path i.e. the path with the highest probability of being not congested. We describe how each of these two aspects has been implemented in the system as well as the other features and components of this latter.
展开▼