A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing

In this paper, the dual feasible functions will be applied to the knapsack poly- topes associated to different constraints of (8)–(11), namely the demand con- straints (9),

Although one should only expect to have good chances to solve instances of size up to around 80 moves within a four hours limit, our experiments still suggest that, when the

The Team Orienteering Problem (TOP) [4] is a widely studied Vehicle Routing Problem (VRP) which can be described as follows: a fleet of vehicles is avail- able to visit customers from

Although one should only expect to have good chances to solve instances of size up to around 80 moves within a four hours limit, our experiments still suggest that, when the

It must be underlined that, when the column generation procedure terminates, the optimal solution of the linear relaxation of the restricted master problem is equal to the

In this case, the vehicle can possibly load the supplied object and carry it to a vertex requiring that object type, and it may also leave the vertex with a deadheading (see Lemmas

Therefore, there exists an optimal solution in which the original depot is visited at most twice, where the two visits case corresponds to an additional pair of deadheadings

Time preproc., time spent on preprocessing, this includes the time spent tightening time windows (see Section 6.4) and calculating the sets A + i and A − i needed for the