Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

New benchmark instances for the Capacitated Vehicle Routing Problem

- Eduardo Uchoa, Diego Pecin, A. Pessoa, M. P. Aragão, Thibaut Vidal, A. Subramanian
- Computer Science
- Eur. J. Oper. Res.
- 16 March 2017

The recent research on the CVRP is being slowed down by the lack of a good set of benchmark instances. The existing sets suffer from at least one of the following drawbacks: (i) became too easy for… Expand

The time dependent traveling salesman problem: polyhedra and algorithm

- H. Abeledo, Ricardo Fukasawa, A. Pessoa, Eduardo Uchoa
- Mathematics, Computer Science
- Math. Program. Comput.
- 3 January 2013

The time dependent traveling salesman problem (TDTSP) is a generalization of the classical traveling salesman problem (TSP), where arc costs depend on their position in the tour with respect to the… Expand

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

- Diego Pecin, A. Pessoa, M. P. Aragão, Eduardo Uchoa
- Computer Science
- IPCO
- 22 June 2014

The best performing exact algorithms for the Capacitated Vehicle Routing Problem are based on the combination of cut and column generation. Some authors could obtain reduced duality gaps by also… Expand

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems

- A. Pessoa, Eduardo Uchoa, M. P. Aragão, R. Rodrigues
- Computer Science, Mathematics
- Math. Program. Comput.
- 24 October 2010

This paper presents an exact algorithm for the identical parallel machine scheduling problem over a formulation where each variable is indexed by a pair of jobs and a completion time. We show that… Expand

Improved branch-cut-and-price for capacitated vehicle routing

- Diego Pecin, A. Pessoa, M. P. Aragão, Eduardo Uchoa
- Computer Science, Mathematics
- Math. Program. Comput.
- 19 June 2017

The best performing exact algorithms for the capacitated vehicle routing problem developed in the last 10 years are based in the combination of cut and column generation. Some authors only used cuts… Expand

Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

- A. Pessoa, M. P. Aragão, Eduardo Uchoa
- Computer Science
- 2008

This chapter presents techniques for constructing robust Branch-Cut-and-Price algorithms on a number of Vehicle Routing Problem variants. The word ‘‘robust’’ stresses the effort of controlling the… Expand

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery

- A. Subramanian, Eduardo Uchoa, A. Pessoa, L. Ochi
- Computer Science, Mathematics
- Oper. Res. Lett.
- 1 September 2011

Abstract We propose a branch-and-cut algorithm for the VRPSPD where the constraints that ensure that the capacities are not exceeded in the middle of a route are applied in a lazy fashion. The… Expand

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation

- A. Pessoa, R. Sadykov, Eduardo Uchoa, F. Vanderbeck
- Mathematics, Computer Science
- INFORMS J. Comput.
- 15 May 2018

The convergence of a column generation algorithm can be improved in practice by using stabilization techniques. Smoothing and proximal methods based on penalizing the deviation from the incumbent… Expand

Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search

- A. Pessoa, E. Laber, Críston de Souza
- Computer Science
- ISAAC
- 20 December 2004

Let T be a rooted directed tree where nodes represent web pages of a web site and arcs represent hyperlinks In this case, when a user searches for an information i, it traverses a directed path in T,… Expand

Efficient Implementation of Hotlink Assignment Algorithm for Web Sites

- A. Pessoa, E. Laber, Críston de Souza
- Computer Science
- ALENEX/ANALC
- 2004

- 17
- 4