Shengxiang Yang    PhD, MSc, BSc
About Me     Teaching     Research     Funding     Publications     Links  

Welcome to Shengxiang Yang's Publications Page

Electronic copy of papers is available on request. You may also see my record in Scopus, DBLP, Web Of Knowledge, and Google Scholar.

Edited Books, Proceedings and Journal Special Issues

  1. S. Yang and X. Yao (Eds.), Evolutionary Computation for Dynamic Optimization Problems, in the series Studies in Computational Intelligence, Springer-Verlag Berlin Heidelberg. Ongoing, expected in 2012.
  2. S. Yang, Y.-S. Ong, and Y. Jin (Eds.), Evolutionary Computation in Dynamic and Uncertain Environments, in the series Studies in Computational Intelligence, Vol. 51, Springer-Verlag Berlin Heidelberg, ISSN: 1860-949X (Print) 1860-9503 (Online), ISBN: 978-3-540-49772-1, March 2007 (DOI: 10.1007/978-3-540-49774-5).
  3. Jin, Y.; Yang, S.; Polikar, R (Eds.), Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments, IEEE Press, ISBN: 978-1-4244-9930-4, April 2011 (DOI: 10.1109/CIDUE.2011.5948495).
  4. Giacobini, M.; Brabazon, A.; Cagnoni, S.; Di Caro, G.A.; Ekart, A.; Esparcia-Alcazar, A.I.; Farooq, M.; Fink, A.; Machado, P.; McCormack, J.; O'Neill, M.; Neri, F.; Preuss, M.; Rothlauf, F.; Tarantino, E.; Yang, S. (Eds.), EvoWorkshops 2009: Applications of Evolutionary Computing, Lecture Notes in Computer Science, vol. 5484, Springer, ISBN: 978-3-642-01128-3, April 2009 (DOI: 10.1007/978-3-642-01129-0).
  5. Giacobini, M.; Brabazon, A.; Cagnoni, S.; Di Caro, G.A.; Drechsler, R.; Ekart, A.; Esparcia-Alcazar, A.I.; Farooq, M.; Fink, A.; McCormack, J.; O'Neill, M.; Romero, J.; Rothlauf, F.; Squillero, G.; Uyar, S.; Yang, S. (Eds.), EvoWorkshops 2008: Applications of Evolutionary Computing, Lecture Notes in Computer Science, vol. 4974, Springer, ISBN: 978-3-540-78760-0, May 2008 (DOI: 10.1007/978-3-540-78761-7).
  6. Giacobini, M.; Brabazon, A.; Cagoni, S.; Di Caro, G.A.; Drechsler, R.; Farooq, M.; Fink, A.; Lutton, E.; Machado, P.; Minner, S.; O'Neill, M.; Romero, J.; Rothlauf, F.; Squillero, G.; Takagi, H.; Uyar, A.S.; Yang, S. (Eds.), EvoWorkshops 2007: Applications of Evolutionary Computing, Lecture Notes in Computer Science, vol. 4448, Springer, ISBN: 978-3-540-71804-8, June 2007 (DOI: 10.1007/978-3-540-71805-5).
  7. F. Rothlauf et al (Eds.), Proceedings of the 2005 Workshops on Genetic and Evolutionary Computation, ACM Press, New York, USA, 2005 (DOI: 10.1145/1102256).
  8. F. Neri and S. Yang (guest editors), Memetic Computing in the Presence of Uncertainties, Thematic Issue of Memetic Computing, Vol. 2, No. 2, pp. 85-162, June 2010, Springer, ISSN: 1865-9284 (print version), ISSN: 1865-9292 (Online).
  9. S. Yang, Y.-S. Ong, and Y. Jin (guest editors), Evolutionary Computation in Dynamic and Uncertain Environments, Special Issue of Genetic Programming and Evolvable Machines, Vol. 7, No. 4, pp. 293-404, December 2006, Springer Netherlands, ISSN: 1389-2576 (Print), 1573-7632 (Online).

