@inProceedings{
 title = {Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário},
 type = {inProceedings},
 year = {2013},
 keywords = {Bilevel Problem,GRASP,Network Design},
 pages = {1813-1824},
 id = {712d8928-755d-3bd0-ada9-fc3916fccdf9},
 created = {2014-09-11T00:46:26.000Z},
 file_attached = {true},
 profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},
 last_modified = {2017-03-16T02:34:10.941Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Gonzalez2013a},
 private_publication = {false},
 abstract = {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.},
 bibtype = {inProceedings},
 author = {González, Pedro Henrique and Martinhon, Carlos Alberto de Jesus and Simonetti, Luidi Gelabert and Santos, Edcarllos and Michelon, Philippe Yves Paul},
 booktitle = {Anais do XLV Simpósio Brasileiro de Pesquisa Operacional}
}

{"_id":"tvYCDoET6gmGP9rrP","bibbaseid":"gonzlez-martinhon-simonetti-santos-michelon-umametaheursticagraspparaoproblemadeplanejamentoderedescomrotastimasparaousurio-2013","downloads":0,"creationDate":"2018-03-26T07:27:12.629Z","title":"Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário","author_short":["González, P., H.","Martinhon, C., A., d., J.","Simonetti, L., G.","Santos, E.","Michelon, P., Y., P."],"year":2013,"bibtype":"inProceedings","biburl":null,"bibdata":{"title":"Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário","type":"inProceedings","year":"2013","keywords":"Bilevel Problem,GRASP,Network Design","pages":"1813-1824","id":"712d8928-755d-3bd0-ada9-fc3916fccdf9","created":"2014-09-11T00:46:26.000Z","file_attached":"true","profile_id":"756a70ce-605d-3e50-9cbb-a99c29afcbe8","last_modified":"2017-03-16T02:34:10.941Z","read":false,"starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Gonzalez2013a","private_publication":false,"abstract":"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.","bibtype":"inProceedings","author":"González, Pedro Henrique and Martinhon, Carlos Alberto de Jesus and Simonetti, Luidi Gelabert and Santos, Edcarllos and Michelon, Philippe Yves Paul","booktitle":"Anais do XLV Simpósio Brasileiro de Pesquisa Operacional","bibtex":"@inProceedings{\n title = {Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário},\n type = {inProceedings},\n year = {2013},\n keywords = {Bilevel Problem,GRASP,Network Design},\n pages = {1813-1824},\n id = {712d8928-755d-3bd0-ada9-fc3916fccdf9},\n created = {2014-09-11T00:46:26.000Z},\n file_attached = {true},\n profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},\n last_modified = {2017-03-16T02:34:10.941Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Gonzalez2013a},\n private_publication = {false},\n abstract = {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.},\n bibtype = {inProceedings},\n author = {González, Pedro Henrique and Martinhon, Carlos Alberto de Jesus and Simonetti, Luidi Gelabert and Santos, Edcarllos and Michelon, Philippe Yves Paul},\n booktitle = {Anais do XLV Simpósio Brasileiro de Pesquisa Operacional}\n}","author_short":["González, P., H.","Martinhon, C., A., d., J.","Simonetti, L., G.","Santos, E.","Michelon, P., Y., P."],"urls":{"Paper":"https://bibbase.org/service/mendeley/756a70ce-605d-3e50-9cbb-a99c29afcbe8/file/3ed91045-3301-c98b-74dc-839b94093f90/2013-Uma_Metaheurstica_GRASP_para_o_Problema_de_Planejamento_de_Redes_com_Rotas_timas_para_o_Usurio.pdf.pdf"},"bibbaseid":"gonzlez-martinhon-simonetti-santos-michelon-umametaheursticagraspparaoproblemadeplanejamentoderedescomrotastimasparaousurio-2013","role":"author","keyword":["Bilevel Problem","GRASP","Network Design"],"downloads":0},"search_terms":["uma","metaheur","stica","grasp","para","problema","planejamento","redes","com","rotas","timas","para","usu","rio","gonzález","martinhon","simonetti","santos","michelon"],"keywords":["bilevel problem","grasp","network design"],"authorIDs":[]}