A flower pollination algorithm for the double-floor corridor allocation problemFootnote^†

† This work was carried out in School of Mechanical Engineering, Southwest Jiaotong University, ChengDu.

References

• Abdel-Baset, Mohamed, Haizhou Wu, Yongquan Zhou, and Lila Abdel-Fatah. 2017. “Elite Opposition-Flower Pollination Algorithm for Quadratic Assignment Problem.” Journal of Intelligent and Fuzzy Systems 33 (2): 901–911. doi:10.3233/JIFS-162141.
   Web of Science ®Google Scholar
• Abdel-Basset, Mohamed, and Laila A. Shawky. 2018. “Flower Pollination Algorithm: a Comprehensive Review.” Artificial Intelligence Review (11): 1–25. doi:10.1007/s10462-018-9624-4.
   Google Scholar
• Ahmadi, Abbas, Mir Saman Pishvaee, and Mohammad Reza Akbari Jokar. 2017. “A Survey on Multi-Floor Facility Layout Problems.” Computers and Industrial Engineering 107: 158–170. doi:10.1016/j.cie.2017.03.015.
   Web of Science ®Google Scholar
• Ahonen, H., A. G. De Alvarenga, and A. R. S. Amaral. 2014. “Simulated Annealing and Tabu Search Approaches for the Corridor Allocation Problem.” European Journal of Operational Research 232 (1): 221–233. doi:10.1016/j.ejor.2013.07.010.
   Google Scholar
• Amaral, Andre R. S. 2008. “An Exact Approach to the one-Dimensional Facility Layout Problem.” Operations Research 56 (4): 1026–1033. doi:10.1287/opre.1080.0548.
   Web of Science ®Google Scholar
• Amaral, Andre R. S. 2012. “The Corridor Allocation Problem.” Computers and Operations Research 39 (12): 3325–3330. doi:10.1016/j.cor.2012.04.016.
   Web of Science ®Google Scholar
• Amaral, Andre R. S. 2013a. “Optimal Solutions for the Double row Layout Problem.” Optimization Letters 7 (2): 407–413. doi:10.1007/s11590-011-0426-8.
   Web of Science ®Google Scholar
• Amaral, Andre R. S. 2013b. “A Parallel Ordering Problem in Facilities Layout.” Computers and Operations Research 40 (12): 2930–2939. doi:10.1016/j.cor.2013.07.003.
   Web of Science ®Google Scholar
• Amaral, André R. S. 2018. “A Mixed-Integer Programming Formulation for the Double row Layout of Machines in Manufacturing Systems.” International Journal of Production Research 1–14. doi:10.1080/00207543.2018.1457811.
   Web of Science ®Google Scholar
• Anjos, Miguel F., Anja Fischer, and Philipp Hungerlander. 2018. “Improved Exact Approaches for row Layout Problems with Departments of Equal Length.” European Journal of Operational Research 270 (2): 514–529. doi:10.1016/j.ejor.2018.04.008.
   Web of Science ®Google Scholar
• Anjos, Miguel F., and Anthony Vannelli. 2008. “Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes.” Informs Journal on Computing 20 (4): 611–617. doi:10.1287/ijoc.1080.0270.
   Web of Science ®Google Scholar
• Anjos, Miguel F., and Manuel V. C. Vieira. 2017. “Mathematical Optimization Approaches for Facility Layout Problems: The State-of-the-art and Future Research Directions.” European Journal of Operational Research 261 (1): 1–16.
   Web of Science ®Google Scholar
• Anjos, Miguel F., and Ginger Yen. 2009. “Provably Near-Optimal Solutions for Very Large Single-row Facility Layout Problems.” Optimization Methods & Software 24 (4–5): 805–817. doi:10.1080/10556780902917735.
   Web of Science ®Google Scholar
• Braglia, Marcello, Simone Zanoni, and Lucio Zavanella. 2003. “Layout Design in Dynamic Environments: Strategies and Quantitative Indices.” International Journal of Production Research 41 (5): 995–1016. doi:10.1080/00207540210162983.
   Web of Science ®Google Scholar
