Mathematics

Profile

Xiang Song has been working on cutting and packing problems since 2001 and has extensively used mathematical programming and meta-heuristics techniques. She has published 10 articles in peer-reviewed journals, which include a significant number of 3* journals (EJOR, Computers & Operations Research, Journal of Heuristics). She is the author (With Prof. Nie) of the book Integer Programming (Nie, Gui and Xiang, 2001) published in China. Besides cutting and packing problem, her main research interests are transportation, service network design, scheudling, stochastic programming etc.



Publications

(1)   R. Lewis, X. Song, K. Dowsland and J. Thompson (2011),An investigation into two bin packing problems with ordering and orientation implications, European Journal of Operational Research. Available online, 2011.

(2)   X. Song, C. B. Chu, R. Lewis, Y. Y. Nie and J. Thompson (2009), “Worst case analysis of a dynamic-programming based heuristic algorithm for 2D unconstrained guillotine cutting”, European Journal of Operational Research. Available online, June 2009.

(3)   J. Bennell and X. Song (2010). “A beam search implementation for nesting problems”, Journal of Heuristics, 16: 167-188..

(4)   J.Bennell and X.Song (2008), “A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums”, Computers & Operations Research, Vol. 35, No. 1, ISSN 0305-0548.

(5)   X. Song, C. B. Chu, Y. Y. Nie and J. Bennelle (2006), “An iterated SHP algorithm to a real-life 1.5 Dimensional Cutting Stock Problem”, European Journal of Operational Research, vol. 175, pp 1870-1889.

(6)   X. Song, Y. Y. Nie, C. B. Chu (2004), "Hill climbing algorithm for unconstraint  knapsack problem", Mini-Micro Systems (Chinese), Vol.25(7), pp 1352-1355.

(7)   X. Song and Y. Y. Nie (2003), “Improved dynamic programming algorithm for unconstrained two-dimentional cutting stock problem”, Information and Control (Chinese), Vol. 32(1), pp 14-19.

(8)   Y. Y. Nie, X. Song and G. Gui (2002), “Incompletely enumerative solution for 1D cutting-stock problem”, Far East J.MathSci (FJMS), Vol. 5(1), pp 25-46.

(9)   Y. Y. Nie, J. Yu, X. Song (2004), "Incompletely enumerative solution for 1D cutting-stock problem II", Far East J. Math. Sci. (FJMS), Vol.12(1), pp 53-64.

(10) Y. Y. Nie, G. Gui, X. Song (2001), “Integer Programming”, North Eastern University Press, October. (Chinese)

Prizes, awards, grants and research resources sought and won (including dates and values)

1. The proposal LPTS-0001: "Building Up an Algebraic System for Irregular Shape Bin Packing" has been accepted and has been    funded £3944.