IDEAS home Printed from https://ideas.repec.org/p/ant/wpaper/2012009.html
   My bibliography  Save this paper

The accessibility arc upgrading problem

Author

Listed:
  • 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 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.

Suggested Citation

  • DUQUE, Pablo A. Maya & COENE, Sofie & GOOS, Peter & SÖRENSEN, Kenneth & SPIEKSMA, Frits, 2012. "The accessibility arc upgrading problem," Working Papers 2012009, University of Antwerp, Faculty of Business and Economics.
    • Handle: RePEc:ant:wpaper:2012009
    as

    Download full text from publisher

    File URL: https://repository.uantwerpen.be/docman/irua/e9ee03/ddcf50a5.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Murawski, Lisa & Church, Richard L., 2009. "Improving accessibility to rural health services: The maximal covering network improvement problem," Socio-Economic Planning Sciences, 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, vol. 20(5), pages 814-821, January.
    3. Bruno F. Santos & António P. Antunes & Eric J. Miller, 2010. "Interurban road network planning model with accessibility and robustness objectives," Transportation Planning and Technology, Taylor & Francis Journals, vol. 33(3), pages 297-313, February.
    4. Sven O. Krumke & Madhav V. Marathe & Hartmut Noltemeier & R. Ravi & S. S. Ravi, 1998. "Approximation Algorithms for Certain Network Improvement Problems," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 257-288, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sakineh Lakzaei & Donya Rahmani & Babak Mohamadpour Tosarkani & Sepideh Nasiri, 2023. "Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach," Annals of Operations Research, Springer, vol. 328(2), pages 1495-1522, September.
    2. Yücel, E. & Salman, F.S. & Arsik, I., 2018. "Improving post-disaster road network accessibility by strengthening links against failures," European Journal of Operational Research, Elsevier, vol. 269(2), pages 406-422.
    3. Shuanglin Li & Kok Lay Teo, 2019. "Post-disaster multi-period road network repair: work scheduling and relief logistics optimization," Annals of Operations Research, Springer, vol. 283(1), pages 1345-1385, December.
    4. Sullivan, James L. & Novak, David C., 2024. "A method for evaluating accessibility in transportation problems considering social vulnerability," European Journal of Operational Research, Elsevier, vol. 317(3), pages 646-659.
    5. Lazar Mrkela & Zorica Stanimirović, 2022. "A variable neighborhood search for the budget-constrained maximal covering location problem with customer preference ordering," Operational Research, Springer, vol. 22(5), pages 5913-5951, November.
    6. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2016. "Budget-constrained minimum cost flows," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1720-1745, May.
    7. Maya Duque, Pablo A. & Dolinskaya, Irina S. & Sörensen, Kenneth, 2016. "Network repair crew scheduling and routing for emergency relief distribution problem," European Journal of Operational Research, Elsevier, vol. 248(1), pages 272-285.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Johanna Guth & Sven Wursthorn & Andreas Ch. Braun & Sina Keller, 2019. "Development of a generic concept to analyze the accessibility of emergency facilities in critical road infrastructure for disaster scenarios: exemplary application for the 2017 wildfires in Chile and ," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 97(3), pages 979-999, July.
    2. Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi, 2020. "Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks," Annals of Operations Research, Springer, vol. 289(2), pages 153-172, June.
    3. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    4. Amber Kunkel & Elizabeth Itallie & Duo Wu, 2014. "Optimal distribution of medical backpacks and health surveillance assistants in Malawi," Health Care Management Science, Springer, vol. 17(3), pages 230-244, September.
    5. Tingting Chen & John D. Radke & Wei Lang & Xun Li, 2020. "Environment resilience and public health: Assessing healthcare's vulnerability to climate change in the San Francisco Bay Area," Growth and Change, Wiley Blackwell, vol. 51(2), pages 607-625, June.
    6. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    7. Çiğdem Güler & Horst W. Hamacher, 2010. "Capacity inverse minimum cost flow problem," Journal of Combinatorial Optimization, Springer, vol. 19(1), pages 43-59, January.
    8. Zhong, Qing & Tong, Daoqin, 2020. "Spatial layout optimization for solar photovoltaic (PV) panel installation," Renewable Energy, Elsevier, vol. 150(C), pages 1-11.
    9. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
    10. Alassane DRABO & Christian EBEKE, 2010. "Remittances, Public Health Spending and Foreign Aid in the Access to Health Care Services in Developing Countries," Working Papers 201004, CERDI.
    11. Cinzia Di Novi & Harshita Thakare, 2022. "Inequality of Opportunity in Accessing Maternal and Newborn Healthcare Services: Evidence from the Bangladesh Demographic and Health Survey," Social Indicators Research: An International and Interdisciplinary Journal for Quality-of-Life Measurement, Springer, vol. 164(3), pages 1505-1529, December.
    12. Sullivan, James L. & Novak, David C., 2024. "A method for evaluating accessibility in transportation problems considering social vulnerability," European Journal of Operational Research, Elsevier, vol. 317(3), pages 646-659.
    13. Ospina, Juan P. & Duque, Juan C. & Botero-Fernández, Verónica & Montoya, Alejandro, 2022. "The maximal covering bicycle network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 222-236.
    14. Igor Litvinchev & Socorro Rangel, 2006. "Using error bounds to compare aggregated generalized transportation models," Annals of Operations Research, Springer, vol. 146(1), pages 119-134, September.
    15. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    16. Xu, Jing & Murray, Alan T. & Church, Richard L. & Wei, Ran, 2023. "Service allocation equity in location coverage analytics," European Journal of Operational Research, Elsevier, vol. 305(1), pages 21-37.
    17. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2016. "Budget-constrained minimum cost flows," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1720-1745, May.
    18. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
    19. Festa, P. & Guerriero, F. & Laganà, D. & Musmanno, R., 2013. "Solving the shortest path tour problem," European Journal of Operational Research, Elsevier, vol. 230(3), pages 464-474.
    20. Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.

    More about this item

    Keywords

    Network upgrading problem; Knapsack problem; Variable neighbourhood search;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2012009. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joeri Nys (email available below). General contact details of provider: https://edirc.repec.org/data/ftufsbe.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.