Slime mould imitation of Belgian transport networks: Redundancy, bio-essential motorways, and dissolution

International Journal of Unconventional Computing

Volumn 8, Issue 3, 2012, Pages 235-261

  Adamatzky, Andrew ^a   De Baets, Bernard ^b   Van Dessel, Wesley ^c  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

^b GHENT UNIVERSITY   (Belgium)

^c SCIENTIFIC INSTITUTE OF PUBLIC HEALTH   (Belgium)

Author keywords

Slime mould; Transport networks; Unconventional computing

Indexed keywords

BELGIUM; BIO-INSPIRED TECHNIQUES; EXPERIMENTAL LABORATORY; MOTORWAY NETWORKS; PHYSARUM POLYCEPHALUM; PROXIMITY GRAPHS; SIMULATION AND ANALYSIS; TRANSPORT NETWORKS; UNCONVENTIONAL COMPUTING; URBAN AREAS;

NUTRIENTS; TUBES (COMPONENTS);

MOLDS;

EID: 84869462911     PISSN: 15487199     EISSN: 15487202     Source Type: Journal    
DOI: None     Document Type: Article

References (51)

1. Adamatzky A. and Holland O. Reaction-diffusion and ant-based load balancing of communication networks. Kybernetes 31 (2002) 667-681.
2. Adamatzky A., De Lacy Costello B., Asai T. Reaction-Diffusion Computers, Elsevier, Amsterdam, 2005.
3. Adamatzky A. From reaction-diffusion to Physarum computing. Invited talk at Los Alamos Lab workshop "Unconventional Computing: Quo Vadis?" (Santa Fe, NM, March 2007).
4. Adamatzky A. Developing proximity graphs by Physarum Polycephalum: Does the plasmodium follow Toussaint hierarchy? Parallel Processing Letters 19 (2008) 105-127.
5. Adamatzky A., De Lacy Costello B., and Shirakawa T. Universal computation with limited resources: Belousov-Zhabotinsky and Physarum computers. Int. J. Bifurcat. Chaos 18 (2008) 2373-2389.
6. Adamatzky A. Slime mould logical gates: exploring ballistic approach (2010). http://arxiv.org/abs/1005.2301
7. Adamatzky A. Hot ice computer. Physics Lett A 347 (2009) 264-271.
8. Adamatzky A. Physarum Machines: Making Computers from Slime Mould (World Scientific, 2010).
9. Adamatzky A. and Jones J. Road planning with slime mould: If Physarum built motorways it would route M6/M74 through Newcastle. Int J Bifurcaton and Chaos 20 (2010) 3065-3084.
10. Adamatzky A., Martinez G. J., Chapa-Vergara S. V., Asomoza-Palacio R., Stephens C. R. Approximating Mexican highways with slime mould. Natural Computing 10 (2011) 1195-1214.
11. Adamatzky A. and Alonso-Sanz R. Rebuilding Iberian motorways with slime mould. (2010), Submitted.
12. Adamatzky A. and Prokopenko M. Slime mould evaluation of Australian motorways. Int J Parallel Emergent Distributed Systems (2011), in print.
13. Andersson K.G. (Ed.) Airborne Radioactive Contamination in Inhabited Areas. (Elsevier, 2009).
14. Boel R. and Mihaylova L. A compositional stochastic model for real time freeway traffic simulation. Transportation Research Part B: Methodological 40 (2006) 319-334.
15. De Lathauwer W. Scenarios for the transport infrastructure of Europe: Planning and financing. Tunnelling and Underground Space Technology 10 (1995) 45-51.
16. Dorigo M. and Stutzle T. Ant Colony Optimization MIT Press, 2004.
17. Froment A. and Wildmann B. Landscape ecology and rural restructuring in Belgium. Landscape and Urban Planning 14 (1987) 415-426.
18. Gabriel K. R. and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18 (1969) 259-278.
19. Jaromczyk J.W. and Kowaluk M. A note on relative neighbourhood graphs Proc. 3rd Ann. Symp. Computational Geometry, 1987, 233-241.
20. Jaromczyk J. W. and G. T. Toussaint, Relative neighborhood graphs and their relatives. Proc. IEEE 80 (1992) 1502-1517.
21. Jarrett T. C., Ashton D. J., Fricker M., Johnson N. F. Interplay between function and structure in complex networks Phys. Rev. E 74 (2006), 026116.
22. Li X.-Y. Application of computation geometry in wireless networks. In: Cheng X., Huang X., Du D.-Z. (Eds.) Ad Hoc Wireless Networking (Kluwer Academic Publishers, 2004) 197-264.
23. Regions of Brazil. http://en.wikipedia.org/wiki/Regions_of_Brazil. Latest access: April 2011.
24. maps.google.com
25. Matula D. W. and Sokal R. R. Properties of Gabriel graphs relevant to geographical variation research and the clustering of points in the same plane. Geographical Analysis 12 (1984) 205-222.
26. Muhammad R. B. A distributed graph algorithm for geometric routing in ad hoc wireless networks. J Networks 2 (2007) 49-57.
27. Nakagaki T., Yamada H., Ueda T. Interaction between cell shape and contraction pattern in the Physarum plasmodium, Biophysical Chemistry 84 (2000) 195-204.
28. Nakagaki T., Smart behavior of true slime mold in a labyrinth. Research in Microbiology 152 (2001) 767-770.
29. Nakagaki T., Yamada H., and Toth A., Path finding by tube morphogenesis in an amoeboid organism. Biophysical Chemistry 92 (2001) 47-52.
30. Nesetril J., Milkova E., Nesetrilova H., Otakar Boruvka on minimum spanning tree problem, Discrete Mathematics 233 (2001) 3-36.
31. Okuyama Y. and S. E. Chang. Modeling Spatial and Economic Impacts of Disasters (Advances in Spatial Science) (Springer, 2004).
32. Poelmans L. and Van Rompaey A. Detecting and modelling spatial patterns of urban sprawl in highly fragmented areas: A case study in the Flanders Brussels regio. Landscape and Urban Planning 93 (2009) 10-19.
33. Reyes D. R., Ghanem M. G., George M. Glow discharge in micro fluidic chips for visible analog computing. Lab on a Chip 1 (2002) 113-116.
34. Santi P. Topology Control in Wireless Ad Hoc and Sensor Networks (Wiley, 2005).
35. Sevenant M. and Antrop M. Transdisciplinary landscape planning: Does the public have aspirations? Experiences from a case study in Ghent (Flanders, Belgium). Land Use Policy 27 (2010) 373-386.
36. Schumann A. and Adamatzky A. Physarum spatial logic. In: Proc. 1th Int. Symp. on Symbolic and Numeric Algorithms for Scientific Computing (Timisoara, Romania, September 26-29, 2009).
37. Shirakawa T., Adamatzky A., Gunji Y.-P., Miyake Y. On simultaneous construction of Voronoi diagram and Delaunay triangulation by Physarum polycephalum. Int. J. Bifurcation and Chaos 9(2009) pp. 3109-3117.
38. Song W.-Z., Wang Y., Li X.-Y. Localized algorithms for energy efficient topology in wireless ad hoc networks. In: Proc. MobiHoc 2004 (May 24-26, 2004, Roppongi, Japan).
39. Statistics Belgium. Belgian Federal Government, 2010. http://statbel.fgov.be/nl/binaries/bevolkindichtheid_gemeente_Belgie_01012010_web_tcm325-120352.jpg
40. Stephenson S. L. and Stempen H. Myxomycetes: A Handbook of Slime Molds. (Timber Press, 2000).
41. Supowit K.J. The relative neighbourhood graph, with application to minimum spanning tree J. ACM 30 (1988) 428-448.
42. Takada J. Nuclear Hazards in the World: Field Studies on Affected Populations and Environments. (Springer, 2010).
43. Toroczkai Z. and Guclu H. Proximity networks and epidemics. Physica A 378 (2007) 68. arXiv:physics/0701255v1
44. Toussaint G. T., The relative neighborhood graph of a finite planar set, Pattern Recognition 12 (1980) 261-268.
45. Tsuda S., Aono M., Gunji Y.-P. Robust and emergent Physarum logical-computing. Biosystems 73 (2004) 45-55.
46. Vandenbulcke G. and Thomas I. Mapping accessibility in Belgium: a tool for land-use and transport planning? Journal of Transport Geography 17 (2009) 39-53.
47. Guia Quatro Rodas (in Portuguese). http://mapas.viajeaqui.abril.com.br/guiarodoviario/guiaRodoviario_viajeaqui.aspx. Latest access: Dec 2010.
48. Wan P.-J., Yi C.-W. On the longest edge of Gabriel Graphs in wireless ad hoc networks. IEEE Trans. on Parallel and Distributed Systems 18 (2007) 111-125.
49. Watanabe D. A study on analyzing the road network pattern using proximity graphs. J of the City Planning Institute of Japan 40 (2005) 133-138.
50. Watanabe D. Evaluating the configuration and the travel efficiency on proximity graphs as transportation networks. Forma 23 (2008) 81-87.
51. http://wegen-routes.be/hist/histn.html