Integer Programming Formulation of Traveling Salesman Problems
Journal of the ACM (JACM)
The Shortest Path Problem with Time Windows and Linear Waiting Costs
Transportation Science
Operations Research
Adjustable robust solutions of uncertain linear programs
Mathematical Programming: Series A and B
Domination Between Traffic Matrices
Mathematics of Operations Research
Theory and Applications of Robust Optimization
SIAM Review
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
Operations Research Letters
Computing robust basestock levels
Discrete Optimization
Robust solutions of uncertain linear programs
Operations Research Letters
Layered formulation for the robust vehicle routing problem with time windows
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Open vehicle routing problem with demand uncertainty and its robust strategies
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
This paper addresses the robust vehicle routing problem with time windows. We are motivated by a problem that arises in maritime transportation where delays are frequent and should be taken into account. Our model only allows routes that are feasible for all values of the travel times in a predetermined uncertainty polytope, which yields a robust optimization problem. We propose two new formulations for the robust problem, each based on a different robust approach. The first formulation extends the well-known resource inequalities formulation by employing adjustable robust optimization. We propose two techniques, which, using the structure of the problem, allow to reduce significantly the number of extreme points of the uncertainty polytope. The second formulation generalizes a path inequalities formulation to the uncertain context. The uncertainty appears implicitly in this formulation, so that we develop a new cutting plane technique for robust combinatorial optimization problems with complicated constraints. In particular, efficient separation procedures are discussed. We compare the two formulations on a test bed composed of maritime transportation instances. These results show that the solution times are similar for both formulations while being significantly faster than the solutions times of a layered formulation recently proposed for the problem.