Sciweavers

13 search results - page 2 / 3
» Formulations and Valid Inequalities for the Heterogeneous Ve...
Sort
View
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 5 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
MP
2006
79views more  MP 2006»
13 years 6 months ago
Projection results for vehicle routing
A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called two- and three-index formulations, the set partitioni...
Adam N. Letchford, Juan José Salazar Gonz&a...
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 10 days ago
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
Artur Alves Pessoa, Marcus Poggi de Aragão,...
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 6 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
NETWORKS
2010
13 years 4 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...