W describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbor solution is obtained by removing a customer from a set of routes where it is… (More)

We consider a distribution problem in which a product has to be shipped from a supplier to several retailers over a given time horizon. Each retailer defines a maximum inventory level. The supplier… (More)

The Team Orienteering Arc Routing Problem (TOARP) is the extension to the arc routing setting of the Team Orienteering Problem (TOP). In the TOARP, in addition to a possible set of regular customers… (More)

I the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity… (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)

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)

The problem of selecting a portfolio has been largely faced in terms of minimizing the risk, given the return. While the complexity of the quadratic programming model due to Markowitz has been… (More)