BibTex RIS Kaynak Göster

ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI

Yıl 2017, , 0 - 0, 07.09.2017
https://doi.org/10.17341/gazimmfd.337647

Öz

Tek sıra tesis düzenleme problemi, bölümlerin düz bir hat üzerinde yerleşiminin planlanması problemidir. Tek sıra tesis düzenleme probleminde, genellikle bölümler arası toplam taşıma maliyetlerini en küçüklemek hedeflenmektedir. Ancak, gerçek hayatta tesis düzenleme problemini tek bir amaçla ifade etmek mantıklı olmayacaktır. Bunun için nicel ve nitel amaçları ele alan çok amaçlı modeller üzerinde çalışılmaktadır. Bu çalışmada, toplam akış mesafesini en küçüklemeyi ve bölümler arası yakınlık skorlarını en büyüklemeyi hedefleyen çok amaçlı tek sıra tesis düzenleme problemi ele alınmıştır. Bu amaçlar, tek sıra tesis düzenleme problemi için ilk defa bu çalışmada dikkate alınmıştır. Problemin çözümü için, ağırlıklı hedef programlama yaklaşımı ve NSGA II algoritması önerilmiştir. 

Kaynakça

  • Drira, A., Pierreval, H., ve Hajri-Gabouj, S., “Facility layout problems: A survey”, Annual Reviews in Control, Cilt 31, No 2, 255-267, 2007.
  • Tompkins, J. A., White, J. A., Bozer, Y. A. ve Tanchoco, J. M., Facilities Planning, John Wiley & Sons, A.B.D., 2010.
  • Amaral, A.R S., “On the exact solution of a facility layout problem”, European Journal of Operational Research, Cilt 173, No 2, 508–518, 2006.
  • Lenin, N., Kumar, M.S., Ravindran, D. ve Islam, M. N., “A tabu search for multiobjective single row facility layout problem”, Journal of Advanced Manufacturing Systems, Cilt 13, No 1, 17-40, 2014.
  • Heragu, S.S. ve Kusiak, A., “Machine layout problem in flexible manufacturing systems”, Operations Research, Cilt 36, No 2, 258–268, 1988.
  • Solimanpur, M., Vrat, P. ve Shankar, R., “An ant algorithm for the single row layout problem in flexible manufacturing systems”, Computers & Operations Research, Cilt 32, No 3, 583–598, 2005.
  • Simmons, D. M., “One-dimensional space allocation: An ordering algorithm”, Operations Research, Cilt 17, No 5, 812–826, 1969.
  • Picard, J. C. ve Queyranne, M., “On the one-dimensional space allocation problem”, Operations Research, Cilt 29, No 2, 371–391, 1981.
  • Beghin-Picavet, M. ve Hansen, P., “Deux problemes daffectation nonlineaires”, RAIRO, Recherche Operationnelle, Cilt 16, No 3, 263-276, 1982.
  • Love, R.F. ve Wong, J.Y., “On solving a one-dimensional space allocation problem with integer programming”, INFOR, Cilt 14, No 2, 139-143, 1976.
  • Heragu, S.S. ve Kusiak, A., “Efficient models for the facility layout problem”, European Journal of Operational Research, Cilt 53, No 1, 1–13, 1991.
  • Amaral, A.R.S., “A new lower bound for the single row facility layout problem”, Discrete Applied Mathematics, Cilt 157, No 1, 183–190, 2009.
  • Amaral, A.R.S. ve Letchford, A.N., “A polyhedral approach to the single row facility layout problem”, Mathematical Programming, Cilt 141, No 1-2, 453–477, 2013.
  • Anjos, M.F., Kennings, A. ve Vannelli, A., “A semidefinite optimization approach for the single-row layout problem with unequal dimensions”, Discrete Optimization, Cilt 2, No 2, 113–122, 2005.
  • Anjos, M.F. ve Vannelli, A., “Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes”, INFORMS Journal on Computing, Cilt 20, No 4, 611–617, 2008.
  • Hungerlander, P. ve Rendl, F., “A computational study and survey of methods for the single-row facility layout problem”, Computational Optimization and Applications, Cilt 55, 1–20, 2013.
  • Kumar, K.R., Hadjinicola, G.C., ve Lin, T.L., “A heuristic for the single-row facility layout problem”, European Journal of Operational Research, Cilt 87, No 1, 65-73, 1995.
  • Braglia, M., “Heuristics for single-row layout problems in flexible manufacturing systems” Production Planning & Control, Cilt 8, 558–567, 1997.
  • Djellab, H. ve Gourgand, M., “A new heuristic procedure for the single-row facility layout problem”, International Journal of Computer Integrated Manufacturing, Cilt 14, No 3, 270–280, 2001.
  • Kouvelis, P. ve Chiang, W.C., “A simulated annealing procedure for single row layout problems in flexible manufacturing systems”, International Journal of Production Research, Cilt 30, No 4, 717–732, 1992.
  • Chen, D.S., Wang, Q. ve Chen, H. C., “Linear sequencing for machine layouts by a modified simulated annealing”, International Journal of Production Research, Cilt 39, No 8, 1721–1732, 2001.
  • Palubeckis, G., “Fast simulated annealing for single-row equidistant facility layout”, Applied Mathematics and Computation, Cilt 263, 287-301, 2015.
  • Samarghandi, H. ve Eshghi, K., “An efficient tabu algorithm for the single row facility layout problem”, European Journal of Operational Research, Cilt 205, No 1, 98–105, 2010.
  • Kothari, R. ve Ghosh, D., “Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods”, European Journal of Operational Research, Cilt 224, 93–100, 2013.
  • Morad, N., “Genetic algorithms optimazition for the machine layout problem”, International Journal of Computer, the Internet and Management, Cilt 8, No 1, 1–15, 2000.
  • Ficko, M., Brezocnik, M. ve Balic, J., “Designing the layout of single- and multiple-rows flexible manufacturing system by genetic algorithms”, Journal of Materials Processing Technology, Cilt 157, No 158, 150–158, 2004.
  • El-Baz, M.A., “A genetic algorithm for facility layout problems of different manufacturing environments”, Computers & Industrial Engineering, Cilt 47, Sayı 2-3, 233–246, 2004.
  • Lin, M.T., “The single-row machine layout problem in apparel manufacturing by hierarchical order-based genetic algorithm”, International Journal of Clothing, Science and Technology, Cilt 21, 31–43, 2009.
  • Datta, D., Amaral, A.R. ve Figueira, J.R., “Single row facility layout problem using a permutation-based genetic algorithm”, European Journal of Operational Research, Cilt 213, No 2, 388–394, 2011.
  • Özçelik, F., “A hybrid genetic algorithm for the single row layout problem”, International Journal of Production Research, Cilt 50, 1–15, 2012.
  • Kothari, R. ve Ghosh, D., “An efficient genetic algorithm for single row facility layout”, Optimization Letters, Cilt 6, No 2, 679–690, 2014.
  • Kumar, R.M.S., Asokan, P., Kumanan, S. ve Varma, B., “Scatter search algorithm for single row layout problem in FMS”, Advances in Production Engineering & Management, Cilt 3, 193–204, 2008.
  • Kothari, R. ve Ghosh, D., “A scatter search algorithm for the single row facility layout problem”, Journal of Heuristics, Cilt 20, No 2, 125–142, 2014.
  • Kumar, R.M.S., Asokan, P. ve Kumanan, S., “An artificial immune system-based algorithm to solve linear and loop layout problems in flexible manufacturing systems”, International Journal of Product Delevopment, Cilt 10, 165–179, 2010.
  • Kothari, R. ve Ghosh, D., “Path relinking for single row facility layout” Ahmedabad, Indian Institute of Management, 2012.
  • Kunlei, L., Chaoyong, Z., Liang, G. ve Xinyu, S., “Single row facility layout problem using an imperialist competitive algorithm”, 41. International Conference on Computers & Industrial Engineering, 578–586, 2011.
  • Alvarenga, A.G. ve Negreiros-Gomes, F.J., “Metaheuristic methods for a class of the facility layout problem”, Journal of Intelligent Manufacturing, Cilt 11, No 4, 421-430, 2000.
  • Teo,Y. ve Ponnambalam, S., “A hybrid ACO/PSO heuristic to solve single row layout problem”, IEEE International Conference on Automation Science and Engineering, 597–602, 2008.
  • Hosseini-Nasab, H. ve Emami, L., “A hybrid clonal selection for the single row facility layout problem with unequal dimensions”, iBusiness, Cilt 4, 216–221, 2012.
  • Ou-Yang, C., ve Utamima, A., “Hybrid estimation of distribution algorithm for solving single row facility layout problem”, Computers & Industrial Engineering, Cilt 66, No 1, 95–103, 2013.
  • Şahin, R. ve Türkbey, O., “Çok amaçlı tesis yerleşim problem için yeni bir melez sezgisel algoritma”, Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt 25, No 1, 119-130, 2010.
  • Rosenblatt, M.J., “The facilities layout problem: a multi-goal approach”, International Journal of Production Research, Cilt 17, No 4, 323-332, 1979.
  • Na, Z., Kelin X. ve Wei, Q., “Multi-objective combinatorial optimization of multi-product single-row layout”, International Conference on Electrical and Control Engineering, 1324-1327, 2010.
  • Ertay, T., Ruan, D. ve Tuzkaya, U.R., “Integrating data envelopment analysis and analytic hierarchy for the facility layout design in manufacturing systems”, Information Sciences, Cilt 176, 237-262, 2006.
  • Chen, G.Y.H. ve Lo, J.C., “Dynamic facility layout with multi-objectives”, Asia-Pacific Journal of Operational Research, Cilt 31, No 4, 2014.
  • Emami, S. ve Nookabadi, A.S., “Managing a new multi-objective model for the dynamic facility layout problem”, International Journal of Advanced Manufacturing Technology, Cilt 68, No 9, 2215-2228, 2013.
  • Lenin, N., Kumar, M.S., Islam, M. ve Ravindran, D., “Multi-objective optimization in single-row layout design using a genetic algorithm”, The International Journal of Advanced Manufacturing Technology, Cilt 67, No 5, 1777–1790, 2013.
  • Malakooti, B., Operations and Production Systems with Multiple Objectives, John Wiley & Sons, New Jersey, 2014.
  • Deb, K., Pratap, A., Agarwal, S. ve Meyarivan, T., “A fast and elitist multiobjective genetic algorithm: NSGA II”, IEEE Transactions on Evolutionary Computation, Cilt 6, No 2, 182-197, 2002.
  • Srinivas, N. ve Deb, K., “Multiobjective optimization using nondominated sorting in genetic algorithms”, Evolutionary Computing, Cilt 2, No 3, 221-248, 1995.
  • Dutta, K.N. ve Sahu, S., “A multigoal heuristic for facilities design problems: MUGHAL”, International Journal of Production Research, Cilt 20, No 2, 147-154, 1982.
  • Fortenberry, J.C. ve Cox, J.F., “Multiple criteria approach to the facilities layout problem”, International Journal of Production Research, Cilt 23, No 4, 773-782, 1985.
  • Suresh, G. ve Sahu, S., “Multiobjective facility layout using simulated annealing”, International Journal of Production Economics, Cilt 32, No 2, 239-254, 1993.
  • Urban, T.L., “A multiple criteria model for the facilities layout problem”, International Journal of Production Research, Cilt 25, No 12, 1805–1812, 1987.
