A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem

European Journal of Operational Research

Volumn 256, Issue 3, 2017, Pages 742-756

  Paes, Frederico Galaxe ^a   Pessoa, Artur Alves ^b   Vidal, Thibaut ^c  

^a Campus Itaperuna   (Brazil)

^b FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^c PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Decomposition strategies; Facility layout; Genetic algorithm; Hybrid metaheuristics

Indexed keywords

MATERIALS HANDLING; PLANT LAYOUT;

ALGORITHMIC APPROACH; DECOMPOSITION METHODS; DECOMPOSITION PHASIS; DECOMPOSITION STRATEGY; FACILITY LAYOUT; HYBRID GENETIC ALGORITHMS; HYBRID METAHEURISTICS; UNEQUAL AREA FACILITY LAYOUT PROBLEMS;

GENETIC ALGORITHMS;

EID: 84991251981     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2016.07.022     Document Type: Article

References (19)

1. Drira, A., Pierreval, H., Hajri-Gabouj, S., Facility layout problems: A survey. Annual Reviews in Control 31:2 (2007), 255–267.
2. Dunker, T., Radons, G., Westkämper, E., A coevolutionary algorithm for a facility layout problem. International Journal of Production Research 41:15 (2003), 3479–3500.
3. Garey, M.R., Johnson, D.S., Stockmeyer, L., Some simplified np-complete graph problems. Theoretical computer science 1:3 (1976), 237–267.
4. Gonçalves, J.F., Resende, M.G.C., A biased random-key genetic algorithm for the unequal area facility layout problem. European Journal of Operational Research 246:1 (2015), 86–107.
5. Imam, M.H., Mir, M., Automated layout of facilities of unequal areas. Computers & Industrial Engineering 24 (1993), 355–366.
6. Imam, M.H., Mir, M., Cluster boundary search algorithm for building-block layout optimization. Advances in Engineering Software 29:2 (1998), 165–173.
7. Kado, K., An investigation of genetic algorithms for facility layout problems, 1996, Ph.D. thesis University of Edinburgh.
8. Komarudin, K.Y.W., Applying ant system for solving unequal area facility layout problems. European Journal of Operational Research 202:3 (2010), 730–746.
9. Kulturel-Konak, S., Konak, A., A new relaxed flexible bay structure representation and particle swarm optimization for the unequal area facility layout problem. Engineering Optimization 43:12 (2011), 1263–1287.
10. Lai, K.K., Chan, J.W.M., Developing a simulated annealing algorithm for the cutting stock problem. Computers & Industrial Engineering 32:1 (1997), 115–127.
11. McKendall, A.R., Hakobyan, A., Heuristics for the dynamic facility layout problem with unequal-area departments. European Journal of Operational Research 201:1 (2010), 171–182.
12. Mir, M., Imam, M.H., Analytic annealing for macrocell placement optimization. Computers & Electrical Engineering 22 (1996), 169–177.
13. Mir, M., Imam, M.H., A hybrid optimization approach for layout design of unequal-area facilities. Computers & Industrial Engineering 39:1 (2001), 49–63.
14. Scholz, D., Petrick, A., Domschke, W., Stats: a slicing tree and tabu search based heuristic for the unequal area facility layout problem. European Journal of Operational Research 197:1 (2009), 166–178.
15. Singh, S.P., Sharma, R.R.K., A review of different approaches to the facility layout problems. The International Journal of Advanced Manufacturing Technology 30:5–6 (2006), 425–433.
16. Syswerda, G., Palmucci, J., The application of genetic algorithms to resource scheduling. Proceedings of International Computer Games association, ICGA, 1991, 502–508.
17. Taillard, E.D., Voss, S., Popmusic–partial optimization metaheuristic under special intensification conditions. Essays and surveys in metaheuristics, 2002, Springer, 613–629.
18. Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., Facilities planning, 2010, John Wiley & Sons.
19. VIP-PLANOPT (2006). VIP-PLANOPT 2006 user's manual. Engineering Optimization Software. http://www.planopt.com.