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 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.
Language
English
Source (journal)
European journal of operational research. - Amsterdam
Publication
Amsterdam : 2013
ISSN
0377-2217
Volume/pages
224:3(2013), p. 458-465
ISI
000311260300003
Full text (Publisher's DOI)
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 04.02.2013
Last edited 20.11.2017
To cite this reference