Toplam 54 adet kaynakça vardır.

Ayrıntılar

Bölüm Makaleler
Yazarlar

Esra Duygu Durmaz

Ramazan Şahin

Yayımlanma Tarihi 7 Eylül 2017
Gönderilme Tarihi 24 Haziran 2016
Yayımlandığı Sayı Yıl 2017

Kaynak Göster

APA Durmaz, E. D., & Şahin, R. (2017). ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, 32(3). https://doi.org/10.17341/gazimmfd.337647
AMA Durmaz ED, Şahin R. ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI. GUMMFD. Eylül 2017;32(3). doi:10.17341/gazimmfd.337647
Chicago Durmaz, Esra Duygu, ve Ramazan Şahin. “ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 32, sy. 3 (Eylül 2017). https://doi.org/10.17341/gazimmfd.337647.
EndNote Durmaz ED, Şahin R (01 Eylül 2017) ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 32 3
IEEE E. D. Durmaz ve R. Şahin, “ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI”, GUMMFD, c. 32, sy. 3, 2017, doi: 10.17341/gazimmfd.337647.
ISNAD Durmaz, Esra Duygu - Şahin, Ramazan. “ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 32/3 (Eylül 2017). https://doi.org/10.17341/gazimmfd.337647.
JAMA Durmaz ED, Şahin R. ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI. GUMMFD. 2017;32. doi:10.17341/gazimmfd.337647.
MLA Durmaz, Esra Duygu ve Ramazan Şahin. “ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, c. 32, sy. 3, 2017, doi:10.17341/gazimmfd.337647.
Vancouver Durmaz ED, Şahin R. ÇOK AMAÇLI TEK SIRA TESİS DÜZENLEME PROBLEMİNİN ÇÖZÜMÜ İÇİN NSGA-II VE HEDEF PROGRAMLAMA YAKLAŞIMI. GUMMFD. 2017;32(3).

Cited By