An investigation of local searches in memetic algorithms for multi-objective sequencing problems on mixed-model assembly lines

38th International Conference on Computers and Industrial Engineering 2008

Volumn 2, Issue , 2008, Pages 1971-1980

  Chutima, Parames ^a   Pinkoompee, Penpak ^a  

^a CHULALONGKORN UNIVERSITY   (Thailand)

Author keywords

JIT production system; Local search heuristics; Memetic algorithms; Mixed model assembly line; Multiobjective evolutionary algorithm

Indexed keywords

JIT PRODUCTIONS; LOCAL SEARCH HEURISTICS; MEMETIC ALGORITHMS; MIXED-MODEL ASSEMBLY LINES; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS;

ASSEMBLY; ASSEMBLY MACHINES; COMPUTATIONAL COMPLEXITY; INDUSTRIAL ENGINEERING; JUST IN TIME PRODUCTION; MULTIOBJECTIVE OPTIMIZATION; PRODUCTION ENGINEERING;

EVOLUTIONARY ALGORITHMS;

EID: 84877790821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. A.R. Rahimi-Vahed, M. Rabbani, R. Tavakkoli- Moghaddam, S.A. Torabi, F. Jolai, (2007), A multiobjective scatter search for a mixed-model assembly line sequencing problem, Advanced Engineering Informatics, vol. 21, pp.85-99.
2. C. A. Coello, Coello, D.A. Veldhuizen, and G.B. Lamont, (2002). Evolutionary Algorithms for Solving Multi- Objective Problems. Kluwer Academic Publishers. C.J. Hyun, Y. Kim, Y.K. Kim, (1998), A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines, Computers and Operations Research, vol. 25, no 7-8, pp. 675-690.
3. C.M. Fonseca and P.J.Fleming, (1993), Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization, in Proc. 5th Int. Conf.Genetic Algirthm, Univ. Illinois at Urbana- Champaign, vol. 17-23, pp. 416-423.
4. D. Goldberg, (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA.
5. E. Zitzler, M. Laumanns, L. Thiele, (2001), SPEA2: improving the strength Pareto evolutionary algorithm. Computer Engineering and Networks Laboratory (TIK) - Report 103, September.
6. H. Lu and G. G. Yen, (2003), Rank-density-based multiobjective genetic algorithm and benchmark test function study, IEEE Transactions on Evolutionary Computation, vol. 7, no. 4, pp. 325-343.
7. J.F. Bard, A. Shtub, S.B. Joshi, (1994), Sequencing mixedmodel assembly lines to level parts usage and minimize the length, International Journal of Production Research, vol. 32, pp. 2431-2454.
8. J. Miltenburg, G. Steiner, S. Yeomans, (1990)., A dynamic programming algorithm for scheduling mixed-model just-in-Time production systems, Mathematical Computation Modeling, vol. 13, pp. 57-66.
9. J. Miltenburge, (1989), Level schedules for mixed-model assembly lines in just-in-Time production systems, Management Science, vol.35, no. 2, pp.192-207.
10. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, (2002), A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182-197.
11. J. Horn, N. Nafpliotis, and D.E Goldberg, (1994), A niched Pareto genetic for multi-objective optimization, in Proc. 1st IEEE Int. Conf. Evolutionary Compuation, Orlando, FL, vol. 27-29, pp.82-87.
12. N. Srinivas and K. Deb, (1994), Multiobjective optimization using nondominated sorting in genetic algorithms, Evol. Comput., vol.2, no.3, pp. 221-248.
13. P. Moscato, (1999), Memetic Algorithms: A Short Introduction, in New Ideas in Optimization, (D. Corne, M. Dorigo, and F. Glover, eds.), ch. 14, pp. 219-234, McGraw-Hill, London.
14. P.R. McMullen, and G.V. Frazier, (2000), A simulated annealing approach to mixed-model sequencing with multiple objectives on a JIT line, IIE Transactions, vol. 32, no. 8, pp. 679-686.
15. P.R. McMullen, (2001a), An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics, Computers and Industrial Engineering, vol. 41, pp. 335-353.
16. P.R. McMullen, (2001b), A Kohonen self-organizing map approach to addressing a multiple objective, mixedmodel JIT sequencing problem, International Journal of Production Economics, vol.72, pp.59-71.
17. P.R. McMullen, (2001c), An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives, Artificial Intelligence in Engineering vol.15, pp. 309-317.
18. R. Tavakkoli-Moghaddam, A.R. Rahimi-Vahed, (2006), Multi-criteria sequencing problem for a mixed-model assembly line in a JIT production system, Applied Mathematics and Computation, vol. 181, pp. 1471- 1481.
19. S.A. Mansouri, (2005), A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines, European Journal of Operational Research, vol. 167, no.3, 696-716.
20. T. Korkmazel, S. Meral, (2001), Bicriteria sequencing methods for the mixed-model assembly line in just-intime production systems, European Journal of Operational Research, vol. 131, 188-207.
21. W. Kubiak, S.P. Sethi, (1991), A note on level schedules for mixed-model assembly lines in just-in-Time production systems. Management Science, vol.37, pp. 241-259.
22. Y.H. Lee, K. Bhaskaran, M. Pinedo, (1997), A heuristic to minimize the total weighted tardiness with sequence dependent setups, ITE Transactions, vol.29, pp. 45-52.
23. Y. Mondon, (1983), Toyota Production System, Institute of Industrial Engineering Press, Atlanta.
24. Z. Michalewicz, (1996), Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1996.