Implemental techniques and their effectives for evolutionary algorithms used to solve multilevel lot sizing problems

  • Ikou Kaku*
  • , Yiyong Xiao
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Multilevel lot siZing (MLLS) problem is a combinational optimization problem which has been proved NP-hard without restrictive assumption on the product structure. Several evolutionary algorithms were developed to solve the MLLS problem in literature, such as genetic algorithm, simulated annealing, swarm particle optimization, soft optimization based on segmentation, ant colony optimization, variable neighbourhood search and so on. In this paper we investigate implemental techniques and their effectives for those evolutionary algorithms used to solve the MLLS problem. Obtained results can be used to specify the characteristics of the solution of the MLLS problems and to help developing more efficient evolutionary algorithms.

Original languageEnglish
Title of host publicationProceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing
Subtitle of host publicationTheories and Applications, BIC-TA 2010
Pages303-309
Number of pages7
DOIs
StatePublished - 2010
Event2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010 - Changsha, China
Duration: 23 Sep 201026 Sep 2010

Publication series

NameProceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

Conference

Conference2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010
Country/TerritoryChina
CityChangsha
Period23/09/1026/09/10

Fingerprint

Dive into the research topics of 'Implemental techniques and their effectives for evolutionary algorithms used to solve multilevel lot sizing problems'. Together they form a unique fingerprint.

Cite this