Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário. González, P., H., Martinhon, C., A., d., J., Simonetti, L., G., Santos, E., & Michelon, P., Y., P. In Anais do XLV Simpósio Brasileiro de Pesquisa Operacional, pages 1813-1824, 2013.
Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário [pdf]Paper  abstract   bibtex   
Due to the constant development of society, increasing quantities of commodities have to be trans- ported in large urban centers. Thanks to that fact, network planning problems arises as tools to support decision-making, aiming to meet the need of finding efficient ways to perform such trans- portations. This paper presents a mathematical formulation of the network design problem with user-optimal flow as a mixed discrete bilevel linear programming problem. In this work we also discuss a one-level integer formulation obtained by applying Karush-Kuhn-Tucker conditions. We implemented a randomized constructive algorithm, a local search and combined them into a GRASP metaheuristic. In addition, we compare the computational results we obtained with the results found by the one-level formulation and with the results found in the literature.

Downloads: 0