This paper deals with problems of sensor management in a human driven information collection process. This applicative context results in complex sensor-to-task assignment problems, which encompass several difficulties. First of all, the tasks take the form of several information requirements, which are linked together by logical connections and priority rankings. Second, the assignment problem...

Precision farming in viticulture raises challenging combinatorial issues such as the Differential Harvest Problem . This problem might appear at first similar to a simple Capacitated Vehicle Routing but it exhibits problem-specific constraints that make this much harder solve and which are discussed article. Our objective was develop efficient exact methods using column generation VRPSolver™ ba...

We present a model for the vehicle and crew scheduling problem in urban public transport systems by combining models for vehicle and crew scheduling that cover a great variety of real world aspects, especially constraints for crews resulting from wage agreements and internal regulations. The main part of the model consists of a set partitioning formulation to cover the desired trips of the sche...

We propose an abstraction of emerging vehicle routing problems, the VRP with Black Box Feasibility. In this problem the routes of a basic VRP need to satisfy an unknown set of constraints. A black box function to test the feasibility of a route is provided. Practical examples of such problems are combinations of VRP with Loading or VRP with Scheduling. We propose a heuristic column generation-b...

Marcus Poggi de Aragão Dep.de Informática Pontif́ıcia Universidade Católica do Rio de Janeiro [email protected] Eduardo Uchoa Dep. Eng. de Produção Universidade Federal Fluminense [email protected] January 15th, 2005 The Capacitated Vehicle Routing Problem (CVRP) is the most basic variant of a vehicle routing problem: homogeneous fleet, single depot, only deliveries, no time-windows, and ...

In many distribution networks, it is vital that time windows in which deliveries are made are assigned to customers for the long term. However, at the moment of assigning time windows demand is not known. In this paper we introduce the time window assignment vehicle routing problem, the TWAVRP. In this problem time windows have to be assigned before demand is known. Next the realization of dema...

Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duration limits can effectively and efficiently be incorporated in solution approaches that build fixed, or a priori, tours for such problems. We do so by assuming that each tour must be duration-feasible for all demand reali...