Biological systems have adapted to environmental constraints and limited resource availability. In the present study, we evaluate the algorithm underlying leaf venation (LV) deployment using graph theory. We compare the traffic balance, travel and cost efficiency of simply-connected LV networks to those of the fan tree and of the minimum spanning tree. We use a Pareto front to show that the total length of leaf venations is close to optimal. Then we apply the LV algorithm to design transportation networks in the city of Atlanta. Results show that leaf- inspired models can perform similarly or better than computer-intensive optimization algorithms in terms of network cost and service performance, which could facilitate the design of engineering transportation networks.

中文翻译：

---

受叶片通风算法启发的运输网络。

生物系统已适应环境限制和有限的资源可用性。在本研究中，我们使用图论评估叶脉（LV）部署的基础算法。我们比较了简单连接的LV网络与扇形树和最小生成树的流量平衡，行程和成本效率。我们使用帕累托锋线显示叶脉的总长度接近最佳。然后，我们将LV算法应用于亚特兰大市的交通网络设计。结果表明，以叶为灵感的模型在网络成本和服务性能方面可以比计算机密集型优化算法执行类似或更好的操作，这可以简化工程运输网络的设计。