A physarum polycephalum optimization algorithm for the bi-objective shortest path problem

International Journal of Unconventional Computing

Volumn 10, Issue 1-2, 2013, Pages 143-162

  Zhang, Xiaoge ^a   Wang, Qing ^a   Chan, Felix T S ^b   Mahadevan, Sankaran ^c   Deng, Yong ^a,c  

^a SOUTHWEST UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c VANDERBILT UNIVERSITY   (United States)

Author keywords

Biobjective shortest path problem; Pareto frontiers; Physarum polycephalum; Shortest path problem

Indexed keywords

ALGORITHM FOR SOLVING; CONFLICTING OBJECTIVES; MULTI-OBJECTIVE SHORTEST PATH PROBLEMS; NONDOMINATED SOLUTIONS; OPTIMIZATION ALGORITHMS; PARETO FRONTIERS; PHYSARUM POLYCEPHALUM; SHORTEST PATH PROBLEM;

ALGORITHMS;

GRAPH THEORY;

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

References (49)

1. R language. http://igraph.sourceforge.net/doc/R/erdos.renyi.game.html.
2. Andrew Adamatzky. (2008). Growing spanning trees in plasmodium machines. Kybernetes, 37(2):258-264.
3. Andrew Adamatzky. (2012). The world's colonization and trade routes formation as imitated by slime mould. International Journal of Bifurcation and Chaos, 22(08).
4. Andrew Adamatzky, Bernard De Baets, and Wesley Van Dessel. (2011). Slime mould imitation of belgian transport networks: redundancy, bio-essential motorways, and dissolution. International Journal of Unconventional Computing, 8(3):235-262.
5. Andrew Adamatzky and Pedro PB de Oliveira. (2011). Brazilian highways from slime mold's point of view. Kybernetes, 40(9/10):1373-1394.
6. Andrew Adamatzky and Jeff Jones. (2010). Road planning with slime mould: if physarum built motorways it would route m6/m74 through newcastle. International Journal of Bifurcation and Chaos, 20(10):3065-3084.
7. Andrew Adamatzky, Michael Lees, and Peter Sloot. (2013). Bio-development of motorway network in the netherlands: A slime mould approach. Advances in Complex Systems, 16:1250034.
8. Andrew Adamatzky, Genaro J Mart́i{dotless}nez, Sergio V Chapa-Vergara, Reńe Asomoza-Palacio, and Christopher R Stephens. (2011). Approximating mexican highways with slime mould. Natural Computing, 10(3):1195-1214.
9. Andrew Adamatzky and Mikhail Prokopenko. (2012). Slime mould evaluation of australian motorways. International Journal of Parallel, Emergent and Distributed Systems, 27(4):275-295.
10. Faez Ahmed and Kalyanmoy Deb. (2013). Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms. Soft Computing, 17(7):1-17.
11. Igor Aizenberg and Claudio Moraga. (2007). The genetic code as a function of multiplevalued logic over the field of complex numbers and its learning using multilayer neural network based on multi-valued neurons. Journal of Multiple-Valued Logic and Soft Computing, 13(4/6):605.
12. Sergio Alonso, Francisco Javier Cabrerizo, Francisco Chiclana, Francisco Herrera, and Enrique Herrera-Viedma. (2008). An interactive decision support system based on consistency criteria. Journal of Multiple-Valued Logic and Soft Computing, 14(3/5):371.
13. Masashi Aono, Masahiko Hara, Kazuyuki Aihara, and Toshinori Munakata. (2010). Amoeba-based emergent computing: combinatorial optimization and autonomous meta-problem solving. International Journal of Unconventional Computing, 6(2):89-108.
14. Masashi Aono, Liping Zhu, and Masahiko Hara. (2011). Amoeba-based neurocomputing for 8-city traveling salesman problem. International Journal of Unconventional Computing, 7(6):463-480.
15. Christian Artigues, Marie-Jośe Huguet, Fallou Gueye, Fŕed́eric Schettini, and Laurent Dezou. (2012). State-based accelerations and bidirectional search for bi-objective multimodal shortest paths. Transportation Research Part C: Emerging Technologies, 27:233-259.
16. W. Baumgarten, T. Ueda, and M.J.B. Hauser. (2010). Plasmodial vein networks of the slime mold physarum polycephalum form regular graphs. Physical Review E, 82(4):046113.
17. Leonardo CT Bezerra, Elizabeth FG Goldbarg, Marco C Goldbarg, and Luciana S Buriol. (2012). Analyzing the impact of moaco components: An algorithmic study on the multiobjective shortest path problem. Expert Systems with Applications, 40(1):345-355.
18. Vincenzo Bonifaci, Kurt Mehlhorn, and Girish Varma. (2012). Physarum can compute shortest paths. Journal of Theoretical Biology, 309:121-133.
19. J Brumbaugh-Smith and D Shier. (1989). An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research, 43(2):216-224.
20. Paola Cappanera and Maria Paola Scaparra. (2011). Optimal allocation of protective resources in shortest-path networks. Transportation Science, 45(1):64-80.
21. Yong Deng, Yuxin Chen, Yajuan Zhang, and Sankaran Mahadevan. (2012). Fuzzy dijkstra algorithm for shortest path problem under uncertain environment. Applied Soft Computing, 12(3):1231-1237.
22. Wen-Bo Du, Zhi-Xi Wu, and Kai-Quan Cai. (2013). Effective usage of shortest paths promotes transportation efficiency on scale-free networks. Physica A: Statistical Mechanics and its Applications, 392(17):3505-3512.
23. Erhan Erkut and Fatma Gzara. (2008). Solving the hazmat transport network design problem. Computers & Operations Research, 35(7):2234-2247.
24. Cai Gao, Xin Lan, Xiaoge Zhang, and Yong Deng. (2013). A bio-inspired methodology of identifying influential nodes in complex networks. Plos One, 8(6):e66732.
25. Keivan Ghoseiri and Behnam Nadjari. (2010). An ant colony optimization algorithm for the bi-objective shortest path problem. Applied Soft Computing, 10(4):1237-1246.
26. F Guerriero and R Musmanno. (2001). Label correcting methods to solve multicriteria shortest path problems. Journal of Optimization Theory and Applications, 111(3):589-613.
27. Yukio-Pegio Gunji, Tomohiro Shirakawa, Takayuki Niizato, and Taichi Haruna. (2008). Minimal model of a cell connecting amoebic motion and adaptive transport networks. Journal of Theoretical Biology, 253(4):659-667.
28. Manuel Iori, Silvano Martello, and Daniele Pretolani. (2010). An aggregate label setting policy for the multi-objective shortest path problem. European Journal of Operational Research, 207(3):1489-1496.
29. Kentaro Ito, Anders Johansson, Toshiyuki Nakagaki, and Atsushi Tero. (2011). Convergence properties for the physarum solver. arXiv preprint arXiv:1101.5249.
30. Jeff Jones. (2009). Approximating the behaviours of physarum polycephalum for the construction and minimisation of synthetic transport networks. In Unconventional Computation, pages 191-208.Springer.
31. Jeff Jones. (2010). Characteristics of pattern formation and evolution in approximations of physarum transport networks. Artificial Life, 16(2):127-153.
32. Bahar Y Kara and Vedat Verter. (2004). Designing a road network for hazardous materials transportation. Transportation Science, 38(2):188-196.
33. Jie Lu, Guangquan Zhang, and Tharam Dillon. (2008). Fuzzy multi-objective bilevel decision making by an approximation kth-best approach. Journal of Multiple-Valued Logic and Soft Computing, 14(3/5):205.
34. Cheikh Mohamed, Jarboui Bassem, and Loukil Taicir. (2010). A genetic algorithms to solve the bicriteria shortest path problem. Electronic Notes in Discrete Mathematics, 36:851-858.
35. Toshiyuki Nakagaki, Makoto Iima, Tetsuo Ueda, Yasumasa Nishiura, Tetsu Saigusa, Atsushi Tero, Ryo Kobayashi, and Kenneth Showalter. (2007). Minimum-risk path finding by an adaptive amoebal network. Physical Review Letters, 99(6):068104.
36. Jianhong Qiao, David Jeong, Mark Lawley, Jean-Philippe P Richard, Dulcy M Abraham, and Yuehwern Yih. (2007). Allocating security resources to a water supply network. IIE Transactions, 39(1):95-109.
37. Andrea Raith and Matthias Ehrgott. (2009). A comparison of solution strategies for biobjective shortest path problems. Computers & Operations Research, 36(4):1299-1331.
38. Derya Sever, Nico Dellaert, Tom van Woensel, and Ton de Kok. (2013). Dynamic shortest path problems: Hybrid routing policies considering network disruptions. Computers & Operations Research, 40(12):2852-2863.
39. T Shirakawa and Y-P Gunji. (2007). Emergence of morphological order in the network formation of physarum polycephalum. Biophysical Chemistry, 128(2):253-260.
40. Tomohiro Shirakawa, K Yokoyama, M Yamachiyo, Y-P Gunji, and Yoshihiro Miyake. (2012). Multi-scaled adaptability in motility and pattern formation of the physarum plasmodium. International Journal of Bio-Inspired Computation, 4(3):131-138.
41. Anders JV Skriver and Kim Allan Andersen. (2000). A label correcting approach for solving bicriterion shortest-path problems. Computers & Operations Research, 27(6):507-524.
42. A. Tero, R. Kobayashi, and T. Nakagaki. (2006). Physarum solver: A biologically inspired method of road-network navigation. Physica A: Statistical Mechanics and its Applications, 363(1):115-119.
43. A. Tero, R. Kobayashi, and T. Nakagaki. (2007). A mathematical model for adaptive transport network in path finding by true slime mold. Journal of Theoretical Biology, 244(4):553-564.
44. Manish Verma, Vedat Verter, and Nicolas Zufferey. (2012). A bi-objective model for planning and managing rail-truck intermodal transportation of hazardous materials. Transportation research part E: logistics and transportation review, 48(1):132-149.
45. Xiaoge Zhang, Yong Deng, Felix TS Chan, Peida Xu, Sankaran Mahadevan, and Yong Hu. (2013). Ifsjsp: A novel methodology for the job-shop scheduling problem based on intuitionistic fuzzy sets. International Journal of Production Research, 51(17):5100-5119.
46. Xiaoge Zhang, Shiyan Huang, Yong Hu, Yajuan Zhang, Sankaran Mahadevan, and Yong Deng. (2013). Solving 0-1 knapsack problems based on amoeboid organism algorithm. Applied Mathematics and Computation, 219(19):9959-9970.
47. Xiaoge Zhang, Yajuan Zhang, Yong Hu, Yong Deng, and Sankaran Mahadevan. (2013). An adaptive amoeba algorithm for constrained shortest paths. Expert Systems with Applications, 40(18):7607-7616.
48. Xiaoge Zhang, Zili Zhang, Yajuan Zhang, Daijun Wei, and Yong Deng. (2013). Route selection for emergency logistics management: A bio-inspired algorithm. Safety Science, 54:87-91.
49. Yajuan Zhang, Zili Zhang, Yong Deng, and Sankaran Mahadevan. (2013). A biologically inspired solution for fuzzy shortest path problems. Applied Soft Computing, 13(5):2356-2363.