The accessibility arc upgrading problem
| Autor: | Sofie Coene, Peter Goos, Frits C. R. Spieksma, Pablo Andrés Maya Duque, Kenneth Sörensen |
|---|---|
| Přispěvatelé: | Econometrics |
| Jazyk: | angličtina |
| Rok vydání: | 2013 |
| Předmět: |
Mathematical optimization
Information Systems and Management General Computer Science Economics Continuous knapsack problem Management Science and Operations Research Industrial and Manufacturing Engineering Network planning and design Variable (computer science) Cutting stock problem Knapsack problem Modeling and Simulation Network upgrading problem Knapsack problem Variable neighbourhood search Change-making problem Integer programming Mathematics Generalized assignment problem |
| Zdroj: | European journal of operational research European Journal of Operational Research, 224(3), 458-465. Elsevier |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/j.ejor.2012.09.005 |
| Popis: | The accessibility arc upgrading problem (AAUP) is a network upgrading problem that arises in real-life decision processes such as rural network planning. In this paper, we propose a linear integer programming formulation and two solution approaches for this problem. The first approach is based on the knapsack problem and uses the knowledge gathered from an analytical study of some special cases of the AAUP. The second approach is a variable neighbourhood search with strategic oscillation. The excellent performance of both approaches is demonstrated using a large set of randomly generated instances. Finally, we stress the importance of a proper allocation of scarce resources in accessibility improvement. (c) 2012 Elsevier B.V. All rights reserved. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect