IDEAS home Printed from https://ideas.repec.org/a/oup/beheco/v26y2015i1p223-231..html
   My bibliography  Save this article

Ants build transportation networks that optimize cost and efficiency at the expense of robustness

Author

Listed:
  • Guénaël Cabanes
  • Ellen van Wilgenburg
  • Madeleine Beekman
  • Tanya Latty

Abstract

Like modern human societies, many biological systems are dependent on transportation networks for the efficient distribution of resources and information. Network builders face the daunting challenge of optimizing conflicting network criteria such as robustness, efficiency, and cost, which cannot be optimized simultaneously. Here, we use graph and network theory to examine the trail networks of the polydomous meat ant Iridomyrmex purpureus. Meat ants build and maintain physical trails that connect their multiple nests to each other and to food resources. The resulting transportation network is used to distribute workers, brood, and food resources. We found that meat ants built low-cost trail networks that were relatively efficient. However, networks were less robust than comparable simulated networks, suggesting that meat ants prioritize cost and efficiency over robustness. Populous nests had higher connectivity than did less populous nests, implying they play a key role in resource distribution throughout the network. We propose that meat ant networks are an ideal model system for the development of network optimization heuristics.

Suggested Citation

  • Guénaël Cabanes & Ellen van Wilgenburg & Madeleine Beekman & Tanya Latty, 2015. "Ants build transportation networks that optimize cost and efficiency at the expense of robustness," Behavioral Ecology, International Society for Behavioral Ecology, vol. 26(1), pages 223-231.
  • Handle: RePEc:oup:beheco:v:26:y:2015:i:1:p:223-231.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1093/beheco/aru175
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Werner Risau, 1997. "Mechanisms of angiogenesis," Nature, Nature, vol. 386(6626), pages 671-674, April.
    2. J. Buhl & J. Gautrais & R. Solé & P. Kuntz & S. Valverde & J. Deneubourg & G. Theraulaz, 2004. "Efficiency and robustness in ant networks of galleries," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 42(1), pages 123-129, November.
    3. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    4. J. Buhl & J. Gautrais & N. Reeves & R. V. Solé & S. Valverde & P. Kuntz & G. Theraulaz, 2006. "Topological patterns in street networks of self-organized urban settlements," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 49(4), pages 513-522, February.
    5. Tero, Atsushi & Kobayashi, Ryo & Nakagaki, Toshiyuki, 2006. "Physarum solver: A biologically inspired method of road-network navigation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 363(1), pages 115-119.
    6. Perna, Andrea & Valverde, Sergi & Gautrais, Jacques & Jost, Christian & Solé, Ricard & Kuntz, Pascale & Theraulaz, Guy, 2008. "Topological efficiency in three-dimensional gallery networks of termite nests," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6235-6244.
    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. Viana, Matheus P. & Fourcassié, Vincent & Perna, Andrea & Costa, Luciano da F. & Jost, Christian, 2013. "Accessibility in networks: A useful measure for understanding social insect nest architecture," Chaos, Solitons & Fractals, Elsevier, vol. 46(C), pages 38-45.
    2. Sohouenou, Philippe Y.R. & Christidis, Panayotis & Christodoulou, Aris & Neves, Luis A.C. & Presti, Davide Lo, 2020. "Using a random road graph model to understand road networks robustness to link failures," International Journal of Critical Infrastructure Protection, Elsevier, vol. 29(C).
    3. Jiang, Bin, 2007. "A topological pattern of urban street networks: Universality and peculiarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 384(2), pages 647-655.
    4. Batac, Rene C. & Cirunay, Michelle T., 2022. "Shortest paths along urban road network peripheries," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 597(C).
    5. Boeing, Geoff, 2017. "OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks," SocArXiv q86sd, Center for Open Science.
    6. Liang, Jinpeng & Wu, Jianjun & Gao, Ziyou & Sun, Huijun & Yang, Xin & Lo, Hong K., 2019. "Bus transit network design with uncertainties on the basis of a metro network: A two-step model framework," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 115-138.
    7. Lorenzo Barbieri & Roberto D’Autilia & Paola Marrone & Ilaria Montella, 2023. "Graph Representation of the 15-Minute City: A Comparison between Rome, London, and Paris," Sustainability, MDPI, vol. 15(4), pages 1-14, February.
    8. Weckström, Christoffer & Mladenović, Miloš N. & Kujala, Rainer & Saramäki, Jari, 2021. "Navigability assessment of large-scale redesigns in nine public transport networks: Open timetable data approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 147(C), pages 212-229.
    9. Zhaowei Yin & Yuanyuan Guo & Mengshu Zhou & Yixuan Wang & Fengliang Tang, 2024. "Integration between Dockless Bike-Sharing and Buses: The Effect of Urban Road Network Characteristics," Land, MDPI, vol. 13(8), pages 1-24, August.
    10. Lia Papadopoulos & Pablo Blinder & Henrik Ronellenfitsch & Florian Klimm & Eleni Katifori & David Kleinfeld & Danielle S Bassett, 2018. "Comparing two classes of biological distribution systems using network analysis," PLOS Computational Biology, Public Library of Science, vol. 14(9), pages 1-31, September.
    11. Gao, Cai & Yan, Chao & Zhang, Zili & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "An amoeboid algorithm for solving linear transportation problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 398(C), pages 179-186.
    12. Nayan, Ashish & Wang, David Z.W., 2017. "Optimal bus transit route packaging in a privatized contracting regime," Transportation Research Part A: Policy and Practice, Elsevier, vol. 97(C), pages 146-157.
    13. David Canca & Belén Navarro-Carmona & Gabriel Villa & Alejandro Zarzo, 2023. "A Multilayer Network Approach for the Bimodal Bus–Pedestrian Line Planning Problem," Mathematics, MDPI, vol. 11(19), pages 1-36, October.
    14. Ali Najmi & Taha H. Rashidi & Alireza Abbasi & S. Travis Waller, 2017. "Reviewing the transport domain: an evolutionary bibliometrics and network analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 110(2), pages 843-865, February.
    15. Wang, Jian & He, Xiaozheng & Peeta, Srinivas & Wang, Wei, 2022. "Globally convergent line search algorithm with Euler-based step size-determination method for continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 119-144.
    16. Amirali Zarrinmehr & Mahmoud Saffarzadeh & Seyedehsan Seyedabrishami & Yu Marco Nie, 2016. "A path-based greedy algorithm for multi-objective transit routes design with elastic demand," Public Transport, Springer, vol. 8(2), pages 261-293, September.
    17. Wagner, Roy, 2008. "On the metric, topological and functional structures of urban networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(8), pages 2120-2132.
    18. Barahimi, Amir Hossein & Eydi, Alireza & Aghaie, Abdolah, 2021. "Multi-modal urban transit network design considering reliability: multi-objective bi-level optimization," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    19. Huang, Wentao & Jian, Sisi & Rey, David, 2024. "Non-additive network pricing with non-cooperative mobility service providers," European Journal of Operational Research, Elsevier, vol. 318(3), pages 802-824.
    20. Harshad Khadilkar, 2017. "Data-Enabled Stochastic Modeling for Evaluating Schedule Robustness of Railway Networks," Transportation Science, INFORMS, vol. 51(4), pages 1161-1176, November.

    More about this item

    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:oup:beheco:v:26:y:2015:i:1:p:223-231.. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/beheco .

    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.