Nonlinear programming approach to automated topology optimization

Imam, Muhammad Hasan; Mir, Mustahsan

doi:10.1016/0010-4485(89)90146-2

Cited by 26 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Equal-size departments are rarely practical in the industry and real-world competitive market; therefore, Armour and Buffa (1963) formulated the UA SFLPs. Imam and Mir (1989) investigated UA SFLPs and solved two problems with a search algorithm named TOPOPT. Heragu and Kusiak (1991) introduced two models for UA SFLPs which were: single row layout and multi-row layout.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The first set comprises three problem instances as follows: 8 departments, 11 departments, and 20 departments which were named SFLP-1, SFLP-2 and SFLP-3, respectively. The problems with 8 departments and 11 departments were taken from Imam and Mir (1989) and the one with 20 departments was taken from Mir and Imam (2001). The second set consists of two problem instances as follows: (1) one with 6 departments and 6 periods that was named P6, and (2) another with 12 departments and 4 periods that was named P12.…”

Section: Numerical Experiments and Parameter Settingsmentioning

confidence: 99%

See 1 more Smart Citation

Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization

Asl

Wong

2015

J Intell Manuf

View full text Add to dashboard Cite

Facility layout problems deal with layout of facilities or departments in a shop floor. This article studies unequal-area static facility layout problems in order to minimize the sum of the material handling costs and unequalarea dynamic facility layout problems so as to minimize the sum of the material handling costs and rearrangement costs. Unequal-area static and dynamic facility layout problems are NP-hard. Therefore, a modified particle swarm optimization was suggested to solve them where the departments have fixed shapes and areas throughout the time horizon. The modified particle swarm optimization was tested using the available problem instances chosen from the literature. The proposed algorithm applied two local search methods and the department swapping method to improve the quality of solutions and to prevent local optima for dynamic and static problems. It also utilized the period swapping method to improve the solutions for dynamic problems. The results showed that the proposed algorithm has created encouraging layouts in comparison with other approaches.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Numerical Experiments and Parameter Settingsmentioning

confidence: 99%

Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization

Asl

Wong

2015

J Intell Manuf

View full text Add to dashboard Cite

show abstract

“…Particularly, aesthetic and other subjective aspects of design are difficult to describe using the logical expression or the mathematical formulae. Many attempts have been used to deal with this problem such as the wall representation (Flemming 1978), non-linear programming (Imam and Mir 1989) and the evolutionary approach (Michalek and Papalambros 2002). There are various difficulties with each approach.…”

Section: Introductionmentioning

confidence: 99%

Computer Aided Architectural Design Futures 2005

Schmitt¹,

Oechslin²

2005

View full text Add to dashboard Cite

show abstract

“…This problem of 8 facilities was introduced by Imam and Mir [5]. Figure 4 shows the steps for accruing the initial solution.…”

Section: Test Problem #1mentioning

confidence: 99%

“…But some approaches require a feasible initial solution. These approaches use a randomly generated initial solution [5,6]. Mir and Imam [7] have proposed simulated annealing for a better initial solution.…”

Section: Introductionmentioning

confidence: 99%

Obtaining an Initial Solution for Facility Layout Problem

Sangchooli

Jokar

2013

Journal of Industrial Mathematics

View full text Add to dashboard Cite

The facility layout approaches can generally be classified into two groups, constructive approaches and improvement approaches. All improvement procedures require an initial solution which has a significant impact on final solution. In this paper, we introduce a new technique for accruing an initial placement of facilities on extended plane. It is obtained by graph theoretic facility layout approaches and graph drawing algorithms. To evaluate the performance, this initial solution is applied to rectangular facility layout problem. The solution is improved using an analytical method. The approach is then tested on five instances from the literature. Test problems include three large size problems of 50, 100, and 125 facilities. The results demonstrate effectiveness of the technique especially for large size problems.

show abstract

Nonlinear programming approach to automated topology optimization

Cited by 26 publications

References 11 publications

Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization

Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization

Computer Aided Architectural Design Futures 2005

Obtaining an Initial Solution for Facility Layout Problem

Contact Info

Product

Resources

About