New heuristic for the dynamic layout problem

Erel, Erdal; Ghosh, Jay B.; Simon, J T Mao

doi:10.1057/palgrave.jors.2601646

Cited by 48 publications

(23 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A few of the results for the 15-and 30-department problems (Tables 2 and 3) reported by us in our paper 1 were incorrect (because of certain typographical errors in the input data). The correct results have now been obtained and differ from the incorrectly reported ones only slightly; some of the new results actually represent an improvement.…”

mentioning

confidence: 63%

Erratum: New heuristic for the dynamic layout problem

Erel

Ghosh

Simon

2005

Journal of the Operational Research Society

Self Cite

View full text Add to dashboard Cite

A few of the results for the 15-and 30-department problems (Tables 2 and 3) reported by us in our paper 1 were incorrect (because of certain typographical errors in the input data). The correct results have now been obtained and differ from the incorrectly reported ones only slightly; some of the new results actually represent an improvement. Encouraged by the interest of other researchers in our detailed results, we have also constructed a website (http://bilkent.edu.tr/Berel/ dynlayout.html) so that one can easily download, for all relevant problem instances, the best layout in each period and the associated cost found by us. References1 Erel E, Ghosh JB and Simon JT (2003). New heuristic for the dynamic layout problem.

show abstract

mentioning

confidence: 63%

Erratum: New heuristic for the dynamic layout problem

Erel

Ghosh

Simon

2005

Journal of the Operational Research Society

Self Cite

View full text Add to dashboard Cite

show abstract

“…A hybrid approach for handling the unequal sized facility layout is considered by , in their algorithm initial solution is generated by SA and for determining the optimal location of facilities analytical search is applied. The DFLP has been solved by Erel et al (2003) using a three stage hybrid algorithm. Hasani et al (2015) suggested a hybrid meta-heuristic for dynamic layout problems with transportation system design using variable neighbourhood search (VNS) and SA.…”

Section: Hybrid Algorithmmentioning

confidence: 99%

A review on implementation of meta-heuristic approaches for layout problems in dynamic business environment

Sharma¹,

Singhal²

2016

IJMDA

View full text Add to dashboard Cite

Arrangement of the facilities on shop floor in industries termed as facility layout planning. It is a vital issue at the premature stage while designing a manufacturing structure because it affects the total manufacturing cost considerably. The dynamic environment is such an industrial condition in which flexibility exists in the demand of the product. The purpose of this research paper is to present a review on the implementation of meta-heuristics approaches for handling the problem of facility layout in a dynamic environment. Various meta-heuristic approaches which have been implemented in facility layout planning (FLP) are discussed briefly and the percent utilisation of different approaches is analysed in various time spans. Tabu search (TS), genetic algorithm (GA), particle swarm optimisation (PSO), and ant colony optimisation (ACO) are several typically used methods by researchers for layout optimisation. In the present study, % utilisation of these algorithms has been analysed for different time span, ACO utilised by maximum researchers in the time span '2010-2015'. The present study also revealed GA has been executed by most of the researchers (25%), whereas PSO (8%) utilised by very least designers.Keywords: dynamic environment; meta-heuristic; optimisation; facility layout planning; hybrid approaches.Reference to this paper should be made as follows: Sharma, P. and Singhal, S. A review on implementation of meta-heuristic approaches for layout problems 7Sandeep Singhal is currently working as an Associate Professor in Department of Mechanical Engineering, National Institute of Technology (NIT), Kurukshetra, Haryana, India, an institution of national importance. Currently, he is the Chairman of ISTE, Haryana Chapter. He is a PhD from NIT, Kurukshetra. He has more than 25 years of teaching, research and professional experience and has authored more than 40 research papers in reputed national and international peer reviewed journals and conferences. He has authored a book on entrepreneurship. His areas of interest are SCM, ERP, TQM, entrepreneurship, facility management, etc. He has worked with AICTE and NBA the apex regulatory body for technical education in various capacities for seven years and was closely associated with Washington Accord. He has guided/guiding research scholars at MTech and PhD levels.

show abstract

“…Kim and Kim (2000) presented a MILP formulation and developed a two-phase heuristic for solving the FLP with unequal area fixed shape departments [15]. Erel et al (2003) presented a new heuristic to solve the dynamic layout problem which includes three phases. The first phase is to identify a viable set of layouts, and the second phase uses dynamic programming to solve the shortest path problem over the viable set.…”

Section: Literature Reviewmentioning

confidence: 99%

Tabu search heuristic for efficiency of dynamic facility layout problem

Bozorgi

Abedzadeh

Zeinali

2014

Int J Adv Manuf Technol

View full text Add to dashboard Cite

The facility layout problem (FLP) is a wellresearched problem of finding positions of departments on a plant floor such that departments do not overlap and some specific critical criteria involved in FLP are optimized. In addition, the facility layout dramatically influences the efficiency of material handling within a manufacturing system. In order to ensure optimal performance within a manufacturing system, the facility layout should reflect changes throughout time. However, the static facility layout problem with constant material flows between departments may not be a realistic scenario because a manufacturing facility is a dynamic system that constantly evolves. On the other hand, layout problem has multi-objective nature, and it is necessary to apply various criteria and goals for determining a good facility layout. As a result, this research is about determining a solution for dynamic facility layout problem (DFLP) with equal departments by applying data envelopment analysis (DEA) with consideration of some specific criteria which are cost, adjacency, and distance requested. Cost as a negative criterion is minimized and used as an input, whereas adjacency and distance requested are considered positive criteria and used as output of DEA model. In the proposed algorithm, at first, the initial layout is generated, and then its neighborhood is created by the pair exchange and reverse strategy. By applying tabu search heuristic using diversification strategy which includes "frequency-based memory," "penalty function," and "dynamic tabu list size" to the DEA model, the most desired efficient layout is obtained. Two data sets taken from the relevant literature are used to test and evaluate the performance of the proposed heuristic. Computational experiments show that the proposed heuristic outperforms other heuristics presented in relevant literature, and the most efficient layout is achieved.

show abstract

New heuristic for the dynamic layout problem

Cited by 48 publications

References 12 publications

Erratum: New heuristic for the dynamic layout problem

Erratum: New heuristic for the dynamic layout problem

A review on implementation of meta-heuristic approaches for layout problems in dynamic business environment

Tabu search heuristic for efficiency of dynamic facility layout problem

Contact Info

Product

Resources

About