A simulated annealing heuristic for the dynamic layout problem with budget constraint

Şahin, Ramazan; Ertoğral, Kadir; Türkbey, Orhan

doi:10.1016/j.cie.2010.04.013

Cited by 59 publications

(25 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All parameters for the DFLP with budget constraint were taken from a data set provided by [9] which had 48 test problems (16 problems with N = 5 and T = 5 or 10, 16 problems with N = 15 and T = 5 or 10 and 16 problems with N = 30 and T = 5 or 10). For comparison, the results have been compared to those reported by [17]. In order to show the efficiency of the proposed algorithm, just the biggest problems were taken and compared (32 test problems out of 48 ones where N = 15, 30 and T = 5 or 10).…”

Section: Computational Resultsmentioning

confidence: 99%

“…The optimal solutions under the proposed algorithm are listed in the sixth column. The seventh column lists the optimal solutions reported by [17]. The percentage of deviation, denoted by "% Dev."…”

Section: Computational Resultsmentioning

confidence: 99%

“…In order to show the efficiency of the proposed algorithm, just the biggest problems were taken and compared (32 test problems out of 48 ones where N = 15, 30 and T = 5 or 10). The second column in this table is the problem number denoted by [17]. For each problem without a budget constraint, shows three problems with different budget constraints.…”

Section: Computational Resultsmentioning

confidence: 99%

“…The percentage of deviation, denoted by "% Dev." of the best solution obtained from the proposed algorithm, which is lower than the best solution obtained from [17], is given in the eighth column, for every test problem. In the last column, the average run times are given in minutes.…”

Section: Computational Resultsmentioning

confidence: 99%

“…There are few studies on DFLP with the budget constraints ( [8], [17], [2], and [18]). [17] developed a simulated annealing algorithm for the problem. According to the latest study, [18] used simulation to address a DFLP with budget constraint.…”

Section: Facility Layout Problemsmentioning

confidence: 99%

See 4 more Smart Citations

SimSum1: a general optimisation via simulation approach for 0-1 programming models

Azimi¹

2012

Int. j. simul. model.

View full text Add to dashboard Cite

The current study develops a new general heuristic approach to address a special class of combinatorial problems, efficiently. The approach combines discrete event simulation together with relaxation techniques to solve a special class of 0-1 programming models including a constraint that restricts the summation of all variables to be 1. Three well-known combinatorial problems -including such a constraint-such as Dynamic Facility Layout Problem (DFLP), Graph Labelling Problem (GLP) and Travelling Salesman Problem (TSP) have been addressed and could be solved efficiently by the proposed algorithm. Several experiments have been carried out to show the efficiency of the algorithm. The results show that the proposed algorithm can be used for several real world applications while according to the best knowledge of the author, at least for DFLP and GLP, it is the fastest algorithm which has been developed in the literature.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Section: Computational Resultsmentioning

confidence: 99%

Section: Computational Resultsmentioning

confidence: 99%

Section: Computational Resultsmentioning

confidence: 99%

Section: Facility Layout Problemsmentioning

confidence: 99%

See 3 more Smart Citations

SimSum1: a general optimisation via simulation approach for 0-1 programming models

Azimi¹

2012

Int. j. simul. model.

View full text Add to dashboard Cite

show abstract

A simulated annealing approach for reliability‐based chance‐constrained programming

Sakallı

2013

Appl Stoch Models Bus & Ind

View full text Add to dashboard Cite

The chance-constrained programming (CCP) is a well-known and widely used stochastic programming approach. In the CCP approach, determining the confidence levels of the constraints at the beginning of solution process is a critical issue for optimality. On one hand, it is possible to obtain better solutions at different confidence levels. On the other hand, the decision makers prefer to simplify their choices instead of grappling with the details such as determining confidence levels for all chance constraints. Reliability is an effective tool that enables the decision maker to look over the system integrity. In this paper, the CCP is considered as a reliability-based nonlinear multiobjective model, and a simulated annealing (SA) algorithm is developed to solve the model. The SA represents different solution alternatives at the different reliability degrees to the decision makers by performing different confidence levels. Thus, the decision makers have the opportunity to make more effective decisions.

show abstract

Layout Design and Reconfiguration in a Collaborative Manufacturing Network

Azevedo

Crispim

Sousa

2016

Collaboration in a Hyperconnected World

View full text Add to dashboard Cite

This study explores strategic agility of an automotive corporate group and its influence on facility layouts and operational performance. Strategic agility is viewed here as a firm's strategic intent to achieve agile operations through collaboratively deploying the layouts of a set of facilities, driven by a management focus on improving its responsiveness and adaptability to customers' requirements. Our "collaborative multi-facility layout problem" involves the physical organization of departments between and inside several facilities geographically dispersed, that collaborate in manufacturing a complex product in a given time window. The model proposed in this work allows us to analyse the benefits of new horizontal collaboration forms with respect to several objectives, namely costs (material handling inside and between facilities, re-layout) and adjacency between departments. A case study of a first tier supplier in the automotive industry shows the applicability potential of the approach to real-life problems. The results show that horizontal collaboration among the facilities can positively influence the performance of the corporate group as a whole, and that of each firm individually.

show abstract

A simulated annealing heuristic for the dynamic layout problem with budget constraint

Cited by 59 publications

References 23 publications

SimSum1: a general optimisation via simulation approach for 0-1 programming models

SimSum1: a general optimisation via simulation approach for 0-1 programming models

A simulated annealing approach for reliability‐based chance‐constrained programming

Layout Design and Reconfiguration in a Collaborative Manufacturing Network

Contact Info

Product

Resources

About