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.
Bio: Okan Arslan is a postdoctoral fellow at HEC Montreal, supervised by Gilbert Laporte and Ola Jabali. He received his Ph.D. degree in industrial engineering from Bilkent University in Ankara/Turkey, M.Sc. degree in operations research from the Air Force Institute of Technology in Dayton/Ohio and B.Sc. degree in aeronautical engineering from the Turkish Air Force Academy in Istanbul/Turkey. His research interests lie in the area of network design and management with particular emphasis on sustainability and resilience in applications spanning transportation, logistics, telecommunications and energy.
Welcome to everyone!