IDEAS home Printed from https://ideas.repec.org/a/eee/jotrge/v21y2012icp102-112.html
   My bibliography  Save this article

Transport poverty meets the digital divide: accessibility and connectivity in rural communities

Author

Listed:
  • Velaga, Nagendra R.
  • Beecroft, Mark
  • Nelson, John D.
  • Corsar, David
  • Edwards, Peter

Abstract

Rural communities face a range of challenges associated with accessibility and connectivity which apply in both the physical and virtual sphere. Constraints in rural transport infrastructure and services are often compounded by limitations in the development and resilience of technological infrastructures. In this context there is significant disparity between urban and rural communities.

Suggested Citation

  • Velaga, Nagendra R. & Beecroft, Mark & Nelson, John D. & Corsar, David & Edwards, Peter, 2012. "Transport poverty meets the digital divide: accessibility and connectivity in rural communities," Journal of Transport Geography, Elsevier, vol. 21(C), pages 102-112.
    • Handle: RePEc:eee:jotrge:v:21:y:2012:i:c:p:102-112
    DOI: 10.1016/j.jtrangeo.2011.12.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0966692312000026
    Download Restriction: no
    File URL: https://libkey.io/10.1016/j.jtrangeo.2011.12.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Fu, Liping, 2002. "A simulation model for evaluating advanced dial-a-ride paratransit systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(4), pages 291-307, May.
    2. Golob, Thomas F. & Regan, Amelia C., 2001. "Impacts of Information Technology on Personal Tavel and Commercial Vehicle Operations: Research Challenges and Opportunities," University of California Transportation Center, Working Papers qt95r7j7vk, University of California Transportation Center.
    3. Currie, Graham, 2010. "Quantifying spatial gaps in public transport supply based on social needs," Journal of Transport Geography, Elsevier, vol. 18(1), pages 31-41.
    4. Hine, J. & Scott, J., 2000. "Seamless, accessible travel: users' views of the public transport journey and interchange," Transport Policy, Elsevier, vol. 7(3), pages 217-226, July.
    5. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    6. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    7. Giannopoulos, G. A., 2004. "The application of information and communication technologies in transport," European Journal of Operational Research, Elsevier, vol. 152(2), pages 302-320, January.
    8. Garaix, Thierry & Artigues, Christian & Feillet, Dominique & Josselin, Didier, 2010. "Vehicle routing problems with alternative paths: An application to on-demand transportation," European Journal of Operational Research, Elsevier, vol. 204(1), pages 62-75, July.
    9. Nelson, John D. & Wright, Steve & Masson, Brian & Ambrosino, Giorgio & Naniopoulos, Aristotelis, 2010. "Recent developments in Flexible Transport Services," Research in Transportation Economics, Elsevier, vol. 29(1), pages 243-248.
    10. Palmer, Kurt & Dessouky, Maged & Abdelmaguid, Tamer, 2004. "Impacts of management practices and advanced technologies on demand responsive transit systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(7), pages 495-509, August.
    11. Grotenhuis, Jan-Willem & Wiegmans, Bart W. & Rietveld, Piet, 2007. "The desired quality of integrated multimodal travel information in public transport: Customer needs for time and effort savings," Transport Policy, Elsevier, vol. 14(1), pages 27-38, January.
    12. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling," Transportation Science, INFORMS, vol. 19(4), pages 378-410, November.
    13. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2006. "A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1117-1139, October.
    14. Wright, Steve & Nelson, John D. & Cooper, James M. & Murphy, Stephanie, 2009. "An evaluation of the transport to employment (T2E) scheme in Highland Scotland using social return on investment (SROI)," Journal of Transport Geography, Elsevier, vol. 17(6), pages 457-467.
    15. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 14(2), pages 130-154, May.
    16. Harilaos N. Psaraftis, 1983. "An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows," Transportation Science, INFORMS, vol. 17(3), pages 351-357, August.
    17. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing," Transportation Science, INFORMS, vol. 19(4), pages 411-435, November.
    18. Politis, Ioannis & Papaioannou, Panagiotis & Basbas, Socrates & Dimitriadis, Nikolaos, 2010. "Evaluation of a bus passenger information system from the users' point of view in the city of Thessaloniki, Greece," Research in Transportation Economics, Elsevier, vol. 29(1), pages 249-255.
    19. Konstantinos Zografos & Konstantinos Androutsopoulos & Teemu Sihvola, 2008. "A methodological approach for developing and assessing business models for flexible transport systems," Transportation, Springer, vol. 35(6), pages 777-795, November.
    Full references (including those not matched with items on IDEAS)

    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. Häme, Lauri, 2011. "An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows," European Journal of Operational Research, Elsevier, vol. 209(1), pages 11-22, February.
    2. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    3. Jean-François Cordeau & Gilbert Laporte, 2007. "The dial-a-ride problem: models and algorithms," Annals of Operations Research, Springer, vol. 153(1), pages 29-46, September.
    4. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    5. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    6. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    7. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    8. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    9. Psaraftis, Harilaos N., 2011. "A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases," European Journal of Operational Research, Elsevier, vol. 215(3), pages 572-580, December.
    10. Garaix, Thierry & Artigues, Christian & Feillet, Dominique & Josselin, Didier, 2010. "Vehicle routing problems with alternative paths: An application to on-demand transportation," European Journal of Operational Research, Elsevier, vol. 204(1), pages 62-75, July.
    11. Hosni, Hadi & Naoum-Sawaya, Joe & Artail, Hassan, 2014. "The shared-taxi problem: Formulation and solution methods," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 303-318.
    12. Schulz, Arne & Pfeiffer, Christian, 2024. "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    13. Luo, Ying & Schonfeld, Paul, 2007. "A rejected-reinsertion heuristic for the static Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 736-755, August.
    14. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    15. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    16. Xue, Li & Luo, Zhixing & Lim, Andrew, 2016. "Exact approaches for the pickup and delivery problem with loading cost," Omega, Elsevier, vol. 59(PB), pages 131-145.
    17. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    18. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    19. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    20. Ge, Qian & Han, Ke & Liu, Xiaobo, 2021. "Matching and routing for shared autonomous vehicles in congestible network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).

    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:eee:jotrge:v:21:y:2012:i:c:p:102-112. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/journal-of-transport-geography .

    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.