Advanced Search
MyIDEAS: Login to save this paper or follow this series

The accessibility arc upgrading problem

Contents:

Author Info

  • DUQUE, Pablo A. Maya
  • COENE, Sofie
  • GOOS, Peter
  • SÖRENSEN, Kenneth
  • SPIEKSMA, Frits

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: https://www.uantwerpen.be/images/uantwerpen/container1244/files/TEW%20-%20Onderzoek/Working%20Papers/RPS/2012/RPS-2012-009.pdf
Download Restriction: no

Bibliographic Info

Paper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number 2012009.

as in new window
Length: 25 pages
Date of creation: Mar 2012
Date of revision:
Handle: RePEc:ant:wpaper:2012009

Contact details of provider:
Postal: Prinsstraat 13, B-2000 Antwerpen
Web page: https://www.uantwerp.be/en/faculties/applied-economic-sciences/
More information through EDIRC

Related research

Keywords: Network upgrading problem; Knapsack problem; Variable neighbourhood search;

Other versions of this item:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Murawski, Lisa & Church, Richard L., 2009. "Improving accessibility to rural health services: The maximal covering network improvement problem," Socio-Economic Planning Sciences, Elsevier, Elsevier, vol. 43(2), pages 102-110, June.
  2. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, INFORMS, vol. 20(5), pages 814-821, January.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2012009. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.