Xin Yao's Research Interests: Combinatorial Optimisation

I am interested in solving practical combinatorial optimisation problems using evolutionary algorithms, simulated annealing and hybrid algorithms. A current research interest is to incorporate local search into evolutionary algorithms and analyse such hybrid algorithms in terms of landscape transformation. I believe that a complex problem can be solved in two ways: one is to develop a sophisticated algorithm, and the other is to transform the problem into an easy one and then solve it. While there has been a lot of work on the former, work on the latter has been relatively little. I am keen to explore more of the latter.

Selected Papers

  1. K.-H. Liang, X. Yao, C. S. Newton and D. Hoffman, ``A New Evolutionary Approach to Cutting Stock Problems With and Without Contiguity,'' Computers and Operations Research, 29(12):1641-1659, Oct. 2002.
    Available as a gzipped ps file.

  2. C. Zhang, X. Yao and J. Yang, ``An Evolutionary Approach to Materialized Views Selection in a Data Warehouse Environment,'' IEEE Transactions on Systems, Man and Cybernetics, Part C, 31(3):282-294, August 2001.
    Available as a gzipped ps file.

  3. C. Zhang, X. Yao and J. Yang, ``Evolving materialized views in data warehousing,'' Proc. of the 1999 Congress on Evolutionary Computation, Vol. 2, IEEE Press, Piscataway, NJ, USA, pp.823-829, July 1999.
    Available as zhang_yao_yang_cec99.ps.gz.

  4. K.-H. Liang, X. Yao, C. Newton and D. Hoffman, ``Solving cutting stock problems by evolutionary programming,'' Evolutionary Programming VII: Proc. of the Seventh Annual Conference on Evolutionary Programming (EP98), Lecture Notes in Computer Science, Vol. 1447, V. W. Porto, N. Saravanan, D. Waagen and A. E. Eiben (ed.), Springer-Verlag, Berlin, pp.291-300, 1998.
    Available as ep98_csp.ps.gz.

  5. J. Leeming and X. Yao, ``Terrain traversal by genetic algorithms,'' Australian Journal of Intelligent Information Processing Systems, 4(3/4):258-266, 1997.

  6. F. Luan and X. Yao, ``Solving real-world lecture room assignment problems by genetic algorithms,'' Complexity International: An Electronic Journal of Complex Systems Research (ISSN 1320-0682), Vol. 3, July 1996.
    Also appeared in paper form in Complex Systems --- From Local Interactions to Global Phenomena, IOS Press, Amsterdam, pp.148--160, 1996.

  7. X. Yao, ``Call routing by simulated annealing,'' International Journal of Electronics, 79(4):379-387, 1995.
    Available as ije.ps.Z.

Last update: 5 September 2000