The accessibility arc upgrading problem

Pablo A. Maya Duque, Sofie Coene, Peter Goos (), Kenneth Sörensen and Frits Spieksma

Working Papers from University of Antwerp, Faculty of Business and Economics

Abstract: 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 validated using a large set of random generated instances. Finally, we stress the importance of a proper allocation of scarce resources in accessibility improvement.

Keywords: Network upgrading problem; Knapsack problem; Variable neighbourhood search (search for similar items in EconPapers)
Pages: 25 pages
Date: 2012-03
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://repository.uantwerpen.be/docman/irua/e9ee03/ddcf50a5.pdf (application/pdf)

Related works:
Journal Article: The accessibility arc upgrading problem (2013)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ant:wpaper:2012009

Access Statistics for this paper

More papers in Working Papers from University of Antwerp, Faculty of Business and Economics Contact information at EDIRC.
Bibliographic data for series maintained by Joeri Nys ().