摘要：Abstract A Dynamic Multi-hop Ridesharing is a flexible form in which the request can be matched to one or more drivers at different times such that the rider reaches his destination hop by hop. This kind of ridesharing offers more possibilities for the riders. The Multi-Hop Ridematching Problem (M — HRP) in its dynamic context is considered to be NP-Complete. Therefore, we mainly focus on suitable concepts to reduce real time ridematching's high complexity. In this context, we aim to set up a distributed architecture through which an optimizing decentralized process will be performed. In this study, we developed an original distributed approach based on evolutionary cooperative algorithms driven by agents' communication. The cooperation aspect appears into two levels: In the agent architecture level to ensure communication, negotiation and collaboration between agents, and in the algorithmic level to ensure consistency and persistence of the cooperation between these agents.
关键词：KeywordsDynamic Multi-hop ridesharingEvolutionary Cooperative AlgorithmMulti-Agent System
