Solving a dynamic cell formation problem with machine cost and alternative process plan by memetic algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3777 LNCS, Issue , 2005, Pages 213-227

  Tavakkoli Moghaddam, Reza ^a   Safaei, Nima ^b   Babakhani, Masoud ^b  

^a UNIVERSITY OF TEHRAN   (Iran)

^b IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Alternative process plan; Dynamic cell formation; Machine relocation; Memetic algorithm

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; COSTS; SEARCH ENGINES; SIMULATED ANNEALING; STRATEGIC PLANNING;

ALTERNATIVE PROCESS PLAN; CELL FORMATION PROBLEM (CFP); DYNAMIC CELL FORMATION; MACHINE AMORTIZATION; MACHINE RELOCATION; MEMETIC ALGORITHM (MA); RELOCATION COSTS;

PROBLEM SOLVING;

EID: 33646749725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11571155_18     Document Type: Conference Paper

References (34)

1. Wemmerlov, U. Hyer, N.: Cellular manufacturing in the US industry: A survey of users. Int. J. of Production research, 27 (1989) 1511-1530.
2. Schaller, J.E., Erenguc, S.S., Vakharia, A.J.: A mathematical approach for integrating the cell design and production planning decision. Int. J. of Production Research, 38 (2000) 3953-3971.
3. Chen, M: A model for integrated production planning in cellular manufacturing systems. Integrated Manufacturing Systems, 12 (2001) 275-84.
4. Foulds, L.R., Neumann, K.: Techniques for machine group formation in manufacturing cells. Mathematical and Computer Modeling, 38 (2003) 623-635.
5. Shafer, S., Rogers, D.: A goal programming approach to the cell formation problem. J. of Operations Management, 10 (1991): 28-43.
6. Wilhelm, W., Chou, C., Chang, D.: Integrating design and planning considerations in cell formation. Annals of Operations Research, 77 (1998) 97-107.
7. Chen, M.: A mathematical programming model for systems reconfiguration in a dynamic cell formation condition, Annals of Operations Research, 77 (1998) 109-128.
8. Monteruiln, B., Laforge, A.: Dynamic layout design given a scenario tree of probable future. Eur. J. of Operational Research, 63 (1992) 271-286.
9. Rogers, G., Bottaci, L.: Modular production systems: A new manufacturing paradigm. J. of Intelligent Manufacturing, 8 (1997) 147-156.
10. Black, J.T.: The design of the factory with a future. McGraw-Hill, New York (1991).
11. A. Baykasogylu and N. Gindy. A simulated annealing algorithm for dynamic layout problem, Computers and Operation Research, 28 (2001) 1403-1426.
12. Lacksonen, T.A.: Static and dynamic layout problems with varying areas. J. of Operational Research Society, 45 (1994) 59-69.
13. Lacksonen, T.A.: Preprocessing for static and dynamic layout problems. Int. J. of Production Research, 35 (1997) 1095-1106.
14. Song, S., Hitomi, K.: Integrating the production planning and cellular layout for flexible cellular manufacturing. Int. J. of Production Planning and Control. 7 (1996) 585-593.
15. Harhalaks, G., Nagi, R., Proth, J.: An effective heuristic in manufacturing cell formation for group technology applications. Int. J. of Production Research. 28 (1990) 185-198.
16. Caux, C., Bruniaux, R., Pierreval, H.: Manufacturing cell formation with alternative process plans and machine capacity constraints: a new combined approach. Int. J. of Production Economics. 64 (2000) 279-84.
17. Kollen, A., Pesch, E.: Genetic local search in combinatorial optimization. Discrete Applied Mathematics and Combinatorial Operation Research and Computer Science 48 (1994) 273- 284.
18. Merz, P., Freisieben, B.: Fitness landscapes and memetic algorithm design, in: Corne, D., Dorigo, M., Glover, F. (Eds.), New ideas in optimization, McGraw-Hill, London (1999).
19. Moscato, P., Cotta, C.: A gentle introduction to memetic algorithms, in: Glower, F., Kochenberger, G. (Eds.), Handbook of metaheuristics, Kluwer, (1999) 1-56.
20. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithms, Caltech Concurrent Computation Program, California Institute of Technology, Pasadena, Technical Report 790 (1989).
21. Moscato, P.: A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems, in: Valero, M., Onate, E., Jane, M., Larriba, J.L., Suarez, B. (Eds.), Parallel computing and transporter Applications, IOS Press, Amsterdam, The Netherlands, (1992) 176-177.
22. Dawkins, R.: The selfish gene. Oxford University Press, Oxford (1976).
23. Moscato, P., Norman, M.G.: A memetic approach for the Traveling Salesman Problem implementation of a computational ecology for combinatorial optimization on message-passing systems. In: Valero, M., Onate, E., Jane, M., Larriba, J.L., Suarez, B. (Eds.), Parallel computing and Transporter Applications. IOS Press, Amsterdam, The Netherlands, (1992). 177-186.
24. Berretta, R.E., Moscato, P.: The number partitioning problem: An open challenge for evolutionary computation? In: Corne, D., Glover, F., Dorigo, M. (Eds.), New ideas in optimization. McGraw-Hill, Maidenhead, UK, (1999) 261-278 (Chapter 17).
25. Holstein, D., Moscato, P.: Memetic algorithms using guided local search: A case study. In: Corne, D., Glover, F., Dorigo, M. (Eds.), New ideas in optimization. McGraw-Hill, Maidenhead, UK, (1999) 235-244 (Chapter 15).
26. Merz, P.: Analysis of gene expression profiles: an application of memetic algorithms to the minimum sum-of-squares clustering problem. BioSystems 72 (2003) 99-109.
27. Merz, P., Katayama, K.: Memetic algorithms for the unconstrained binary quadratic programming problem, BioSystems, 78 (2004) 99-118.
28. Berrettaa, R., Rodrigues, L.F.: A memetic algorithm for a multistage capacitated lot-sizing problem, Int. J. Production Economics, 87 (2004) 67-81.
29. Lacomme, P., Prins, C., Ramdane, W.: cherif. Competitive memetic algorithms for arc routing problems, Annals of Operations Research, 131(2004) 159-185.
30. Buriol, L., Franca, P.M., and Moscato, P.: A New Memetic Algorithm for the asymmetric traveling salesman problem. J. of Heuristics, 10 (2004) 483-506.
31. Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Azaron, A.: Solving a dynamic cell formation problem using metaheuristics. Applied Mathematics and Computation, Article in press, 2005.
32. Glover, F., Greenberg, H.: New approach heuristic search: a bilateral linkage with artificial intelligence. Eur. J. Oper. Res., 39 (2) (1989) 119-130.
33. Krasnogor, N.: Studies on the theory and design space of memetic algorithms. Ph.D. dissertation, Univ. of the West of England, Bristol, U.K. (2002).
34. Gen, M., Cheng, R.: Genetic algorithms and engineering design. New York: Wiley (1997).