Journal Papers (and Source Codes)

  1. W. Kong, T. Chai, S. Yang, and J. Ding. A hybrid evolutionary multiobjective optimization strategy for the dynamic power supply problem in magnesia grain manufacturing. Applied Soft Computing, published onlie first: 13 March 2012. Elsevier (DOI: 10.1016/j.asoc.2012.02.025).
  2. C. Li and S. Yang. A general framework of multi-population methods with clustering in undetectable dynamic environments. IEEE Transactions on Evolutionary Computation, published onlie first: 10 February 2012. IEEE Press (DOI: 10.1109/TEVC.2011.2169966 and PDF File).
  3. H. Wang, I.-K. Moon, S. Yang, and D. Wang. A memetic particle swarm optimization algorithm for multimodal optimization problems. Information Sciences, 197: 38-52, August 2012. Elsevier (DOI: 10.1016/j.ins.2012.02.016).
  4. H. Wang, S. Yang, W. H. Ip, and D. Wang. A memetic particle swarm optimization algorithm for dynamic multi-modal optimization problems. International Journal of Systems Science, 43(7): 1268-1283, July 2012. Taylor & Francis (DOI: 10.1080/00207721.2011.605966 and PDF File).
  5. C. Li, S. Yang, and T. T. Nguyen. A self-learning particle swarm optimizer for global optimization problems. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 42(3): 627-646, June 2012. IEEE Press (DOI: 10.1109/TSMCB.2011.2171946 and PDF File).
  6. L. Liu, S. Yang, and D. Wang. Force-imitated particle swarm optimization using the near-neighbor effect for locating multiple optima. Information Sciences, 182(1): 139-155, January 2012. Elsevier (DOI: 10.1016/j.ins.2010.11.013 and PDF File).
  7. S. N. Jat and S. Yang. A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling. Journal of Scheduling, 14(6): 617-637, December 2011. Springer (DOI: 10.1007/s10951-010-0202-0 and PDF File).
  8. R. Tinos and S. Yang. Use of the q-Gaussian mutation in evolutionary algorithms. Soft Computing, 15(8): 1523-1549, August 2011. Springer (DOI: 10.1007/s00500-010-0686-8 and PDF File).
  9. M. Mavrovouniotis and S. Yang. A memetic ant colony optimization algorithm for the dynamic traveling salesman problem. Soft Computing, 15(7): 1405-1425, July 2011. Springer (DOI: 10.1007/s00500-010-0680-1 and PDF File).
  10. R. Tinos and S. Yang. Self-adaptation of mutation distribution in evolution strategies for dynamic optimization problems. International Journal of Hybrid Intelligent Systems, 8(3): 155-168, June 2011. IOS Press (DOI: 10.3233/HIS-2011-0136 and PDF File).
  11. I. Comsa, C. Grosan, and S. Yang. A brief analysis of evolutionary algorithms for the dynamic multiobjective subset sum problem. Studia Univ. Babes-Bolyai, Informatica, LVI(2): 88-94, June 2011. Babes-Bolyai University, Romania (PDF File).
  12. H. Cheng and S. Yang. Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods. Applied Soft Computing, 11(2): 1953-1964, March 2011. Elsevier (DOI: 10.1016/j.asoc.2010.06.011, PDF File, and Source Code in C++).
  13. X. Peng, X. Gao, and S. Yang. Environment identification based memory scheme for estimation of distribution algorithms in dynamic environments. Soft Computing, 15(2): 311-326, February 2011. Springer (DOI: 10.1007/s00500-010-0547-5, PDF File, and Source Code in Microsoft Visual C++ 6.0).
  14. S. Yang and S. N. Jat. Genetic algorithms with guided and local search strategies for university course timetabling. IEEE Transactions on Systems, Man, and Cybernetics Part C: Applications and Reviews, 41(1): 93-106, January 2011. IEEE Press (DOI: 10.1109/TSMCC.2010.2049200 and PDF File).
  15. S. Yang and C. Li. A clustering particle swarm optimizer for locating and tracking multiple optima in dynamic environments. IEEE Transactions on Evolutionary Computation, 14(6): 959-974, December 2010. IEEE Press (DOI: 10.1109/TEVC.2010.2046667, PDF File, and Source Code in GNU C++).
  16. L. Liu, S. Yang, and D. Wang. Particle swarm optimization with composite particles in dynamic environments. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 40(6): 1634-1648, December 2010. IEEE Press (DOI: 10.1109/TSMCB.2010.2043527 and PDF File).
  17. H. Wang, S. Yang, W. H. Ip, and D. Wang. A particle swarm optimization based memetic algorithm for dynamic optimization problems. Natural Computing, 9(3): 703-725, September 2010. Springer (DOI: 10.1007/s11047-009-9176-2 and PDF File).
  18. H. Cheng and S. Yang. Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks. Engineering Applications of Artificial Intelligence, 23(5): 806-819, August 2010. Elsevier (DOI: 10.1016/j.engappai.2010.01.021, PDF File, C++ Source Code for the General Dynamics Model, and C++ Source Code for the Worst Dynamics Model).
  19. H. Cheng, X. Wang, S. Yang, M. Huang, and J. Cao. QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms. Journal of Network and Computer Applications, 33(4): 512-522, July 2010. Elsevier (DOI: 10.1016/j.jnca.2010.01.001 and PDF File).
  20. F. Neri and S. Yang. Guest editorial: Memetic computing in the presence of uncertainties. Memetic Computing, 2(2): 85-86, June 2010. Springer (DOI: 10.1007/s12293-010-0033-8 and PDF File).
  21. S. Yang, D. Wang, T. Chai, and G. Kendall. An improved constraint satisfaction adaptive neural network for job-shop scheduling. Journal of Scheduling, 13(1): 17-38, February 2010. Springer (DOI: 10.1007/s10951-009-0106-z and PDF File).
  22. S. Yang, H. Cheng, and F. Wang. Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks. IEEE Transactions on Systems, Man, and Cybernetics Part C: Applications and Reviews, 40(1): 52-63, January 2010. IEEE Press (DOI: 10.1109/TSMCC.2009.2023676, PDF File, and Source Code in C++).
  23. H. Wang, S. Yang, W. H. Ip, and D. Wang. Adaptive primal-dual genetic algorithms in dynamic environments. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 39(6): 1348-1361, December 2009. IEEE Press (DOI: 10.1109/TSMCB.2009.2015281, and PDF File).
  24. H. Richter and S. Yang. Learning behavior in abstract memory schemes for dynamic optimization problems. Soft Computing, 13(12): 1163-1173, October 2009. Springer (DOI: 10.1007/s00500-009-0420-6 and PDF File).
  25. H. Wang, D. Wang, and S. Yang. A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft Computing, 13(8-9): 763-780, July 2009. Springer (DOI: 10.1007/s00500-008-0347-3, PDF File, and Source Code in Java).
  26. H. Cheng, J. Cao, X. Wang, S. K. Das, and S. Yang. Stability-aware multi-metric clustering in mobile ad hoc networks with group mobility. Wireless Communications and Mobile Computing, 9(6): 759-771, June 2009. John Wiley & Sons, Ltd (DOI: 10.1002/wcm.627 and PDF File).
  27. H. Cheng, X. Wang, S. Yang, and M. Huang. A multipopulation parallel genetic simulated annealing based QoS routing and wavelength assignment integration algorithm for multicast in optical networks. Applied Soft Computing, 9(2): 677-684, March 2009. Elsevier (DOI: 10.1016/j.asoc.2008.09.008 and PDF File).
  28. S. Yang and X. Yao. Population-based incremental learning with associative memory for dynamic environments. IEEE Transactions on Evolutionary Computation, 12(5): 542-561, October 2008. IEEE Press (DOI: 10.1109/TEVC.2007.913070, PDF File, and Source Code in GNU C++).
  29. S. Yang. Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evolutionary Computation, 16(3): 385-416, Fall 2008. The MIT Press (DOI: 10.1162/evco.2008.16.3.385, PDF File, and Source Code in GNU C++).
  30. R. Tinos and S. Yang. A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Genetic Programming and Evolvable Machines, 8(3): 255-286, September 2007. Springer (DOI: 10.1007/s10710-007-9024-z and PDF File).
  31. S. Yang and R. Tinos. A hybrid immigrants scheme for genetic algorithms in dynamic environments. International Journal of Automation and Computing, 4(3): 243-254, July 2007. Springer (DOI: 10.1007/s11633-007-0243-9, PDF File, and Source Code in GNU C++).
  32. H. Wang, D. Wang, and S. Yang. Evolutionary algorithms in dynamic environments. Control and Decision, 22(2): 127-131+137, February 2007.
  33. S. Yang, Y.-S. Ong, and Y. Jin. Editorial to special issue on evolutionary computation in dynamic and uncertain environments. Genetic Programming and Evolvable Machines, 7(4): 293-294, December 2006. Springer (DOI: 10.1007/s10710-006-9016-4 and PDF File).
  34. S. Yang and X. Yao. Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Computing, 9(11): 815-834, November 2005. Springer (DOI: 10.1007/s00500-004-0422-3 and PDF File).
  35. S. Yang. Adaptive group mutation for tackling deception in genetic search. WSEAS Transactions on Systems, 3(1): 107-112, January 2004 (PDF File).
  36. S. Yang and D. Wang. A new adaptive neural network and heuristics hybrid approach for job-shop scheduling. Computers and Operations Research, 28(10): 955-971, September 2001. Elsevier Science Ltd (DOI: 10.1016/S0305-0548(00)00018-6 and PDF File).
  37. S. Yang and D. Wang. Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling. IEEE Transactions on Neural Networks, 11(2): 474-486, March 2000. IEEE Press (DOI: 10.1109/72.839016 and PDF File).
  38. S. Yang and D. Wang. A neural network and heuristics hybrid strategy for job-shop scheduling problem. Journal of Systems Engineering, 14(2): 140-144, June 1999 (PDF File).
  39. S. Yang and D. Wang. Using constraint satisfaction adaptive neural network and efficient heuristics for job-shop scheduling. Information and Control, 28(2): 121-126, April 1999 (PDF File).
  40. S. Yang and D. Wang. Genetic algorithm and adaptive neural network hybrid method for job-shop scheduling problems. Control and Decision, 13(Suppl.): 402-407, July 1998 (PDF File).
  41. S. Yang and D. Wang. Solving optimization and scheduling problems with neural network methods. Systems Engineering, 15(Suppl.): 66-71, December 1997 (PDF File).

