Journal of Northeastern University ›› 2010, Vol. 31 ›› Issue (1): 20-22+27.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Comparison among three algorithms to solve unconstrained MLLS problems

Han, Yi (1); Tang, Jia-Fu (1); Cai, Jian-Hu (2); Zhou, Gen-Gui (2)   

  1. (1) Key Laboratory of Integrated Automation of Process Industry, Northeastern University, Shenyang 110004, China; (2) College of Business Administration, Zhejiang University of Technology, Hangzhou 310023, China
  • Received:2013-06-20 Revised:2013-06-20 Online:2010-01-15 Published:2013-06-20
  • Contact: Zhou, G.-G.
  • About author:-
  • Supported by:
    -

Abstract: To solve the unconstrained multilevel lot-sizing (UMLLS) problems, the harmonious particle swarm optimization (HPSO) algorithm, hybrid scatter search(HSS) algorithm and genetic algorithm integrated with repulsion operator (RGA) have been proposed. To study their suitability, a performance comparison among them was carried out systematically via a comprehensive test introducing the standard testing data sets, then the alternative of those algorithms can be decided for UMLLS problems with different sizes. The test results showed that HSS is more powerful for small/medium-sized problems and HPSO is superior to the other two algorithms in large-sized problems.

CLC Number: