Publication
Title
The accessibility arc upgrading problem
Author
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 rst 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.
Language
English
Source (series)
Research paper / UA, Faculty of Applied Economics ; 2012:009
Publication
Antwerpen : UA, 2012
Volume/pages
25 p.
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Record
Identification
Creation 04.04.2012
Last edited 04.09.2013
To cite this reference