Relax-and-Cut Method for Large-Scale Multicommodity Network Design

29th of April 2022, at 13:30

Room: Online via Teams

https://teams.microsoft.com/l/meetup-join/19%3adacd63e97f9e48e896f537ace22a27bf%40thread.tacv2/1650924227373?context=%7b%22Tid%22%3a%2281e7c4de-26c9-4531-b076-b70e2d75966e%22%2c%22Oid%22%3a%22c00d08df-c86f-4f81-a9c8-6287a3bb947d%22%7d

Speaker: Rui Shibasaki

Title: Relax-and-Cut Method for Large-Scale Multicommodity Network Design

Abstract:

Typically present in logistics and telecommunications domains, the Fixed-Charge Multicommodity Network Design Problem (FCMC) remains challenging, especially when large-scale contexts are involved. In this particular case, the ability to produce good quality solutions in a reasonable amount of time leans on the availability of efficient algorithms. In that sense, we explored the Relax-and-Cut method as a faster alternative to linear programming solvers. We tested the proposed algorithm within a Branch-and-Bound scheme, obtaining better results than other state-of-the-art simplex-based Branch-and-Bound algorithms.