Year 2008,
Volume: 23 Issue: 4, 0 - , 18.02.2013
Abstract
Günümüz piyasa koşullarında, global rekabetin artması, teknolojideki hızlı değişmeler ve ürünlerin hayat eğrilerinin kısalması tesis düzenleme problemini Dinamik Tesis Düzenleme Problemi (DTDP) olarak değerlendirmeyi gerekli kılmaktadır. DTDP’nin amacı, planlama dönemi süresince, bölümler arasındaki malzeme taşıma maliyetleri ile bölümlerin yer değiştirme maliyetlerinin toplamını en küçükleyecek şekilde bölümlerin alanlara atamasını yapmaktır. DTDP genellikle Kareli Atama Problemi (KAP) olarak modellenir ve KAP, NP-zor yapıya sahiptir. Problem boyutu arttıkça en iyi sonuçların bulunması da oldukça zordur. Bu yüzden, makalede DTDP’ni çözmek için bir Tavlama Benzetimi (TB) sezgiseli geliştirilmiştir. Önerilen TB sezgiselinin başarısının analizinde literatürdeki test problemleri kullanılmıştır. Elde edilen sonuçlar, önerilen TB algoritmasının DTDP’ni çözmede oldukça etkin olduğunu göstermektedir.
References
- Chiang, W.-C. ve Chiang, C., “Intelligent
- local search strategies for solving facility
- layout problems with the quadratic
- assignment problem formulation”, European
- Journal of Operational Research, Cilt 106,
- -488, 1998.
- Tompkins, J.A., White, J.A., Bozer, Y.A.,
- Frazelle, E.H., Tanchoco, J.M.A. ve Trevino,
- J., Facilities planning, John Wiley & Sons,
- NY, A.B.D., 1996.
- Kusiak, A. ve Heragu, S.S., “The facility
- layout problem”, European Journal of
- Operational Research, Cilt 29, No 3, 229-
- , 1987.
- Meller, R.D. ve Gau, K.-Y., “The facility
- layout problem: Recent and emerging trends
- and perspectives”, Journal of
- Manufacturing Systems, Cilt 15, No5, 351-
- , 1996.
- Rosenblatt, M.J., “The dynamics of plant
- layout”, Management Science, Cilt 32, No
- , 76-86, 1986.
- McKendall, A.R.Jr., Shang, J. ve
- Kuppusamy, S., “Simulated annealing
- heuristics for the dynamic facility layout
- problem”, Computers and Operations
- Research, Cilt 33, 2431-2444, 2006.
- Urban, T.L., “A heuristic for the dynamic
- facility layout problem”, IIE Transactions,
- Cilt 25, No 4, 57-63, 1993.
- Lacksonen, T.A. ve Enscore, E.E.,
- “Quadratic assignment algorithms for the
- dynamic layout problem”, International
- Journal of Production Research, Cilt 31,
- No 3, 503-517, 1993.
- Conway, D.G. ve Venkataramanan, M.A.,
- “Genetic search and the dynamic facility
- layout problem”, Computers and
- Operations Research, Cilt 21, No 8, 955-
- , 1994.
- Balakrishnan, J. ve Cheng, C.H., “Genetic
- search and the dynamic layout problem”,
- Computers and Operations Research, Cilt
- , No 6, 587-593, 2000.
- Kaku, B.K. ve Mazzola, J.B., “A tabu-search
- heuristic for the dynamic plant layout
- problem”, INFORMS Journal on
- Computing, Cilt 9, No 4, 374-384, 1997.
- Balakrishnan, J., Cheng, C.H. ve Conway,
- D.G., “An improved pair-wise exchange
- heuristic for the dynamic plant layout
- problem”, International Journal of
- Production Research, Cilt 38, No 13, 3067-
- , 2000.
- Baykasoğlu, A. ve Gindy, N.N.Z., “A
- simulated annealing algorithm for dynamic
- layout problem”, Computers and
- Operations Research, Cilt 28, 1403-1426,
- -
- Balakrishnan, J., Cheng, C.H., Conway, D.G.
- ve Lau, C.M., “A hybrid genetic algorithm
- for the dynamic plant layout problem”,
- International Journal of Production
- Economics, Cilt 86, 107–120, 2003.
- McKendall, A.R.Jr. ve Shang, J., “Hybrid ant
- systems for the dynamic facility layout
- problem”, Computers and Operations
- Research, Cilt 33, 790-803, 2006.
- Rodriguez, J.M., MacPhee, F.C., Bonham,
- D.J. ve Bhavsar, V.C., “Solving the Dynamic
- Plant Layout Problem using a new hybrid
- meta-heuristic algorithm”, International
- Journal of High Performance Computing
- and Networking, Cilt 4, No 5/6, 286-294,
- -
- Balakrishnan, J. ve Cheng, C.H., “Dynamic
- Layout Algorithms: a State-of-the-art
- Survey”, OMEGA, Cilt 26, No 4, 507-521,
- -
- Kirkpatrick, S., Gelatt, Jr.C.D. ve Vecchi,
- M.P., “Optimization by Simulated
- Annealing”, Science, Cilt 220, No 4598,
- -680, 1983.
Year 2008,
Volume: 23 Issue: 4, 0 - , 18.02.2013
Abstract
References
- Chiang, W.-C. ve Chiang, C., “Intelligent
- local search strategies for solving facility
- layout problems with the quadratic
- assignment problem formulation”, European
- Journal of Operational Research, Cilt 106,
- -488, 1998.
- Tompkins, J.A., White, J.A., Bozer, Y.A.,
- Frazelle, E.H., Tanchoco, J.M.A. ve Trevino,
- J., Facilities planning, John Wiley & Sons,
- NY, A.B.D., 1996.
- Kusiak, A. ve Heragu, S.S., “The facility
- layout problem”, European Journal of
- Operational Research, Cilt 29, No 3, 229-
- , 1987.
- Meller, R.D. ve Gau, K.-Y., “The facility
- layout problem: Recent and emerging trends
- and perspectives”, Journal of
- Manufacturing Systems, Cilt 15, No5, 351-
- , 1996.
- Rosenblatt, M.J., “The dynamics of plant
- layout”, Management Science, Cilt 32, No
- , 76-86, 1986.
- McKendall, A.R.Jr., Shang, J. ve
- Kuppusamy, S., “Simulated annealing
- heuristics for the dynamic facility layout
- problem”, Computers and Operations
- Research, Cilt 33, 2431-2444, 2006.
- Urban, T.L., “A heuristic for the dynamic
- facility layout problem”, IIE Transactions,
- Cilt 25, No 4, 57-63, 1993.
- Lacksonen, T.A. ve Enscore, E.E.,
- “Quadratic assignment algorithms for the
- dynamic layout problem”, International
- Journal of Production Research, Cilt 31,
- No 3, 503-517, 1993.
- Conway, D.G. ve Venkataramanan, M.A.,
- “Genetic search and the dynamic facility
- layout problem”, Computers and
- Operations Research, Cilt 21, No 8, 955-
- , 1994.
- Balakrishnan, J. ve Cheng, C.H., “Genetic
- search and the dynamic layout problem”,
- Computers and Operations Research, Cilt
- , No 6, 587-593, 2000.
- Kaku, B.K. ve Mazzola, J.B., “A tabu-search
- heuristic for the dynamic plant layout
- problem”, INFORMS Journal on
- Computing, Cilt 9, No 4, 374-384, 1997.
- Balakrishnan, J., Cheng, C.H. ve Conway,
- D.G., “An improved pair-wise exchange
- heuristic for the dynamic plant layout
- problem”, International Journal of
- Production Research, Cilt 38, No 13, 3067-
- , 2000.
- Baykasoğlu, A. ve Gindy, N.N.Z., “A
- simulated annealing algorithm for dynamic
- layout problem”, Computers and
- Operations Research, Cilt 28, 1403-1426,
- -
- Balakrishnan, J., Cheng, C.H., Conway, D.G.
- ve Lau, C.M., “A hybrid genetic algorithm
- for the dynamic plant layout problem”,
- International Journal of Production
- Economics, Cilt 86, 107–120, 2003.
- McKendall, A.R.Jr. ve Shang, J., “Hybrid ant
- systems for the dynamic facility layout
- problem”, Computers and Operations
- Research, Cilt 33, 790-803, 2006.
- Rodriguez, J.M., MacPhee, F.C., Bonham,
- D.J. ve Bhavsar, V.C., “Solving the Dynamic
- Plant Layout Problem using a new hybrid
- meta-heuristic algorithm”, International
- Journal of High Performance Computing
- and Networking, Cilt 4, No 5/6, 286-294,
- -
- Balakrishnan, J. ve Cheng, C.H., “Dynamic
- Layout Algorithms: a State-of-the-art
- Survey”, OMEGA, Cilt 26, No 4, 507-521,
- -
- Kirkpatrick, S., Gelatt, Jr.C.D. ve Vecchi,
- M.P., “Optimization by Simulated
- Annealing”, Science, Cilt 220, No 4598,
- -680, 1983.
There are 83 citations in total.
Details
| Primary Language | Turkish |
|---|---|
| Journal Section | Makaleler |
| Authors | |
| Publication Date | February 18, 2013 |
| Submission Date | February 18, 2013 |
| Published in Issue | Year 2008 Volume: 23 Issue: 4 |