A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands

This paper is organised as follows. Necessary background on SPR modelling of CVRPSD and on belief function theory is recalled in Section 2. An extension of the recourse approach for

In this article, we proposed to represent uncertainty on customer demands in the capacitated vehicle routing problem via the theory of evidence. We tackled this problem by

Among these methods, two population-based algorithms (MEANS [34] and Ant-CARP [32]) and one local search algorithm (GLS [2]) represent the state-of-the-art solution methods for

The proposed tabu search procedure allows all kind of infeasible moves to be done (time windows, load, routes number). We have performed some empirical tests to prove the

In the first echelon of the two-echelon stochastic multi-period capacitated location-routing problem (2E-SM- CLRP), one has to decide the number and location of warehouse platforms

In this work, we focus on the stochastic multi-period variant of the 2E-CLRP (2E-SM- CLRP), a hierarchical decision problem where the design (i.e., location and capacity) and

Table 1 summarizes the results of the experiments: the first column describes the performance metric, the following 5 columns report the results for the 5 different

This paper proposes a new heuristic approach that uses randomized heuristics for the traveling salesman problem (TSP), a route partitioning procedure, and a set-partitioning model,