Cooperative receding horizon strategies for the multivehicle routing problem

Summary This paper deals with the dynamic Euclidean Multivehicle Routing Problem (MVRP) in both deterministic and uncertain scenarios. The objective of MVRP is to find the best paths for a fleet of vehicles that are cooperative to visit a set of targets. Based on the cooperative receding horizon (CRH) approach proposed in some previous works, which is vehicle‐oriented, in this paper, we consider a target‐oriented CRH, named tCRH, and then we propose a switching scheme, named sCRH, which is able to dynamically adjust the vehicle behaviors according to the time‐varying configuration of both vehicles and targets, as well as to handle the situation with the appearance of unknown targets. The proposed sCRH counteracts the oscillation problem of CRH and improves the overall routing performances by adopting the advantages of both CRH and tCRH approach. Convergence results and simulation results are provided to validate the proposed approach.