Citation

Chen L, Gendreau M, Hà MH, Langevin A. Transp. Res. E Logist. Transp. Rev. 2016; 85: 40-51.

Copyright

(Copyright © 2016, Elsevier Publishing)

DOI

10.1016/j.tre.2015.11.006

PMID

unavailable

Abstract

This paper studies the robust optimization approach for the routing problem encountered in daily maintenance operations of a road network. The uncertainty of service time is considered. The robust optimization approach yields routes that minimize total cost while being less sensitive to substantial deviations of service times. A robust optimization model is developed and solved by the branch-and-cut method. In computational experiments, the behavior of the robust solutions and their performance are analyzed using Monte Carlo simulation. The robust optimization model is also compared with a classic chance-constrained programming model. The experimental analysis provides managerial insights for decision makers to determine an appropriate routing strategy.

Language: en