A threshold accepting approach to the open vehicle routing problem

Feasible solutions to the MP-E-VRP satisfy the following conditions: 1) each node i ∈ I is visited by a single EV in period p i , 2) each route starts and ends at the depot, 3) each

Let g tj = 1 or 0 depending on whether customer x t is an element of S, or not respectively, and let C (Sj ) be the cost of the TSP solution through the set of customers in

We also describe lower bounds derived from a set-partitioning based formulation (SP ) of the problem, and computed using two efficient dual ascent heuristics that use two new

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

Genetic algorithm approach for multiple depot capacitated vehicle routing problem solving with heuristic improvements.. International Journal of Modeling and Simulation,

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

Roughly, three main components need to be addressed: (i) the way uncertain data is modeled (e.g., with the use of scenarios), (ii) the selection of an appropriate robust

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