One of the well-studied routing issues is the Pickup and Delivery Problem (PDP). It aims to route a fleet of vehicles based on a depot to satisfy a set of transport requests subject to numerous constraints. In real-life cases, the satisfaction of those requests over a given time slot (1 day for example) may become impossible while respecting all problem constraints. Therefore, the studied variant is characterised by the selective aspect which consists of choosing a subset of demands to be honoured. In addition, travel times between sites may be uncertain and may vary according to several scenarios. The robustness consists then at finding a solution which remains feasible over all scenarios. Therefore, the goal of this study is to introduce lexicographic and metaheuristic approaches to solve the Robust Selective PDP (RSPDP). Numerous tests have been done on new instances for the considered variant, in order to show the efficiency of proposed approaches.

一个经过充分研究的路由问题是取件和交付问题 (PDP)。它的目的是根据一个站点对车队进行路由，以满足一组受众多约束的运输请求。在现实生活中，在尊重所有问题约束的情况下，在给定的时间段（例如 1 天）内满足这些请求可能变得不可能。因此，所研究的变体具有选择性方面的特征，其中包括选择要尊重的要求子集。此外，站点之间的旅行时间可能不确定，并且可能会根据几种情况而有所不同。然后，稳健性在于找到在所有情况下仍然可行的解决方案。因此，本研究的目标是引入字典和元启发式方法来解决鲁棒选择性 PDP (RSPDP)。