Séminaire conjoint GERAD-Chaire de recherche du Canada en distributique-Chaire en logistique et en transport
TITRE : Network Design Problem with Length-bounded Paths
CONFÉRENCIER : Okan Arslan, HEC Montréal
DATE et ENDROIT : 17 janvier 2018, 10h45, salle 4488, Pavillon André-Aisenstadt, Campus de l’Université de Montréal
RESPONSABLE : Gilbert Laporte
RÉSUMÉ : When traveling between their origins and destinations, the drivers can deviate from their shortest paths cooperative to visit discretionary service facilities or non-cooperatively to avoid encountering any law-enforcement facilities. This deviation length is naturally bounded from above by the tolerance of the drivers. In this talk, we present the network design problem with length-bounded paths and discuss two applications: alternative fuel station network design as an example for the collaborative case, and weigh-in motion system network design for the non-cooperative case. We introduce a natural formulation built on the notion of length bounded cuts for the former problem and a bilevel formulation to model the latter one. We present branch-and-cut algorithms for both problems and show the marked the superiority of our solution techniques over the existing exact approaches.