Jacek Gondzio

Jacek Gondzio

Auto-generated profile, based on publicly available information

Jacek Gondzio

School of Mathematics, The University of Edinburgh, Edinburgh, UK

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2004 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
LBLuca Bergamaschi
Luca Bergamaschi
JGJacek Gondzio
Jacek Gondzio
GZGiovanni Zilli
Giovanni Zilli

6 December 2013 in Mathematical Programming Computation
Verified
Journal Article
Closed access
PDF file
KFKimon Fountoulakis
Kimon Fountoulakis
JGJacek Gondzio
Jacek Gondzio
PZPavel Zhlobich
Pavel Zhlobich

1 July 2019 in Transportation Science
Verified
Journal Article
Closed access
PMPedro Munari
Pedro Munari
AMAlfredo Moreno
Alfredo Moreno
JVJonathan De La Vega
Jonathan De La Vega
DADouglas Alem
Douglas Alem
JGJacek Gondzio
Jacek Gondzio
RMReinaldo Morabito
Reinaldo Morabito
We address the robust vehicle routing problem with time windows (RVRPTW) under customer demand and travel time uncertainties. As presented thus far in the literature, robust counterparts of standard formulations have challenged general-purpose optimization solvers and specialized branch-and-cut methods. Hence, optimal solutions have been reported for small-scale instances only. Additionally, although the most successful methods for solving many variants of vehicle routing problems are based on the column generation technique, the RVRPTW has never been addressed by this type of method. In this paper, we introduce a novel robust counterpart model based on the well-known budgeted uncertainty set, which has advantageous features in comparison with other formulations and presents better overall performance when solved by commercial solvers. This model results from incorporating dynamic programming recursive equations into a standard deterministic formulation and does not require the classical dualization scheme typically used in robust optimization. In addition, we propose a branch-price-and-cut method based on a set partitioning formulation of the problem, which relies on a robust resource-constrained elementary shortest path problem to generate routes that are robust regarding both vehicle capacity and customer time windows. Computational experiments using Solomon’s instances show that the proposed approach is effective and able to obtain robust solutions within a reasonable running time. The results of an extensive Monte Carlo simulation indicate the relevance of obtaining robust routes for a more reliable decision-making process in real-life settings.

29 February 2016 in Journal of Optimization Theory and Applications
Verified
Journal Article
Open access
PDF file
RTRachael Tappenden
Rachael Tappenden
PRPeter Richtárik
Peter Richtárik
JGJacek Gondzio
Jacek Gondzio
One of the key steps at each iteration of a randomized block coordinate descent method consists in determining the update to a block of variables. Existing algorithms assume that in order to compute the update, a particular subproblem is solved exactly. In this work, we relax this requirement and allow for the subproblem to be solved inexactly, leading to an inexact block coordinate descent method. Our approach incorporates the best known results for exact updates as a special case. Moreover, these theoretical guarantees are complemented by practical considerations: the use of iterative techniques to determine the update and the use of preconditioning for further acceleration.

14 October 2010 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
JGJacek Gondzio
Jacek Gondzio

7 December 2006 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
JGJacek Gondzio
Jacek Gondzio
AGAndreas Grothey
Andreas Grothey