Book Chapters

  1. H. Richter and S. Yang. Dynamic optimization using analytic and evolutionary approaches: A comparative review. In I. Zelinka et al. (Eds.): Handbook of Optimization, ISRL 38, Chapter 1, pp. 1 - 28, Springer-Verlag Berlin Heidelberg, 2012.
  2. Y. Yan, S. Yang, D. Wang, and D. Wang. Agent based evolutionary dynamic optimization. In R. Sarker and T. Ray (eds.), Agent Based Evolutionary Search, Chapter 5, pp. 97-116, Springer-Verlag Berlin Heidelberg, 2010, (DOI: 10.1007/978-3-642-13425-8_5 and PDF File).
  3. H. Cheng, X. Wang, M. Huang, and S. Yang. A review of personal communications services. In K. Y. Chen and H. K. Lee (Eds.), Mobile Computing Research and Applications, Chapter 8, pp. 149-165, Nova Science Publishers, 3nd Quarter, 2009 (ISBN: 978-1-60741-101-7) (PDF File).
  4. S. Yang. Explicit memory schemes for evolutionary algorithms in dynamic environments. In S. Yang, Y.-S. Ong, and Y. Jin (Eds.), Evolutionary Computation in Dynamic and Uncertain Environments, Chapter 1, pp. 3 - 28, Springer-Verlag Berlin Heidelberg, March 2007 (DOI: 10.1007/978-3-540-49774-5_1 and PDF File).
  5. R. Tinos and S. Yang. Genetic algorithms with self-organizing behaviour in dynamic environments. In S. Yang, Y.-S. Ong, and Y. Jin (Eds.), Evolutionary Computation in Dynamic and Uncertain Environments, Chapter 5, pp. 105 - 127, Springer-Verlag Berlin Heidelberg, March 2007 (DOI: 10.1007/978-3-540-49774-5_5 and PDF File).
  6. S. Yang. Adaptive mutation using statistics mechanism for genetic algorithms. In F. Coenen, A. Preece and A. Macintosh (Eds.), Research and Development in Intelligent Systems XX, pp. 19-32, 2003. London: Springer-Verlag (PDF File).
  7. S. Yang. PDGA: the primal-dual genetic algorithm. In A. Abraham, M. Koppen and K. Franke (Eds.), Design and Application of Hybrid Intelligent Systems, pp. 214-223, 2003. IOS Press (PDF File).
  8. S. Yang. Genetic algorithms based on primal-dual chromosomes for royal road functions. In A. Grmela and N. E. Mastorakis (Eds.), Advances in Intelligent Systems, Fuzzy Systems, Evolutionary Computation, pp. 174-179, 2002. WSEAS Press (PDF File).

