APPLYING SUB-POPULATION MEMETIC ALGORITHM FOR MULTI-OBJECTIVE SCHEDULING PROBLEMS

Yen-Wen Wang, Chin-Yuan Fan, Chen-Hao Liu

Abstract

Memetic Algorithm is a population-based approach for heuristic search in optimization problems. It has shown that this mechanic performs better than traditional Genetic Algorithms for some problem. In order to apply in the multi-objective problem, the basic local search heuristics are combined with crossover operator in the sub-population in this research. This approach proposed is named as Sub-population with Memetic Algorithm, which is applied to deal with multi-objective Flowshop Scheduling Problems. Besides, the Artificial Chromosome with probability matrix will be introduced when the algorithm evolves to certain iteration for injecting to individual to search better combination of chromosomes, this mechanism will make faster convergent time for evolving. Compares with other three algorithms which are MGISPGA, NSGA-II and SPEA2, the experiments result show that this algorithm possess fast convergence and average scatter of Pareto solutions simultaneously for solving multi-objective Flowshop Scheduling Problems in test instances.

References

  1. Chang, P. C., Chen, S. H., and Lin, K. L., 2005, Two phase subpopulation genetic algorithm for parallel machine scheduling problem, Expert Systems with Applications, 29(3), 705-712.
  2. Harik, G.R., Lobo, F.G., and Goldberg, D.E., 1999, The compact genetic algorithm, IEEE Transactions of Evolution Computing, 3 (4), 287-297.
  3. Ishibuchi, H., Yoshida, T. and Murata, T., 2003, Balance between Genetic Search and Local Search in Memetic Algorithms for Multi-objective Permutation Flowshop Scheduling, IEEE Trans on Evolutionary Computation, 7(2), 204-223.
  4. Larranaga, P., and Lozano, J.A., 2001, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer, Norwell.
  5. Lozano, J.A., Larranaga, P., Inza, I., and Bengoetxea, E., 2006, Towards a New Evolutionary Computation, Springer.
  6. Pelikan, M., Goldberg, D.E., and Lobo, F.G., 2002, A survey of optimization by building and using probabilistic models, Computational Optimization and Applications, 21 (1), 5-20.
  7. Rastegar, R., and Hariri, A., 2006, A step forward in studying the compact genetic algorithm, IEEE Transactions of Evolution Computing, 14 (3), 277- 289.
  8. Zhang, Q., Sun, J., and Tsang, E., 2005, An evolutionary algorithm with guided mutation for the maximum clique problem, Evolutionary of Computing, 9 (2), 192 -200.
Download


Paper Citation


in Harvard Style

Wang Y., Fan C. and Liu C. (2009). APPLYING SUB-POPULATION MEMETIC ALGORITHM FOR MULTI-OBJECTIVE SCHEDULING PROBLEMS . In Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO, ISBN 978-989-8111-99-9, pages 376-379. DOI: 10.5220/0002208603760379


in Bibtex Style

@conference{icinco09,
author={Yen-Wen Wang and Chin-Yuan Fan and Chen-Hao Liu},
title={APPLYING SUB-POPULATION MEMETIC ALGORITHM FOR MULTI-OBJECTIVE SCHEDULING PROBLEMS},
booktitle={Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,},
year={2009},
pages={376-379},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002208603760379},
isbn={978-989-8111-99-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,
TI - APPLYING SUB-POPULATION MEMETIC ALGORITHM FOR MULTI-OBJECTIVE SCHEDULING PROBLEMS
SN - 978-989-8111-99-9
AU - Wang Y.
AU - Fan C.
AU - Liu C.
PY - 2009
SP - 376
EP - 379
DO - 10.5220/0002208603760379