meta-heuristic algorithms to solve the problem of terminal facilities on a real scale
Subject Areas : Operation Research
مهدی
فضلی
1
(دانشگاه ازاد تبریز)
فرزین
مدرس خیابانی
2
(دانشگاه آزاد تبریز)
بهروز
دانشیان
3
(دآنشگاه ازاد تهران)
Keywords: Simulated Annealing, Tabu search, Terminal facility layout problem, Migrating birds optimization, Optimization problem,
Abstract :
a b s t r a c tOur main goal in this article is to arrange terminal facilities, place different departments, stores and units in predefined areas in such a way as to minimize the cost of moving customers and transportation staff. Especially in large-scale terminals with several different transport segments, it is important for terminal performance to be close to interactive units. Today, meta-heuristic methods are often used to solve optimization problems such as facility design. in this study; The design of the various units, stores, and rooms of a large-scale real terminal was organized using three meta-heuristic algorithms: Migratory Bird Optimization (MBO), Taboo Search (TS), and Simulated Simulation (SA). The results were compared with the existing terminal design. As a result, MBO and SA metaheuristic algorithms have provided the best results, which improve the efficiency of the existing terminal design to an acceptable level.
Alfredo Tang Montané, F., & Galvão, R. D. (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research, 33(3), 595-619. doi:https://doi.org/10.1016/j.cor.2004.07.009
Amaral, A. R. (2009). A new lower bound for the single row facility layout problem. Discrete Applied Mathematics, 157(1), 183-190.
Aydin, M. E., & Fogarty, T. C. (2004). A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. Journal of heuristics, 10(3), 269-292.
Azadivar, F., & Wang, J. (2000). Facility layout optimization using simulation and genetic algorithms. International Journal of Production Research, 38(17), 4369-4383.
Barbosa-Póvoa, A. P., Mateus, R., & Novais, A. Q. (2001). Optimal two-dimensional layout of industrial facilities. International Journal of Production Research, 39(12), 2567-2593.
Chan, K. Y., Aydin, M. E., & Fogarty, T. C. (2006). Main effect fine-tuning of the mutation operator and the neighbourhood function for uncapacitated facility location problems. Soft Computing, 10(11), 1075-1090.
Cheng, M.-Y., & Lien, L.-C. (2012). A hybrid AI-based particle bee algorithm for facility layout optimization. Engineering with Computers, 28(1), 57-69.
Duman, E., & Elikucuk, I. (2013). Solving credit card fraud detection problem by the new metaheuristics migrating birds optimization. Paper presented at the International Work-Conference on Artificial Neural Networks.
Duman, E., Uysal, M., & Alkaya, A. F. (2012). Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Information Sciences, 217, 65-77.
Fiechter, C. N. (1994). A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics, 51(3), 243-267. doi:https://doi.org/10.1016/0166-218X(92)00033-I
Gao, K.-Z., Suganthan, P. N., & Chua, T. J. (2013). An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem. Paper presented at the 2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched).
García, S., Molina, D., Lozano, M., & Herrera, F. (2008). A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization. Journal of heuristics, 15(6), 617. doi:10.1007/s10732-008-9080-4
Glover, F. (1989). Tabu Search—Part I. ORSA Journal on Computing, 1(3), 190-206. doi:10.1287/ijoc.1.3.190
Grabowski, J., & Wodecki, M. (2004). A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research, 31(11), 1891-1909. doi:https://doi.org/10.1016/S0305-0548(03)00145-X
Hacibeyoglu, M., Alaykiran, K., Acilar, A. M., Tongur, V., & Ulker, E. (2018). A comparative analysis of metaheuristic approaches for multidimensional two-way number partitioning problem. Arabian Journal for Science and Engineering, 43(12), 7499-7520.
Huyen, D. T. T., Binh, N. T., Tuan, T. M., Trung, T. Q., Nhu, N. G., Dey, N., & Son, L. H. (2017). Analyzing trends in hospital-cost payments of patients using ARIMA and GIS: Case study at the Hanoi Medical University Hospital, Vietnam. Journal of Medical Imaging and Health Informatics, 7(2), 421-429.
Ileri, Y. (2013). The Importance of Layout Organization in Hospital Management Efficiency: A Model in SU Medical Faculty Hospital. Selcuk University.
Kaveh, A., & Sharafi, P. (2011). Charged system search algorithm for minimax and minisum facility layout problems.
Kulturel-Konak, S., & Konak, A. (2015). A large-scale hybrid simulated annealing algorithm for cyclic facility layout problems. Engineering Optimization, 47(7), 963-978. doi:10.1080/0305215X.2014.933825
Lacksonen, T. A. (1997). Preprocessing for static and dynamic facility layout problems. International Journal of Production Research, 35(4), 1095-1106. doi:10.1080/002075497195560
Lee, Y. H., & Lee, M. H. (2002). A shape-based block layout approach to facility layout problems using hybrid genetic algorithm. Computers & Industrial Engineering, 42(2-4), 237-248.
Li, Z., Janardhanan, M. N., Ashour, A. S., & Dey, N. (2019). Mathematical models and migrating birds optimization for robotic U-shaped assembly line balancing problem. Neural Computing and Applications, 31(12), 9095-9111.
Mafarja, M. M., & Mirjalili, S. (2017). Hybrid Whale Optimization Algorithm with simulated annealing for feature selection. Neurocomputing, 260, 302-312. doi:https://doi.org/10.1016/j.neucom.2017.04.053
Meller, R. D., & Gau, K.-Y. (1996). The facility layout problem: recent and emerging trends and perspectives. Journal of manufacturing systems, 15(5), 351-366.
Meng, T., Pan, Q.-K., Li, J.-Q., & Sang, H.-Y. (2018). An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm and Evolutionary Computation, 38, 64-78.
Mohammadi, M., & Forghani, K. (2014). A novel approach for considering layout problem in cellular manufacturing systems with alternative processing routings and subcontracting approach. Applied Mathematical Modelling, 38(14), 3624-3640.
Pan, Q.-K., & Dong, Y. (2014). An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation. Information Sciences, 277, 643-655.
ŞAHİN, R., & Turkbey, O. (2010). A new hybrid heuristic algorithm for the multi objective facility layout problem. Journal of the Faculty of Engineering and Architecture of Gazi University, 25(1).
Sarma, S. (2009). Demand for outpatient healthcare. Applied health economics and health policy, 7(4), 265-277.
Shayan*, E., & Chittilappilly, A. (2004). Genetic algorithm for facilities layout problems based on slicing tree structure. International Journal of Production Research, 42(19), 4055-4067.
Shivasankaran, N., Kumar, P. S., & Raja, K. V. (2015). Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling. International Journal of Computational Intelligence Systems, 8(3), 455-466. doi:10.1080/18756891.2015.1017383
Singh, S. P., & Sharma, R. R. (2006). A review of different approaches to the facility layout problems. The International Journal of Advanced Manufacturing Technology, 30(5), 425-433.
Sioud, A., & Gagné, C. (2018). Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. European Journal of Operational Research, 264(1), 66-73.
Tompkins, J. A., White, J. A., Bozer, Y. A., & Tanchoco, J. M. A. (2010). Facilities planning: John Wiley & Sons.
Tongur, V., & Ülker, E. (2014). Migrating birds optimization for flow shop sequencing problem. Journal of Computer and Communications, 2(4), 142-147.
Tongur, V., & Ülker, E. (2016). The analysis of migrating birds optimization algorithm with neighborhood operator on traveling salesman problem. In Intelligent and Evolutionary Systems (pp. 227-237): Springer.
Tongur, V., & Ülker, E. (2019). PSO-based improved multi-flocks migrating birds optimization (IMFMBO) algorithm for solution of discrete problems. Soft Computing, 23(14), 5469-5484.
Zhan, S.-h., Lin, J., Zhang, Z.-j., & Zhong, Y.-w. (2016). List-Based Simulated Annealing Algorithm for Traveling Salesman Problem. Computational Intelligence and Neuroscience, 2016, 1712630. doi:10.1155/2016/1712630
Zhang, B., Pan, Q.-k., Gao, L., Zhang, X.-l., Sang, H.-y., & Li, J.-q. (2017). An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Applied Soft Computing, 52, 14-27.