Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 879472, 5 pages
http://dx.doi.org/10.1155/2013/879472
Research Article

Delivery Time Reliability Model of Logistics Network

1School of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
2Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240, China

Received 17 January 2013; Accepted 14 March 2013

Academic Editor: Engang Tian

Copyright © 2013 Liusan Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. Erdös and A. Rényi, “On random graphs. I,” Publicacions Matemàtiques, vol. 6, pp. 290–297, 1959. View at Google Scholar · View at Zentralblatt MATH
  2. D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at Publisher · View at Google Scholar · View at Scopus
  3. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” American Association for the Advancement of Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  4. J. Wu and Y. J. Tan, “Study on measure of complex network invulnerability,” Journal of Systems Engineering, vol. 20, no. 2, pp. 128–131, 2005. View at Google Scholar · View at Zentralblatt MATH
  5. Y. J. Tan, J. Wu, and H. Z. Deng, “Progress in invulnerability of complex networks,” Journal of University of Shanghai For Science and Technology, vol. 33, no. 6, pp. 653–668, 2011. View at Google Scholar
  6. H. Z. Deng, J. Wu, Y. Li, X. Lv, and Y. J. Tan, “Influence of complex network topologic structureon system invulnerability,” Systems Engineering and Electronics, vol. 30, no. 12, pp. 2425–2428, 2008. View at Google Scholar · View at Scopus
  7. R. Albert, H. Jeong, and A. L. Barabási, “Error and attack tolerance of complex networks,” Nature, vol. 406, no. 6794, pp. 378–382, 2000. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Sun, Z. X. Liu, Z. Q. Chen, and Z. Yuan, “Error and attack tolerance of evolving networks with local preferential attachment,” Physica A, vol. 373, no. 2, pp. 851–860, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. Y. N. Jiang, R. Y. Li, N. Huang et al., “Survey on network reliability evaluation methods,” Computer Science, vol. 39, no. 5, pp. 9–18, 2012. View at Google Scholar
  10. W. H. Qiu, Entropy Theory and Its Application in Management Decision, China Electric Power Press, Beijing, China, 2011.
  11. L. Y. Ma, W. H. Qiu, and Y. Q. Yang, “Risk modeling and entropy decision on large complex project,” Journal of Beijing University of Aeronautics and Astronautics, vol. 36, no. 2, pp. 184–187, 2010. View at Google Scholar · View at Scopus
  12. R. X. Zhou, S. C. Liu, and W. H. Qiu, “Survey of applications of entropy in decision analysis,” Control and Decision, vol. 23, no. 4, pp. 361–371, 2008. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. L. S. Wu and Q. M. Tan, “A study of the stability of emergency logistics network based on network Entropy,” Contemporary Finance & Economics, no. 7, pp. 60–68, 2012. View at Google Scholar
  14. B. Wang, H. W. Tang, C. H. Guo, and Z. Xiu, “Entropy optimization of scale-free networks' robustness to random failures,” Physica A, vol. 363, no. 2, pp. 591–596, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. R. Zhang, M. Xian, and G. Y. Wang, “A quantitative evaluation technique of attack effect of computer network based on network entropy,” Journal of China Institute of Communications, vol. 25, no. 11, pp. 158–165, 2004. View at Google Scholar
  16. L. Q. Yong, P. M. Sun, and J. K. Zhang, “Maximum entropy social cognitive optimization algorithm for a class of nonlinear minimax problems,” Computer Engineering and Applications, vol. 46, no. 26, pp. 36–42, 2010. View at Google Scholar
  17. G. Y. Yang and Y. H. Zhen, “Research on solving method of multi-objective decision-making,” Mathematics in Practice and Theory, vol. 42, no. 2, pp. 108–115, 2012. View at Google Scholar
  18. Y. L. Zheng, L. H. Ma, and J. X. Qian, “SGA (simplex-genetic algorimth): a universal algorithm for solving minimax problem,” System Engineering Theory and Practice, vol. 22, no. 12, pp. 33–87, 2002. View at Google Scholar · View at Scopus
  19. Z. B. Zhu, X. Cai, and J. B. Jian, “An improved SQP algorithm for solving minimax problems,” Applied Mathematics Letters, vol. 22, no. 4, pp. 464–469, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. Q.-J. Hu, Y. Chen, N.-P. Chen, and X.-Q. Li, “A modified SQP algorithm for minimax problems,” Journal of Mathematical Analysis and Applications, vol. 360, no. 1, pp. 211–222, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet