• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • Export Citation Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
Journal of Quality Engineering and Production Optimization
Articles in Press
Current Issue
Journal Archive
Volume Volume 2 (2017)
Volume Volume 1 (2015)
Issue Issue 2
Issue Issue 1
Barzinpour, F., Mohammadpour Omran, M., Hoseini, S., Fahimi, K., Samaei, F. (2015). A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem. Journal of Quality Engineering and Production Optimization, 1(1), 11-20. doi: 10.22070/jqepo.2015.185
Farnaz Barzinpour; Mohammad Mohammadpour Omran; Seyed Farzad Hoseini; Kaveh Fahimi; Farshid Samaei. "A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem". Journal of Quality Engineering and Production Optimization, 1, 1, 2015, 11-20. doi: 10.22070/jqepo.2015.185
Barzinpour, F., Mohammadpour Omran, M., Hoseini, S., Fahimi, K., Samaei, F. (2015). 'A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem', Journal of Quality Engineering and Production Optimization, 1(1), pp. 11-20. doi: 10.22070/jqepo.2015.185
Barzinpour, F., Mohammadpour Omran, M., Hoseini, S., Fahimi, K., Samaei, F. A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem. Journal of Quality Engineering and Production Optimization, 2015; 1(1): 11-20. doi: 10.22070/jqepo.2015.185

A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem

Article 2, Volume 1, Issue 1, Winter and Spring 2015, Page 11-20  XML PDF (162 K)
Document Type: Research Paper
DOI: 10.22070/jqepo.2015.185
Authors
Farnaz Barzinpour1; Mohammad Mohammadpour Omran1; Seyed Farzad Hoseini* 1; Kaveh Fahimi1; Farshid Samaei2
1Department of Industrial Engineering, Iran University of Science & Technology, Tehran, Iran
2Department of Civil and Engineering, Ports & Maritime Organization, Bandar Abbas, Iran
Abstract
The dynamic facility layout problem (DFLP) is the problem of finding positions of departments on
the plant floor for multiple periods (material flows between departments change during the planning horizon)
such that departments do not overlap, and the sum of the material handling and rearrangement costs is
minimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasive Weeds
Optimization (IWO) is utilized to solve the well-known DFLP. IWO is a simple algorithm which uses basic
characteristics of a colony of weeds such as proliferation, growth and competition.
A set of reference numerical problems is taken in order to evaluate the efficiency of the algorithm compared
with the Dynamic Programming method which had been applied to solve the addressed problem. In order to
verify the efficiency of the proposed algorithm a wide range of experiments are carried out to compare
the proposed algorithm. Computational results have indicated that the DIWO algorithm is capable of
obtaining optimal solutions for small and medium-scaled problems very efficiently.
Keywords
Discrete Invasive Weed Optimization; Dynamic Facility layout Problem; Dynamic Programming
References

1. Rosenblatt, M.J. (1986). “The dynamics of plant layout”, Management Science, 32(1) pp. 76-86.

2. Lin, X., Floudas, C., & Kallrath, J. (2005). “Global Solution Approach for a Nonconvex MINLP Problem in Product Portfolio Optimization”, Journal of Global Optimization, 32(3) pp.417-431.

3. Urban, L. (1998). “Solution procedures for the dynamic facility layout problem,” Annals of Operations Research, 76 pp. 323–

342.

4. Lacksonen, T.A., & Enscore E.E.( 1993). “Quadratic assignment algorithms for the dynamic layout problem”International

Journal of Production Research, 31(3) 503–517.

5. Balakrishnan, J., & Cheng, C.H.( 2000). “Genetic search and the dynamic layout problem,” Computers and Operations Research,

27(6) pp. 587–593.

6. Kaku, B. K., & Mazzola, J. B.( 1997).“A tabu-search heuristic for the dynamic plant layout problem,”INFORMS Journal on

Computing, 9(4) pp. 374–384.

7. Baykasoglu, A., & Gindy, N. N. Z. ( 2001). “A simulated annealing algorithm for dynamic facility layout problem,”

Computers and Operations Research, 28(14) pp. 1403–1426.

8. Balakrishnan, J., Cheng, C. H., Conway, D. G., & Lau, C. M.( 2003). “A hybrid genetic algorithm for the dynamic plant layoutproblem

,” International Journal of Production Economics, 86(2) pp. 107–120.

9. Erel, E., Ghosh, J. B, & Simon, J. T.( 2003). “New heuristic for the dynamic layout problem,”Journal of the Operational

Research Society, 56(8) p. 1001.

10. McKendall, A. R., & Shang, J.( 2006). “Hybrid ant systems for the dynamic facility layout problem,”Computers & Operations

Research, 33(3) pp. 790–803.

11. McKendall, A. R., Shang, J., & Kuppusamy, S.( 2006). “Simulated annealing heuristics for the dynamic facility layout problem,”Computers and Operations Research, 33(8) pp. 2431–2444.

12. Rodriguez, J. M., MacPhee, F. C., Bonham, D. J., & Bhavsar, V. C.( 2006). “Solving the dynamic plant layout problem using a new hybrid meta-heuristic algorithm,”International Journal of High Performance Computing and Networking, 4(5-6)pp. 286–294.

13. Krishnan, K. K., Cheraghi, S. H., & Nayak, C. N.( 2006). “Dynamic from-between charts: a new tool for solving dynamic facility layout problems,” International Journal of Industrial and Systems Engineering, 11(1-2) pp. 182–200.

14. Ripon, Kazi Shah Nawaz, et al (2011). “Dynamic facility layout problem under uncertainty: a Pareto-optimality based multiobjective evolutionary approach.”Central European Journal of Computer Science, 1.4 pp. 375-386.

15. Emami, S., & Nookabadi, A.S. (2013).“Managing a new multi-objective model for the dynamic facility layout problem”,

The International Journal of Advanced Manufacturing Technology”, 68.9-12 pp. 2215-2228.

16. Balakrishnan, J., & Cheng, C. H. (1998) .“Dynamic layout algorithms: a state-of-the-art survey”, 26(4) pp. 507–521.

17. Kulturel-Konak, S. ( 2007). “Approaches to uncertainties in facility layout problems: perspectives at the beginning of the 21st Century,”Journal of Intelligent Manufacturing, 18(2) pp. 273–284.

18. Mehrabian, A. R., & Lucas, C.( 2006) .“A novel numerical optimization algorithm inspired from weed colonization.”

Journal of Ecological Informatics , vol. 1 pp. 355–366.

19. Mehrabian, A., & Yousefi-Koma, A. ( 2007). “Optimal positioning of piezoelectric actuators on a smart fin using bio-inspired algorithms”Aerospace Science and Technology, vol. 11 pp. 174–182.

20. Rad, H., Lucas, C. ( 2008). “A recomniender system based on invasive weed optimization algorithm”, in: 2007

IEEE Congress on Evolutionary Computation, CEC 2007 pp. 4297–4304.

21. Ghalenoei, M., Hajimirsadeghi, H., Lucas, C. (2009).“Discrete invasive weed optimization algorithm: application to cooperative multiple task assignment of UAVs”, in: Proceedings of the IEEE Conference on Decision and Control, pp. 1665–1670.

 

Statistics
Article View: 980
PDF Download: 973
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

Journal Management System. Designed by sinaweb.