• Chung, Jaewoo, and J. M. A. Tanchoco. 2010. “The Double row Layout Problem.” International Journal of Production Research 48 (3): 709–727. doi:10.1080/00207540802192126.
   Web of Science ®Google Scholar
• Datta, Dilip, Andre R. S. Amaral, and Jose Rui Figueira. 2011. “Single row Facility Layout Problem Using a Permutation-Based Genetic Algorithm.” European Journal of Operational Research 213 (2): 388–394. doi:10.1016/j.ejor.2011.03.034.
   Web of Science ®Google Scholar
• Djellab, H., and M. Gourgand. 2001. “A new Heuristic Procedure for the Single-row Facility Layout Problem.” International Journal of Computer Integrated Manufacturing 14 (3): 270–280. doi:10.1080/09511920010020721.
   Web of Science ®Google Scholar
• Feng, Jianguang, and Ada Che. 2018. “Novel Integer Linear Programming Models for the Facility Layout Problem with Fixed-Size Rectangular Departments.” Computers and Operations Research 95: 163–171. doi:10.1016/j.cor.2018.03.013.
   Web of Science ®Google Scholar
• Fischer, A., F. Fischer, and P. Hungerlander. 2017. “A New Exact Approach to the Space-Free Double Row Layout Problem.” In Operations Research Proceedings 2015, edited by K. F. Doerner, I. Ljubic, G. Pflug, and G. Tragler, 125–130. Cham: Springer International Publishing Ag.
   Google Scholar
• Gao, Yang Jun, Feng Ming Zhang, Qing Guo, and Chao Li. 2018. “Research on the Searching Performance of Flower Pollination Algorithm with Three Random Walks.” Journal of Intelligent and Fuzzy Systems 35 (1): 333–341. doi:10.3233/JIFS-169592.
   Web of Science ®Google Scholar
• Ghosh, Diptesh, and Ravi Kothari. 2012. “Population Heuristics for the Corridor Allocation Problem.” Iima Working Papers 98 (2): 33–40.
   Google Scholar
• Hong, Dongphyo, Yoonho Seo, and Yujie Xiao. 2014. “A Concurrent Approach for Facility Layout and AMHS Design in Semiconductor Manufacturing.” International Journal of Industrial Engineering: Theory Applications and Practice 21 (4): 231–242.
   Web of Science ®Google Scholar
• Hungerlaender, Philipp, and Franz Rendl. 2013. “A Computational Study and Survey of Methods for the Single-row Facility Layout Problem.” Computational Optimization And Applications 55 (1): 1–20. doi:10.1007/s10589-012-9505-8.
   Web of Science ®Google Scholar
• Hungerländer, Philipp, and Miguel F. Anjos. 2015. “A Semidefinite Optimization-Based Approach for Global Optimization of Multi-row Facility Layout.” European Journal of Operational Research 245 (1): 46–61. doi:10.1016/j.ejor.2015.02.049.
   Web of Science ®Google Scholar
• Irawan, Chandra Ade, Xiang Song, Dylan Jones, and Negar Akbari. 2017. “Layout Optimisation for an Installation Port of an Offshore Wind Farm.” European Journal of Operational Research 259 (1): 67–83. doi:10.1016/j.ejor.2016.09.032.
   Web of Science ®Google Scholar
• Izadinia, Niloufar, and Kourosh Eshghi. 2016. “A Robust Mathematical Model and ACO Solution for Multi-Floor Discrete Layout Problem with Uncertain Locations and Demands.” Computers and Industrial Engineering 96: 237–248. doi:10.1016/j.cie.2016.02.026.
   Web of Science ®Google Scholar
• Kalita, Zahnupriya, and Dilip Datta. 2014. “Solving the bi-Objective Corridor Allocation Problem Using a Permutation-Based Genetic Algorithm.” Computers and Operations Research 52 (PART A): 123–134. doi:10.1016/j.cor.2014.07.008.
   Web of Science ®Google Scholar
