In this thesis we will address the location routing problem (LRP) with uncertainty in customer demand. The objective of the LRP is to minimize the sum of depot cost, vehicle cost and routing costs. The LRP is an integrated version of the facility location problem (FLP) and the vehicle routing problem (VRP), where the decisions on the opening of facilities and determining optimal routes are considered simultaneously. We will present a two-stage light robust problem formulation, where in the first stage the decisions regarding the locations of the open depots, the number of assigned vehicles and the \\textit{a priori} routing are considered. After observing the actual demand values, the \\textit{a posteriori} routing can be revised. We will show that we can provide non-conservative robust solutions using the light robust approach. We also introduce a set of valid inequalities specifically designed to tighten the light robust LRP formulation and evaluate the computational performance on benchmark instances. In addition, we consider a similar LRP with uncertainty in the customer set.

, , , ,
Postek, K.S.
hdl.handle.net/2105/45919
Econometrie
Erasmus School of Economics

Knaap, L.A. van der. (2019, February 19). Light robust location-routing. Econometrie. Retrieved from http://hdl.handle.net/2105/45919