Abstract
In the existing literature on the corridor allocation problem (CAP), the corridor width is not taken into consideration. But in the actual production, the corridor width plays a very important role in logistics transportation inside factories. To study the effect of the corridor width in a CAP problem, the corridor width is considered by a mixed-integer programming model proposed in this paper. Subsequently, an improved scatter search (ISS) algorithm is proposed to handle the CAP. Several improvement mechanisms have been applied to the ISS according to the special characteristics of the problem, such as the adoption of a simulated annealing operation, a dynamic reference set update method, and an improved subset generation method. The proposed ISS is evaluated on test instances of various sizes ranging from 9 to 49 facilities. Computational results demonstrate the validity of the ISS. Specifically, for small-sized instances, the acquired best solutions by the ISS are identical to the optimal solutions obtained by the exact solution given by GUROBI, while for moderate and large-sized instances, the objective values by the ISS are better than those solved by the method in GUROBI. Furthermore, the proposed algorithm shows better performance in solution quality and stability by comparing to the simulated annealing algorithm and the scatter search algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahonen H, De Alvarenga AG, Amaral ARS (2014) Simulated annealing and tabu search approaches for the corridor allocation problem. Eur J Oper Res 232(1):221–233. https://doi.org/10.1016/j.ejor.2013.07.010
Alizadeh M, Mahdavi-Amiri N, Shiripour S (2016) Modeling and solving a capacitated stochastic location-allocation problem using sub-sources. Soft Comput 20(6):2261–2280. https://doi.org/10.1007/s00500-015-1640-6
Amaral ARS (2006) On the exact solution of a facility layout problem. Eur J Oper Res 173(2):508–518. https://doi.org/10.1016/j.ejor.2004.12.021
Amaral ARS (2008) An exact approach to the one-dimensional facility layout problem. Oper Res 56(4):1026–1033. https://doi.org/10.1287/opre.1080.0548
Amaral ARS (2009) A new lower bound for the single row facility layout problem. Discrete Appl Math 157(1):183–190. https://doi.org/10.1016/j.dam.2008.06.002
Amaral ARS (2012) The corridor allocation problem. Comput Oper Res 39(12):3325–3330. https://doi.org/10.1016/j.cor.2012.04.016
Amaral ARS (2013) Optimal solutions for the double row layout problem. Optim Lett 7(2):407–413. https://doi.org/10.1007/s11590-011-0426-8
Amaral ARS, Letchford Adam N (2013) A polyhedral approach to the single row facility layout problem. Math Program 141(1–2):453–477. https://doi.org/10.1007/s10107-012-0533-z
Anjos MF, Vannelli A (2008) Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. Informs J Comput 20(4):611–617. https://doi.org/10.1287/ijoc.1080.0270
Anjos MF, Vieira MVC (2017) Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions. Eur J Oper Res 261(1):1–16
Anjos MF, Yen G (2009) Provably near-optimal solutions for very large single-row facility layout problems. Optim Methods Softw 24(4–5):805–817. https://doi.org/10.1080/10556780902917735
Attea BA, Khalil EA, Cosar A (2015) Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks. Soft Comput 19(10):2983–2995. https://doi.org/10.1007/s00500-014-1462-y
Benetti de Padua SG, Sanches Mantovani JR, Cossi AM (2015) Planning medium-voltage electric power distribution systems through a scatter search algorithm. IEEE Latin Am Trans 13(8):2637–2645. https://doi.org/10.1109/tla.2015.7332143
Chung J, Tanchoco JMA (2010) The double row layout problem. Int J Prod Res 48(3):709–727. https://doi.org/10.1080/00207540802192126
Datta D, Amaral ARS, Figueira JR (2011) Single row facility layout problem using a permutation-based genetic algorithm. Eur J Oper Res 213(2):388–394. https://doi.org/10.1016/j.ejor.2011.03.034
Deng W, Zhao HM, Zou L, Li GY, Yang XH, Wu DQ (2017) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21(15):4387–4398. https://doi.org/10.1007/s00500-016-2071-8
Deng W, Zhang SJ, Zhao HM, Yang XH (2018) A novel fault diagnosis method based on integrating empirical wavelet transform and fuzzy entropy for motor bearing. IEEE Access 6:35042–35056. https://doi.org/10.1109/access.2018.2834540
Drira A, Pierreval H, Hajri-Gabouj S (2007) Facility layout problems: a survey. Ann Rev Control 31(2):255–267. https://doi.org/10.1016/j.arcontrol.2007.04.001
Gao B, Yan Y, Zhang F, Wang G (2015) Setup planning method based on memetic algorithm. Jixie Gongcheng Xuebao J Mech Eng 51(3):162–169. https://doi.org/10.3901/JME.2015.03.162
Ghosh D, Kothari R (2012) Population heuristics for the corridor allocation problem. Iima Working Papers 98(2):33–40
Gonzalez MA, Vela CR, Varela R (2015) Scatter search with path relinking for the flexible job shop scheduling problem. Eur J Oper Res 245(1):35–45. https://doi.org/10.1016/j.ejor.2015.02.052
Hungerlander P, Anjos MF (2015) A semidefinite optimization-based approach for global optimization of multi-row facility layout. Eur J Oper Res 245(1):46–61. https://doi.org/10.1016/j.ejor.2015.02.049
Izadinia N, Eshghi K (2016) A robust mathematical model and ACO solution for multi-floor discrete layout problem with uncertain locations and demands. Comput Ind Eng 96:237–248. https://doi.org/10.1016/j.cie.2016.02.026
Jerin Leno I, Saravana Sankar S, Ponnambalam SG (2016) An elitist strategy genetic algorithm using simulated annealing algorithm as local search for facility layout design. Int J Adv Manuf Technol 84(5–8):787–799. https://doi.org/10.1007/s00170-013-5519-3
Kalita Z, Datta D (2014) Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm. Comput Oper Res 52((PART A)):123–134. https://doi.org/10.1016/j.cor.2014.07.008
Kalita Z, Datta D, Palubeckis G (2017) Bi-objective corridor allocation problem using a permutation-based genetic algorithm hybridized with a local search technique. Soft Comput 12:1–26. https://doi.org/10.1007/s00500-017-2807-0
Lin Q-L, Liu H-C, Wang D-J, Liu L (2015) Integrating systematic layout planning with fuzzy constraint theory to design and optimize the facility layout for operating theatre in hospitals. J Intell Manuf 26(1):87–95. https://doi.org/10.1007/s10845-013-0764-8
Ou-Yang C, Utamima A (2013) Hybrid estimation of distribution algorithm for solving single row facility layout problem. Comput Ind Eng 66(1):95–103. https://doi.org/10.1016/j.cie.2013.05.018
Palubeckis G (2017) Single row facility layout using multi-start simulated annealing. Comput Ind Eng 103:1–16. https://doi.org/10.1016/j.cie.2016.09.026
Samarghandi H, Taabayan P, Jahantigh FF (2010) A particle swarm optimization for the single row facility layout problem. Comput Ind Eng 58(4):529–534. https://doi.org/10.1016/j.cie.2009.11.015
Tarkesh H, Atighehchian A, Nookabadi AS (2009) Facility layout design using virtual multi-agent system. J Intell Manuf 20(4):347–357. https://doi.org/10.1007/s10845-008-0109-1
Wang S, Zuo X, Liu X, Zhao X, Li J (2015) Solving dynamic double row layout problem via combining simulated annealing and mathematical programming. Appl Soft Comput 37:303–310. https://doi.org/10.1016/j.asoc.2015.08.023
Wu D, Rong C, Bing H, Liu Y, Yin L, Guo J (2012) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput 16(10):1707–1722
Wu D, Rui Y, Zhao H, Yang X, Li G (2017a) A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm. Soft Comput 2–4:1–18
Wu D, Zhao H, Yang X, Xiong J, Meng S, Bo Li (2017b) Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl Soft Comput 59:S1568494617303472
Yang C-L, Huang R-H, Huang H-L (2011) Elucidating a layout problem in the fashion industry by using an ant optimisation approach. Prod Plann Control 22(3):248–256. https://doi.org/10.1080/09537287.2010.498600
Zhang Z, Murray CC (2012) A corrected formulation for the double row layout problem. Int J Prod Res 50(15):4220–4223. https://doi.org/10.1080/00207543.2011.603371
Zhao HM, Sun M, Deng W, Yang XH (2017) A new feature extraction method based on EEMD and multi-scale fuzzy entropy for motor bearing. Entropy 19(1):21. https://doi.org/10.3390/e19010014
Zhao H, Yao R, Xu L, Yuan Y, Li G, Deng W (2018) Study on a novel fault damage degree identification method using high-order differential mathematical morphology gradient spectrum entropy. Entropy 20:682
Acknowledgements
This research was partially supported by the National Natural Science Foundation of China (No. 51205328, 51675450), the Youth Foundation for Humanities, Social Sciences of Ministry of Education of China (No. 18YJC630255) and Sichuan Science and Technology Program (No. 2019YFG0285).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Human and animal rights
This article does not contain any studies with human participants performed by any of the authors.
Additional information
Communicated by V. Loia.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Rights and permissions
About this article
Cite this article
Zhang, Z., Mao, L., Guan, C. et al. An improved scatter search algorithm for the corridor allocation problem considering corridor width. Soft Comput 24, 461–481 (2020). https://doi.org/10.1007/s00500-019-03925-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-019-03925-4