Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden movements is updated during the iterations to avoid cycling and being trappedâ€¦ (More)

We consider the Split Delivery Vehicle Routing Problem (SDVRP) where a fleet of homogeneous vehicles has to serve a set of customers. Each customer can be visited more than once, contrary to what isâ€¦ (More)

We consider an inventory routing problem in discrete time where a supplier has to serve a set of customers over a time horizon. A capacity constraint for the inventory is given for each customer andâ€¦ (More)

Let G = (V,E) be a graph with vertex set V and edge set E. The k-colouring problem is to assign a colour (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has both endpointsâ€¦ (More)

A huge number of papers appeared in the literature which study the well known Traveling Salesman Problem (TSP) and its generalizations to the case of multiple vehicles known as Vehicle Routingâ€¦ (More)

Descent methods for combinatorial optimization proceed by performing a sequence of local changes on an initial solution which improve each time the value of an objective function until a localâ€¦ (More)