• Kalita, Zahnupriya, Dilip Datta, and Gintaras Palubeckis. 2017. “Bi-objective Corridor Allocation Problem Using a Permutation-Based Genetic Algorithm Hybridized with a Local Search Technique.” Soft Computing (12): 1–26. doi:10.1007/s00500-017-2807-0.
   Google Scholar
• Lin, Qing-Lian, Hu-Chen Liu, Duo-Jin Wang, and Long Liu. 2013. “Integrating Systematic Layout Planning with Fuzzy Constraint Theory to Design and Optimize the Facility Layout for Operating Theatre in Hospitals.” Journal of Intelligent Manufacturing 26 (1): 87–95. doi:10.1007/s10845-013-0764-8.
   Web of Science ®Google Scholar
• Mao, Lili, Zeqiang Zhang, Kaipu Wang, and Binsen Zou. 2017. “Improved Scatter Search Algorithm for Corridor Allocation Problem.” Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS 23 (8): 1641–1651. doi:10.13196/j.cims.2017.08.005.
   Google Scholar
• Murray, Chase C., Alice E. Smith, and Zeqiang Zhang. 2013. “An Efficient Local Search Heuristic for the Double row Layout Problem with Asymmetric Material Flow.” International Journal of Production Research 51 (20): 6129–6139. doi:10.1080/00207543.2013.803168.
   Web of Science ®Google Scholar
• Nabil, Emad. 2016. “A Modified Flower Pollination Algorithm for Global Optimization.” Expert Systems with Applications 57: 192–203. doi:10.1016/j.eswa.2016.03.047.
   Web of Science ®Google Scholar
• Pourvaziri, Hani, and Henri Pierreval. 2017. “Dynamic Facility Layout Problem Based on Open Queuing Network Theory.” European Journal of Operational Research 259 (2): 538–553. doi:10.1016/j.ejor.2016.11.011.
   Web of Science ®Google Scholar
• Wang, Rui, Yongquan Zhou, Shilei Qiao, and Kang Huang. 2016. “Flower Pollination Algorithm with Bee Pollinator for Cluster Analysis.” Information Processing Letters 116 (1): 1–14. doi:10.1016/j.ipl.2015.08.007.
   Web of Science ®Google Scholar
• Yang, Xin-She. 2012. Flower pollination algorithm for global optimization. Paper presented at the 11th International Conference on Unconventional Computation and Natural Computation, UCNC 2012, September 3, 2012 - September 7, 2012, Orleans, France.
   Google Scholar
• Zhang, Mingxin, Jiao Dai, Jinlong Zheng, and Guohai Zhang. 2016. An Improved Flower Pollination Algorithm. Paper presented at the 13th Web Information Systems and Applications Conference, WISA 2016, September 23, 2016–September 25, 2016, Wuhan, Hubei, China.
   Google Scholar
• Zhou, Yongquan, and Rui Wang. 2016. “An Improved Flower Pollination Algorithm for Optimal Unmanned Undersea Vehicle Path Planning Problem.” International Journal of Pattern Recognition and Artificial Intelligence 30 (4), doi:10.1142/S0218001416590102.
   Web of Science ®Google Scholar
• Zhou, Yongquan, Rui Wang, Chengyan Zhao, Qifang Luo, and Mohamed A. Metwally. 2017. “Discrete Greedy Flower Pollination Algorithm for Spherical Traveling Salesman Problem.” Neural Computing & Applications (5): 1–16. doi:10.1007/s00521-017-3176-4.
   Google Scholar
• Zhou, Guo, Rui Wang, and Yongquan Zhou. 2018. “Flower Pollination Algorithm with Runway Balance Strategy for the Aircraft Landing Scheduling Problem.” Cluster Computing 21 (3): 1543–1560. doi:10.1007/s10586-018-2051-0.
   Web of Science ®Google Scholar
• Zhou, Yongquan, Sen Zhang, Qifang Luo, and Chunming Wen. 2018. “Using Flower Pollination Algorithm and Atomic Potential Function for Shape Matching.” Neural Computing and Applications 29 (6): 21–40. doi:10.1007/s00521-016-2524-0.
   Web of Science ®Google Scholar