Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 268152, 23 pages
http://dx.doi.org/10.1155/2014/268152
Research Article

Evolutionary Computation with Spatial Receding Horizon Control to Minimize Network Coding Resources

1State Key Laboratory of Earth Surface Processes and Resource Ecology, Beijing Normal University, Beijing 100875, China
2School of Engineering, University of Warwick, Coventry CV4 7AL, UK

Received 7 November 2013; Accepted 30 December 2013; Published 14 April 2014

Academic Editors: Z. Cui and X. Yang

Copyright © 2014 Xiao-Bing Hu and Mark S. Leeson. 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. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, 2000. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Kim, C. W. Ahn, M. Medard, and M. Effros, “On minimizing network coding resources: an evolutionary approach,” in Proceedings of the Workshop on Network Coding, Theory, and Applications (NetCod '06), Boston, Mass, USA, April 2006.
  3. M. B. Richey and R. G. Parker, “On multiple steiner subgraph problems,” Networks, vol. 16, no. 4, pp. 423–438, 1986. View at Google Scholar · View at Scopus
  4. C. Fragouli and R. G. Parker, “Information flow decomposition for network coding,” IEEE Transactions on Information Theory, vol. 52, no. 3, pp. 829–848, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. M. Langberg, A. Sprintson, and J. Bruck, “The encoding complexity of network coding,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2386–2397, 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. K. Bhattad, N. Ratnakar, R. Koetter, and K. R. Narayanan, “Minimal network coding for multicast,” in Proceedings of the International Symposium on Information Theory (ISIT '05), pp. 1730–1734, Adelaide, Australia, September 2005.
  7. M. Kim, M. Médard, V. Aggarwal et al., “Evolutionary approaches to minimizing network coding resources,” in Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM '07), pp. 1991–1999, Anchorage, Alaska, USA, May 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Kim, V. Aggarwal, U. M. O’Reilly, M. Medard, and W. Kim, “Genetic representation for evolutionary minimization of network coding resources,” in Proceedings of the 4th European Workshop on the Application of Nature-Inspired Techniques to Telecommunication Networks and Other Connected Systems (EvoCOMNET '07), Valencia, Spain, April 2007.
  9. M. Kim, V. Aggarwal, U.-M. O'Reilly, and M. Medard, “A doubly distributed genetic algorithm for network coding,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 1272–1279, London, UK, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. X.-B. Hu, M. S. Leeson, and E. L. Hines, “An effective genetic algorithm for network coding,” Computers and Operations Research, vol. 39, no. 5, pp. 952–963, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. D. Thierens, “Scalability problems of simple genetic algorithms,” Evolutionary computation, vol. 7, no. 4, pp. 331–352, 1999. View at Google Scholar · View at Scopus
  12. E. Cantú-Paz and D. E. Goldberg, “On the scalability of parallel genetic algorithms,” Evolutionary computation, vol. 7, no. 4, pp. 429–449, 1999. View at Google Scholar · View at Scopus
  13. G. Colombo and S. M. Allen, “Problem decomposition for minimum interference frequency assignment,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '07), pp. 3492–3499, Singapore, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Tsutsui, A. Ghosh, and Y. Fujimoto, “Forking genetic algorithms: GAs with search space division schemes,” Evolutionary Computation, vol. 5, no. 1, pp. 61–80, 1997. View at Google Scholar · View at Scopus
  15. D. W. Clarke, Advances in Model-Based Predictive Control, Oxford University Press, 1994.
  16. J. M. Maciejowski, Predictive Control with Constraints, Personal Education Limited, Marlow, UK, 2002.
  17. X.-B. Hu and E. A. di Paolo, “A ripple-spreading genetic algorithm for the aircraft sequencing problem,” Evolutionary Computation, vol. 19, no. 1, pp. 77–106, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Chand, V. N. Hsu, and S. Sethi, “Forecast, solution, and rolling horizons in operations management problems: a classified bibliography,” Manufacturing and Service Operations Management, vol. 4, no. 1, pp. 25–43, 2002. View at Google Scholar · View at Scopus
  19. B. De Schutter and T. Van Den Boom, “Model predictive control for max-plus-linear discrete event systems,” Automatica, vol. 37, no. 7, pp. 1049–1056, 2001. View at Publisher · View at Google Scholar · View at Scopus
  20. X.-B. Hu and W.-H. Chen, “Genetic algorithm based on receding horizon control for arrival sequencing and scheduling,” Engineering Applications of Artificial Intelligence, vol. 18, no. 5, pp. 633–642, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. X.-B. Hu, W.-H. Chen, and E. Di Paolo, “Multiairport capacity management: genetic algorithm with receding horizon,” IEEE Transactions on Intelligent Transportation Systems, vol. 8, no. 2, pp. 254–263, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. Z.-H. Zhan, J. Zhang, Y. Li et al., “An efficient ant colony system based on receding horizon control for the aircraft arrival sequencing and scheduling problem,” IEEE Transactions on Intelligent Transportation Systems, vol. 11, no. 2, pp. 399–412, 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. C. M. Fonseca and P. J. Fleming, “An overview of evolutionary algorithms in multiobjective optimization,” Evolutionary Computation, vol. 3, no. 1, pp. 1–16, 1995. View at Google Scholar
  24. A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing, Springer, Berlin, Germany, 2003.
  25. T. Ho, M. Medard, J. Shi, M. Effros, and D. R. Karger, “On randomized network coding,” in Proceedings of the 41st Annual Allerton Conference on Communication, Control and Computing, Monticello, Va, USA, 2003.
  26. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, “The benefits of coding over routing in a randomized setting,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, July 2003. View at Scopus
  27. G. Sywerda, “Uniform crossover in genetic algorithms,” in Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 2–9, San Francisco, Calif, USA. View at Google Scholar
  28. G. Melançon and F. Philippe, “Generating connected acyclic digraphs uniformly at random,” Information Processing Letters, vol. 90, no. 4, pp. 209–213, 2004. View at Publisher · View at Google Scholar · View at Scopus