THE METHODOLOGY OF PARALLEL MEMETIC ALGORITHMS DESIGNING

Wojciech Bożejko, Mieczyslaw Wodecki

Abstract

The paper presents the methodology of parallel algorithm designing based on the memetic approach (Lamarck and Baldwin evolution theory) making use of specific properties of the problem and distributed island model. This approach is presented on the example of the single machine scheduling problem with earliness/tardiness penalties.

References

  1. Baker, K. and Scudder, G. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38:22-36.
  2. Berger, J. and Barkaoui, M. (2002). A memetic algorithm for the vehicle routing problem with time windows. In Proceedings of the 7th International Command and Control Research and Technology Symposium, http://www.dodccrp.org/events/7th ICCRTS/Tracks/ pdf/035.pdf.
  3. Boz?ejko, W. (2010). Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. Journal of Intelligent Manufacturing, in press, doi: 10.1007/s10845- 009-0253-2.
  4. Boz?ejko, W., Grabowski, J., and Wodecki, M. (2006). Block approach tabu search algorithm for single machine total weighted tardiness problem. Computers & Industrial Engineering, 50:1-14.
  5. Boz?ejko, W. and Wodecki, M. (2005). Task realiation's optimization with earliness and tardiness penalties in distributed computation systems. volume 2528 of Lecture Notes in Artificial Intelligence, pages 69-75. Springer.
  6. Boz?ejko, W. and Wodecki, M. (2006). A new inter-island genetic operator for optimization problems with block properties. volume 4029 of Lecture Notes in Artificial Intelligence, pages 324-333. Springer.
  7. Bradwell, R. and Brown, K. (1999). Parallel asynchronous memetic algorithms. In Cantu-Paz, E. and Punch, B., editors, Evolutionary Computation, pages 157-159.
  8. Bubak, M. and Sowa, K. (1999). Objectoriented implementation of parallel genetic algorithms. In Buyya, R., editor, High Performance Cluster Computing: Programming and Applications, volume 2, pages 331- 349. Prentice Hall.
  9. Crainic, T. and Toulouse, M. (1998). Parallel metaheuristics. In Crainic, T. and Laporte, G., editors, Fleet management and logistics, pages 205-251. Kluwer.
  10. Crainic, T., Toulouse, M., and Gendreau, M. (1995). Parallel asynchronous tabu search in multicommodity locationallocation with balancing requirements. Annals of Operations Research, 63:277-299.
  11. Hoogeveen, J. and van de Velde, S. (1996). A branch and bound algorithm for single-machine earlinesstardiness scheduling with idle time. INFORMS Journal on Computing, 8:402-412.
  12. Kliewer, G., Klohs, K., and Tschoke, S. (1999). Parallel simulated annealing library: User manual. Technical report, Computer Science Department, University of Paderborn.
  13. Lenstra, J., Kan, A. R., and Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343-362.
  14. Michalewicz, Z. (1994). Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag.
  15. Reeves, C. and Yamada, T. (1998). Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation, 6:45-60.
  16. Smith, W. (1956). Various optimizers for single-stage production. Naval Research Logistic Quart, 3:59-66.
  17. Taillard, E. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17:443- 455.
  18. Taillard, E. (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6:108-117.
  19. Tang, J., Lim, M., and Ong, Y. (2006). Adaptation for parallel memetic algorithm based on population entropy. In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation (Seattle, Washington, USA, July 08 - 12, 2006), GECCO 7806, pages 575- 582. ACM.
Download


Paper Citation


in Harvard Style

Bożejko W. and Wodecki M. (2011). THE METHODOLOGY OF PARALLEL MEMETIC ALGORITHMS DESIGNING . In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-40-9, pages 643-648. DOI: 10.5220/0003186006430648


in Bibtex Style

@conference{icaart11,
author={Wojciech Bożejko and Mieczyslaw Wodecki},
title={THE METHODOLOGY OF PARALLEL MEMETIC ALGORITHMS DESIGNING},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2011},
pages={643-648},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003186006430648},
isbn={978-989-8425-40-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - THE METHODOLOGY OF PARALLEL MEMETIC ALGORITHMS DESIGNING
SN - 978-989-8425-40-9
AU - Bożejko W.
AU - Wodecki M.
PY - 2011
SP - 643
EP - 648
DO - 10.5220/0003186006430648