Conference Papers

  1. H. Cheng and S. Yang. Hyper-mutation based genetic algorithms for dynamic multicast routing problem in mobile Ad Hoc networks. Proceedings of the 11th IEEE International Conference on Ubiquitous Computing and Communications, 2012. IEEE Press.
  2. C. Li, S. Yang, and M. Yang. Maintaining diversity by clustering in dynamic environments. Proceedings of the 2012 IEEE Congress on Evolutionary Computation, 2012. IEEE Press.
  3. M. Mavrovouniotis and S. Yang. Ant colony optimization with memory-based immigrants for the dynamic vehicle routing problem. Proceedings of the 2012 IEEE Congress on Evolutionary Computation, 2012. IEEE Press.
  4. M. Mavrovouniotis and S. Yang. Ant colony optimization with immigrants schemes for the dynamic vehicle routing problem. EvoApplications 2012: Applications of Evolutionary Computing, LNCS 7248, pp. 519-528, 2012. Springer (DOI: 10.1007/978-3-642-29178-4_52).
  5. A. Vescan, C. Grosan and S. Yang. A hybrid evolutionary multiobjective approach for the dynamic component selection problem. Proceedings of the 11th International Conference on Hybrid Intelligent Systems, pp. 714-721, 2011. IEEE Press (DOI: 10.1109/HIS.2011.6122196).
  6. M. Mavrovouniotis and S. Yang. An immigrants scheme based on environmental information for ant colony optimization for the dynamic travelling salesman problem. Proceedings of the 10th International Conference on Artificial Evolution, LNCS, pp. 23-34, 2011. Springer.
  7. M. Mavrovouniotis and S. Yang. An ant system with direct communication for the capacitated vehicle routing problem. Proceedings of the 2011 UK Workshop on Computational Intelligence, pp. 14-19, 2011.
  8. M. Mavrovouniotis and S. Yang. Memory-based immigrants for ant colony optimization in changing environments. EvoApplications 2011: Applications of Evolutionary Computing, Part I, LNCS 6624, pp. 324-333, 2011. Springer (DOI: 10.1007/978-3-642-20525-5_33).
  9. S. N. Jat and S. Yang. A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem. Proceedings of the 11th European Conference on Evolutionary Computation in Combinatorial Optimisation, LNCS 6622, pp. 1-13, 2011. Springer (DOI: 10.1007/978-3-642-20364-0_1).
  10. H. Cheng and S. Yang. Genetic algorithms with elitism-based immigrants for dynamic load balanced clustering problem in mobile ad hoc networks. Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments, pp. 1-7, 2011. IEEE Press (DOI: 10.1109/CIDUE.2011.5948486 and PDF File).
  11. R. Tinos and S. Yang. Evolution strategies with q-Gaussian mutation for dynamic optimization problems. Proceedings of the 11th Brazilian Symposium on Artificial Neural Network, pp. 223-228, 2010. IEEE Press (DOI: 10.1109/SBRN.2010.46 and PDF File).
  12. M. Mavrovouniotis and S. Yang. Ant colony optimization with direct communication for the traveling salesman problem. Proceedings of the 2010 UK Workshop on Computational Intelligence, 2010. IEEE Press. (DOI: 10.1109/UKCI.2010.5625608 and PDF File).
  13. R. Tinos and S. Yang. An analysis of the XOR dynamic problem generator based on the dynamical system. Proceedings of the 11th International Conference on Parallel Problems Solving from Nature (PPSN XI), Part I, LNCS 6238, pp. 274-283. 2010. Springer, Heidelberg (DOI: 10.1007/978-3-642-15844-5_28 and PDF File).
  14. M. Mavrovouniotis and S. Yang. Ant colony optimization with immigrants schemes in dynamic environments. Proceedings of the 11th International Conference on Parallel Problems Solving from Nature (PPSN XI), Part II, LNCS 6239, pp. 371-380. 2010. Springer, Heidelberg (DOI: 10.1007/978-3-642-15871-1_38 and PDF File).
  15. C. Li and S. Yang. Adaptive learning particle swarm optimizer--II for global optimization. Proceedings of the 2010 IEEE Congress on Evolutionary Computation, pp. 779-786, 2010. IEEE Press (DOI: 10.1109/CEC.2010.5586230 and PDF File).
  16. S. Arshad and S. Yang. A hybrid genetic algorithm and inver over approach for the travelling salesman problem. Proceedings of the 2010 IEEE Congress on Evolutionary Computation, pp. 252-259, 2010. IEEE Press (DOI: 10.1109/CEC.2010.5586216 and PDF File).
  17. I. Korejo, S. Yang, and C. Li. A directed mutation operator for real coded genetic algorithms. EvoApplications 2010: Applications of Evolutionary Computing, Part I, LNCS 6024, pp. 491-500, 2010. Springer (DOI: 10.1007/978-3-642-12239-2_51 and PDF File).
  18. H. Cheng and S. Yang. Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks. EvoApplications 2010: Applications of Evolutionary Computing, Part I, LNCS 6024, pp. 562-571, 2010. Springer (DOI: 10.1007/978-3-642-12239-2_58 and PDF File).
  19. I. Korejo, S. Yang, and C. Li. A comparative study of adaptive mutation operators for metaheuristics. Proceedings of the 8th Metaheuristic International Conference, 2009.
  20. S. N. Jat and S. Yang. A guided search genetic algorithm for the university course timetabling problem. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), pp. 180-191, 2009 (PDF File).
  21. S. Arshad, S. Yang, and C. Li. A sequence based genetic algorithm with local search for the travelling salesman problem. Proceedings of the 2009 UK Workshop on Computational Intelligence, pp. 98-105, 2009.
  22. H. Cheng and S. Yang. Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search. Proceedings of the 5th International Conference on Natural Computation, vol. 4, pp. 325-330, 2009. IEEE Press (DOI: 10.1109/ICNC.2009.435).
  23. C. Li and S. Yang. An adaptive learning particle swarm optimizer for function optimization. Proceedings of the 2009 IEEE Congress on Evolutionary Computation, pp. 381-388, 2009. IEEE Press (DOI: 10.1109/CEC.2009.4982972 and PDF File).
  24. C. Li and S. Yang. A clustering particle swarm optimizer for dynamic optimization. Proceedings of the 2009 IEEE Congress on Evolutionary Computation, pp. 439-446, 2009. IEEE Press (DOI: 10.1109/CEC.2009.4982979 and PDF File).
  25. S. Yang and H. Richter. Hyper-learning for population-based incremental learning in dynamic environments. Proceedings of the 2009 IEEE Congress on Evolutionary Computation, pp. 682-689, 2009. IEEE Press (DOI: 10.1109/CEC.2009.4983011 and PDF File).
  26. H. Cheng and S. Yang. Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks. Proceedings of the 2009 IEEE Congress on Evolutionary Computation, pp. 3135-3140, 2009. IEEE Press (DOI: 10.1109/CEC.2009.4983340 and PDF File).
  27. L. Liu, D. Wang, and S. Yang. An immune system based genetic algorithm using permutation-based dualism for dynamic traveling salesman problems. EvoWorkshops 2009: Applications of Evolutionary Computing, LNCS 5484, pp. 725-734, 2009. Springer (DOI: 10.1007/978-3-642-01129-0_82 and PDF File).
  28. C. Li and S. Yang. An island based hybrid evolutionary algorithm for optimization. Proceedings of the 7th International Conference on Simulated Evolution and Learning, LNCS 5361, pp. 180-189, 2008. Springer (DOI: 10.1007/978-3-540-89694-4_19 and PDF File).
  29. H. Cheng and S. Yang. Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using simulated annealing. Proceedings of the 7th International Conference on Simulated Evolution and Learning, LNCS 5361, pp. 370-380, 2008. Springer (DOI: 10.1007/978-3-540-89694-4_38 and PDF File).
  30. C. Li and S. Yang. A generalized approach to construct benchmark problems for dynamic optimization. Proceedings of the 7th International Conference on Simulated Evolution and Learning, LNCS 5361, pp. 391-400, 2008. Springer (DOI: 10.1007/978-3-540-89694-4_40 and PDF File).
  31. S. N. Jat and S. Yang. A memetic algorithm for the university course timetabling problem. Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence, vol. 1, pp. 427-433, 2008. IEEE Press (DOI: 10.1109/ICTAI.2008.126 and PDF File).
  32. H. Cheng, X. Wang, M. Huang, and S. Yang. A review of personal communications services. Proceedings of the 9th International Conference for Young Computer Scientists, pp. 616-621, 2008. IEEE Press (DOI: 10.1109/ICYCS.2008.191).
  33. H. Richter and S. Yang. Learning in abstract memory schemes for dynamic optimization. Proceedings of the 4th International Conference on Natural Computation, vol. 1, pp. 86-91, 2008. IEEE Press (DOI: 10.1109/ICNC.2008.110).
  34. C. Li and S. Yang. Fast multi-swarm optimization for dynamic optimization problems. Proceedings of the 4th International Conference on Natural Computation, vol. 7, pp. 624-628, 2008. IEEE Press (DOI: 10.1109/ICNC.2008.313 and PDF File).
  35. C. Ji, Y. Zhang, M. Tong, and S. Yang. Particle filter with swarm move for optimization. Proceedings of the 10th International Conference on Parallel Problem Solving from Nature, LNCS 5199, pp. 909-918, 2008. Springer (DOI: 10.1007/978-3-540-87700-4_90 and PDF File).
  36. H. Cheng and S. Yang. A genetic-inspired joint multicast routing and channel assignment algorithm in wireless mesh networks. Proceedings of the 2008 UK Workshop on Computational Intelligence, pp. 159-164, 2008 (PDF File).
  37. C. Li, S. Yang, and I. Korejo. An adaptive mutation operator for particle swarm optimization. Proceedings of the 2008 UK Workshop on Computational Intelligence, pp. 165-170, 2008 (PDF File).
  38. R. Tinos and S. Yang. Evolutionary programming with q-Gaussian mutation for dynamic pptimization problems. Proceedings of the 2008 IEEE Congress on Evolutionary Computation, pp. 1823-1830, 2008. IEEE Press (DOI: 10.1109/CEC.2008.4631036 and PDF File).
  39. Y. Yan, H. Wang, D. Wang, S. Yang, and D. Z. Wang. A multi-agent based evolutionary algorithm in non-stationary environments. Proceedings of the 2008 IEEE Congress on Evolutionary Computation, pp. 2967-2974, 2008. IEEE Press (DOI: 10.1109/CEC.2008.4631198 and PDF File).
  40. S. Yang and R. Tinos. Hyper-selection in dynamic environments. Proceedings of the 2008 IEEE Congress on Evolutionary Computation, pp. 3185-3192, 2008. IEEE Press (DOI: 10.1109/CEC.2008.4631229 and PDF File).
  41. H. Richter and S. Yang. Memory based on abstraction for dynamic fitness functions. In EvoWorkshops 2008: Applications of Evolutionary Computing, LNCS 4974 , pp. 597-606, 2008. Berlin: Springer-Verlag (DOI: 10.1007/978-3-540-78761-7_65 and PDF File).
  42. L. Liu, D. Wang, and S. Yang. Compound particle swarm optimization in dynamic environments. In EvoWorkshops 2008: Applications of Evolutionary Computing, LNCS 4974, pp. 617-626, 2008. Berlin: Springer-Verlag (DOI: 10.1007/978-3-540-78761-7_67 and PDF File).
  43. R. Tinos and S. Yang. Self-adaptation of mutation distribution in evolutionary algorithms. Proceedings of the 2007 IEEE Congress on Evolutionary Computation, pp. 79-86, 2007. IEEE Press (DOI: 10.1109/CEC.2007.4424457 and PDF File).
  44. R. Tinos and S. Yang. Continuous dynamic problem generators for evolutionary algorithms. Proceedings of the 2007 IEEE Congress on Evolutionary Computation, pp. 236-243, 2007. IEEE Press (DOI: 10.1109/CEC.2007.4424477 and PDF File).
  45. S. Yang. Learning the dominance in diploid genetic algorithms for changing optimization problems. Proceedings of the 2nd International Symposium on Intelligence Computation and Applications, pp. 157-162, 2007. China University of GeoSciences Press.
  46. S. Yang. Genetic algorithms with elitism-based immigrants for chaning optimization problems. EvoWorkshops 2007: Applications of Evolutionary Computing, LNCS 4448, pp. 627-636, 2007. Berlin: Springer-Verlag (DOI: 10.1007/978-3-540-71805-5_69 and PDF File).
  47. H. Wang, D. Wang, and S. Yang. Triggered memory-based swarm optimization in dynamic environments. EvoWorkshops 2007: Applications of Evolutionary Computing, LNCS 4448, pp. 637-646, 2007. Berlin: Springer-Verlag (DOI: 10.1007/978-3-540-71805-5_70 and PDF File).
  48. S. Yang. On the design of diploid genetic algorithms for problem optimization in dynamic environments. Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pp. 1362-1369, 2006. IEEE Press (DOI: 10.1109/CEC.2006.1688467 and PDF File).
  49. S. Yang. Job-shop scheduling with an adaptive neural network and local search hybrid approach. Proceedings of the 2006 IEEE Int. Joint Conf. on Neural Networks, pp. 2720-2727, 2006. IEEE Press (PDF File).
  50. S. Yang. A comparative study of immune system based genetic algorithms in dynamic environments. GECCO'06: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1377-1384, 2006. ACM Press (DOI: 10.1145/1143997.1144209 and PDF File).
  51. S. Yang. Dominance learning in diploid genetic algorithms for dynamic optimization problems. GECCO'06: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1435-1436, 2006. ACM Press (DOI: 10.1145/1143997.1144232 and PDF File).
  52. S. Yang. Associative memory scheme for genetic algorithms in dynamic environments. EvoWorkshops 2006: Applications of Evolutionary Computing, LNCS 3907, pp. 788-799, 2006. Berlin: Springer-Verlag (DOI: 10.1007/11732242_76 and PDF File).
  53. S. Yang and S. Uyar. Adaptive mutation with fitness and allele distribution correlation for genetic algorithms. Proceedings of the 21st ACM Symposium on Applied Computing (SAC'06), pp. 940-944, 2006. ACM Press (DOI: 10.1145/1141277.1141499 and PDF File).
  54. S. Yang. An improved adaptive neural network for job-shop scheduling. Proceedings of the 2005 IEEE International Conference on Systems, Man and Cybernatics, Vol. 2, pp. 1200-1205, 2005. IEEE Press (DOI: 10.1109/ICSMC.2005.1571309 and PDF File).
  55. S. Yang. Memory-enhanced univariate marginal distribution algorithms for dynamic optimization problems. Proceedings of the 2005 IEEE Congress on Evolutionary Computation, Vol. 3, pp. 2560-2567, 2005. IEEE Press (DOI: 10.1109/CEC.2005.1555015 and PDF File).
  56. R. Tinos and S. Yang. Genetic algorithms with self-organized criticality for dynamic optimization problems. Proceedings of the 2005 IEEE Congress on Evolutionary Computation, Vol. 3, pp. 2816-2823, 2005. IEEE Press (DOI: 10.1109/CEC.2005.1555048 and PDF File).
  57. S. Yang. Population-based incremental learning with memory scheme for changing environments. Proceedings of the 2005 Genetic and Evolutionary Computation Conference, Vol. 1, pp. 711-718, 2005. ACM Press (DOI: 10.1145/1068009.1068128 and PDF File).
  58. S. Yang. Memory-based immigrants for genetic algorithms in dynamic environments. Proceedings of the 2005 Genetic and Evolutionary Computation Conference, Vol. 2, pp. 1115-1122, 2005. ACM Press (DOI: 10.1145/1068009.1068196 and PDF File). This paper was nominated to the best paper award for GECCO-2005.
  59. S. Yang and J. Branke. Evolutionary algorithms for dynamic optimization problems: workshop preface. Proceedings of the 2005 Workshops on Genetic and Evolutionary Computation, pp. 23-24, 2005. ACM Press (DOI: 10.1145/1102256.1102261 and PDF File).
  60. S. Yang. Constructing dynamic test environments for genetic algorithms based on problem difficulty. Proceedings of the 2004 IEEE Congress on Evolutionary Computation, Vol. 2, pp. 1262-1269, 2004. IEEE Press (DOI: 10.1109/CEC.2004.1331042 and PDF File).
  61. S. Yang. Non-stationary problem optimization using the primal-dual genetic algorithm. In R. Sarker, R. Reynolds, H. Abbass, K.-C. Tan, R. McKay, D. Essam and T. Gedeon (editors), Proceedings of the 2003 IEEE Congress on Evolutionary Computation, Vol. 3, pp. 2246-2253, 2003. IEEE Press (DOI: 10.1109/CEC.2003.1299951 and PDF File).
  62. S. Yang and X. Yao. Dual population-based incremental learning for problem optimization in dynamic environments. In M. Gen et. al. (editors), Proceedings of the 7th Asia Pacific Symposium on Intelligent and Evolutionary Systems, pp. 49-56, 2003 (PDF File).
  63. S. Yang. Statistics-based adaptive non-uniform mutation for genetic algorithms. In E. Cantu-Paz, J.A. Foster, K. Deb, L. D. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta. M. A. Potter, A. C. Schultz, K. A. Dowsland, N. Jonoska, and J. Miller (editors), Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 2003, LNCS 2724, pp. 1618-1619, 2003. Springer (DOI: 10.1007/3-540-45110-2_53).
  64. S. Yang. Adaptive non-uniform crossover based on statistics for genetic algorithms. In W. B. Langdon, E. Cantu-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska (editors), Proceedings of the 2002 Genetic and Evolutionary Computation Conference, pp. 650-657, 2002. San Francisco, CA: Morgan Kaufmann Publishers (PDF File).
  65. S. Yang. Primal-dual genetic algorithms for royal road functions. In E. F. Camacho, L. Basanez, J. A. de la Puente (editors), Proceedings of the 15th IFAC World Congress, Vol. I: Fuzzy, Neural and Genetic Systems, pp. 373-378, Barcelona, Spain, 21-26 July 2002. Elsevier Science Ltd.
  66. S. Yang. Statistics-based adaptive non-uniform crossover for genetic algorithms, In J. A. Bullinaria (editor), Proceedings of the 2002 U.K. Workshop on Computational Intelligence (UKCI'02), pp. 201-208, 2002.
  67. S. Yang. Adaptive non-uniform mutation based on statistics for genetic algorithms. In Erick Cantu-Paz (editor), Late-Breaking Papers at the 2002 Genetic and Evolutionary Computation Conference, pp. 490-495, 2002. Menlo Park, CA: AAAI Press.
  68. S. Yang. Adaptive crossover in genetic algorithms using statistics mechanism. In R. Standish, M. Bedau and H. Abbass (editors), Proceedings of the 8th Int. Conf. on Artificial Life (ALife VIII), pp. 182-185, 2002. MIT Press.
  69. T. Radzik and S. Yang. Experimantal evaluation of algorithmic solutions for generalized network flow models. Presented in the 17th International Symposium on Mathematical Programming (ISMP'00), August 2000.
  70. S. Yang and D. Wang. Constraint satisfaction adaptive neural network and efficient heuristics for job-shop scheduling. In H. F. Chen, X. R. Cao, G. Picci and K. J. Hunt (editors), Proceedings of the 14th IFAC World Congress, Vol. J: Discrete Event Systems, Stochastic Systems, Fuzzy and Neural Systems I, pp. 175-180, 1999. Elsevier Science Ltd.
  71. K. Zhao, S. Yang and D. Wang. Genetic algorithm and neural network hybrid approach for job-shop scheduling. In M. H. Hamza (editor), Proceedings of the IASTED Int. Conf. on Applied Modelling and Simulation (AMS'98), pp. 110-114, 1998. Calgary, Alberta, Canada: ACTA Press.

Other Workshop Publications

  1. S. Yang and J. Branke (editors), Proceedings of the 4th Workshop on Evolutionary Algorithms for Dynamic Optimization Problem, 2005.

PhD Thesis

  1. S. Yang. Constraint Satisfaction Adaptive Neural Network and its Applications for Job-Shop Scheduling Problems. PhD Thesis, Northeastern University, P. R. China, March 1999.

Technical Reports

  1. C. Li, S. Yang, and D. A. Pelta. Benchmark Generator for the IEEE WCCI-2012 Competition on Evolutionary Computation for Dynamic Optimization Problems. Technical Report 2011, Department of Information Systems and Computing, Brunel University, U.K., October 2011 (PDF File).
  2. C. Li, S. Yang, T. T. Nguyen, E. L. Yu, X. Yao, Y. Jin, H.-G. Beyer, and P. N. Suganthan. Benchmark generator for CEC 2009 competition on dynamic optimization. Technical Report 2008, Department of Computer Science, University of Leicester, U.K., October 2008 (PDF File).
  3. S. Yang. A new genetic algorithm based on primal-dual chromosomes for royal road functions. Technical Report No. 2001/45, Department of Computer Science, University of Leicester, U.K., 2001.
  4. T. Radzik and S. Yang. Experimental evaluation of algorithmic solutions for the maximum generalised network flow problem. Technical Report No. 2001/54, Department of Computer Science, University of Leicester, U.K., 2001. It is also available as Technical Report No. TR-01-09, Department of Computer Science, King's College London, U.K., 2001.
Last modified: . Any opinions expressed on this page are those of the author.