Loading...
Please wait, while we are loading the content...
Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário
| Content Provider | Semantic Scholar |
|---|---|
| Author | Martinhon, Carlos Alberto De Jesus Michelon, Philippe |
| Copyright Year | 2013 |
| Abstract | Due to constant development of society, increasing quantities of commodities have to be transported 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 transportations. 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 onelevel 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.din.uem.br/sbpo/sbpo2013/pdf/arq0263.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |