Applications of biased randomised algorithms and simheuristics to asset and liability management

Asset and Liability Management (ALM) has captured the attention of academics and financial researchers over the last few decades. On the one hand, we need to try to maximise our wealth by taking advantage of the financial market and, on the other hand, we need to cover our payments (liabilities) over time. The purpose of ALM is to give investors a series of resources or techniques to select the appropriate assets on the financial market that respond to the aforementioned two key factors: cover our liabilities and maximise our wealth. This thesis presents a set of techniques that are capable of tackling realistic financial problems without the usual requirement of considerable computational resources. These techniques are based on heuristics and simulation. Specifically, a biased randomised metaheuristic model is developed that has a direct application in the way insurance companies usually operate. The algorithm makes it possible to efficiently select the smallest number of assets, mainly fixed income, on the balance sheet while guaranteeing the company's obligations. This development allows for the incorporating of the credit quality of the issuer of the assets used. Likewise, a portfolio optimisation model with liabilities is developed and solved with a genetic algorithm. The portfolio optimisation problem differs from the usual one in that it is multi-period, and incorporates liabilities over time. Additionally, the possibility of external financing is included when the entity does not have sufficient cash. These conditions give rise to a complex problem that is efficiently solved by an evolutionary algorithm. In both cases, the algorithms are improved with the incorporation of Monte Carlo simulation. This allows the solutions to be robust when considering realistic market situations. The results are very promising. This research shows that simheuristics is an ideal method for this type of problem.La gestión de activos y pasivos (asset and liability management, ALM) ha acaparado la atención de académicos e investigadores financieros en las últimas décadas. Por un lado, debemos tratar de maximizar nuestra riqueza aprovechando el mercado financiero, y por otro, debemos cubrir nuestros pagos (pasivos) a lo largo del tiempo. El objetivo del ALM es dotar al inversor de una serie de recursos o técnicas para seleccionar los activos del mercado financiero adecuados para obedecer a los dos factores clave mencionados: cumplir con nuestros pasivos y maximizar nuestra riqueza. Esta tesis presenta un conjunto de técnicas que son capaces de abordar problemas financieros realistas sin la necesidad habitual de considerables recursos computacionales. Estas técnicas se basan en la heurística y la simulación. En concreto, se desarrolla un modelo metaheurístico sesgado que tiene una aplicación directa en la operación habitual de inmunización de las compañías de seguros. El algoritmo permite seleccionar eficientemente el menor número de activos, principalmente de renta fija, en el balance y garantizar las obligaciones de la compañía. Este desarrollo permite incorporar la calidad crediticia del emisor de los activos utilizados. Asimismo, se desarrolla un modelo de optimización de la cartera con el pasivo y se resuelve con un algoritmo genético. El problema de optimización de la cartera difiere del habitual en que es multiperiodo e incorpora los pasivos a lo largo del tiempo. Además, se incluye la posibilidad de financiación externa cuando la entidad no tiene suficiente efectivo. Estas condiciones dan lugar a un problema complejo que se resuelve eficientemente mediante un algoritmo evolutivo. En ambos casos, los algoritmos se mejoran con la incorporación de la simulación de Montecarlo. Esto permite que las soluciones sean robustas cuando consideramos situaciones de mercado realistas. Los resultados son muy prometedores. Esta investigación demuestra que la simheurística es un método ideal para este tipo de problemas.La gestió d'actius i passius (asset and liability management, ALM) ha acaparat l'atenció d'acadèmics i investigadors financers les darreres dècades. D'una banda, hem de mirar de maximitzar la nostra riquesa aprofitant el mercat financer, i de l'altra, hem de cobrir els nostres pagaments (passius) al llarg del temps. L'objectiu de l'ALM és dotar l'inversor d'una sèrie de recursos o tècniques per seleccionar els actius del mercat financer adequats per obeir als dos factors clau esmentats: complir els passius i maximitzar la nostra riquesa. Aquesta tesi presenta un conjunt de tècniques que són capaces d'abordar problemes financers realistes sense la necessitat habitual de recursos computacionals considerables. Aquestes tècniques es basen en l'heurística i la simulació. En concret, es desenvolupa un model metaheurístic esbiaixat que té una aplicació directa a l'operació habitual d'immunització de les companyies d'assegurances. L'algorisme permet seleccionar eficientment el menor nombre d'actius, principalment de renda fixa, al balanç i garantir les obligacions de la companyia. Aquest desenvolupament permet incorporar la qualitat creditícia de l'emissor dels actius utilitzats. Així mateix, es desenvolupa un model d'optimització de la cartera amb el passiu i es resol amb un algorisme genètic. El problema d'optimització de la cartera difereix de l'habitual en el fet que és multiperíode i incorpora els passius al llarg del temps. A més, s'inclou la possibilitat de finançament extern quan l'entitat no té prou efectiu. Aquestes condicions donen lloc a un problema complex que es resol eficientment mitjançant un algorisme evolutiu. En tots dos casos, els algorismes es milloren amb la incorporació de la simulació de Montecarlo. Això permet que les solucions siguin robustes quan considerem situacions de mercat realistes. Els resultats són molt prometedors. Aquesta recerca demostra que la simheurística és un mètode ideal per a aquesta mena de problemes.Tecnologías de la información y de rede

A simulation-based optimisation for the stochastic green capacitated p-median problem

Purpose: This paper aims to propose a new model called the stochastic green capacitated p-median problem with a simulation-based optimisation approach. An integer linear programming mathematical model is built considering the total emission produced by vehicles and the uncertain parameters including the travel cost for a vehicle to travel from a particular facility to a customer and the amount of CO2 emissions produced. We also develop a simulation-based optimisation algorithm for solving the problem. Design/methodology/approach: The authors proposed new algorithms to solve the problem. The proposed algorithm is a hybridisation of Monte Carlo simulation and a Variable Neighbourhood Search matheuristic. The proposed model and method are evaluated using instances that are available in the literature. Findings: Based on the results produced by the computational experiments, the developed approach can obtain interesting results. The obtained results display that the proposed method can solve the problems within a short computational time and the solutions produced have good quality (small deviations). Originality/value: To the best of our knowledge, there is no paper in the previous literature investigating the simulation-based optimisation for the stochastic green capacitated p-median problem. There are two main contributions in this paper. First, to build a new model for the capacitated p-median problem taking into account the environmental impact. Second, to design a simulation-based optimisation approach to solve the stochastic green capacitated p-median problem incorporating VNS-based matheuristic and Monte Carlo simulationPeer Reviewe

Overview of Dynamic Facility Layout Planning as a Sustainability Strategy

[EN] The facility layout design problem is significantly relevant within the business operations strategies framework and has emerged as an alternate strategy towards supply chain sustainability. However, its wide coverage in the scientific literature has focused mainly on the static planning approach and disregarded the dynamic approach, which is very useful in real-world applications. In this context, the present article offers a literature review of the dynamic facility layout problem (DFLP). First, a taxonomy of the reviewed papers is proposed based on the problem formulation current trends (related to the problem type, planning phase, planning approach, number of facilities, number of floors, number of departments, space consideration, department shape, department dimensions, department area, and materials handling configuration); the mathematical modeling approach (regarding the type of model, type of objective function, type of constraints, nature of market demand, type of data, and distance metric), and the considered solution approach. Then, the extent to which recent research into DFLP has contributed to supply chain sustainability by addressing its three performance dimensions (economic, environmental, social) is described. Finally, some future research guidelines are provided.This research was funded by the Spanish Ministry of Science, Innovation and Universities Project CADS4.0, grant number RTI2018-101344-B-I00; and the Valencian Community ERDF Programme 2014-2020, grant number IDIFEDER/2018/025.Pérez-Gosende, P.; Mula, J.; Díaz-Madroñero Boluda, FM. (2020). Overview of Dynamic Facility Layout Planning as a Sustainability Strategy. Sustainability. 12(19):1-16. https://doi.org/10.3390/su12198277S1161219Ghassemi Tari, F., & Neghabi, H. (2015). A new linear adjacency approach for facility layout problem with unequal area departments. Journal of Manufacturing Systems, 37, 93-103. doi:10.1016/j.jmsy.2015.09.003Kheirkhah, A., Navidi, H., & Messi Bidgoli, M. (2015). Dynamic Facility Layout Problem: A New Bilevel Formulation and Some Metaheuristic Solution Methods. IEEE Transactions on Engineering Management, 62(3), 396-410. doi:10.1109/tem.2015.2437195Altuntas, S., & Selim, H. (2012). Facility layout using weighted association rule-based data mining algorithms: Evaluation with simulation. Expert Systems with Applications, 39(1), 3-13. doi:10.1016/j.eswa.2011.06.045Ku, M.-Y., Hu, M. H., & Wang, M.-J. (2011). Simulated annealing based parallel genetic algorithm for facility layout problem. International Journal of Production Research, 49(6), 1801-1812. doi:10.1080/00207541003645789Navidi, H., Bashiri, M., & Messi Bidgoli, M. (2012). A heuristic approach on the facility layout problem based on game theory. International Journal of Production Research, 50(6), 1512-1527. doi:10.1080/00207543.2010.550638Hosseini-Nasab, H., Fereidouni, S., Fatemi Ghomi, S. M. T., & Fakhrzad, M. B. (2017). Classification of facility layout problems: a review study. The International Journal of Advanced Manufacturing Technology, 94(1-4), 957-977. doi:10.1007/s00170-017-0895-8Carter, C. R., & Rogers, D. S. (2008). A framework of sustainable supply chain management: moving toward new theory. International Journal of Physical Distribution & Logistics Management, 38(5), 360-387. doi:10.1108/09600030810882816Carter, C. R., & Washispack, S. (2018). Mapping the Path Forward for Sustainable Supply Chain Management: A Review of Reviews. Journal of Business Logistics, 39(4), 242-247. doi:10.1111/jbl.12196Roy, V., Schoenherr, T., & Charan, P. (2018). The thematic landscape of literature in sustainable supply chain management (SSCM). International Journal of Operations & Production Management, 38(4), 1091-1124. doi:10.1108/ijopm-05-2017-0260Barbosa-Póvoa, A. P., da Silva, C., & Carvalho, A. (2018). Opportunities and challenges in sustainable supply chain: An operations research perspective. European Journal of Operational Research, 268(2), 399-431. doi:10.1016/j.ejor.2017.10.036Tonelli, F., Evans, S., & Taticchi, P. (2013). Industrial sustainability: challenges, perspectives, actions. International Journal of Business Innovation and Research, 7(2), 143. doi:10.1504/ijbir.2013.052576Sánchez-Flores, R. B., Cruz-Sotelo, S. E., Ojeda-Benitez, S., & Ramírez-Barreto, M. E. (2020). Sustainable Supply Chain Management—A Literature Review on Emerging Economies. Sustainability, 12(17), 6972. doi:10.3390/su12176972Ford, S., & Despeisse, M. (2016). Additive manufacturing and sustainability: an exploratory study of the advantages and challenges. Journal of Cleaner Production, 137, 1573-1587. doi:10.1016/j.jclepro.2016.04.150Kamble, S. S., Gunasekaran, A., & Gawankar, S. A. (2018). Sustainable Industry 4.0 framework: A systematic literature review identifying the current trends and future perspectives. Process Safety and Environmental Protection, 117, 408-425. doi:10.1016/j.psep.2018.05.009Khuntia, J., Saldanha, T. J. V., Mithas, S., & Sambamurthy, V. (2018). Information Technology and Sustainability: Evidence from an Emerging Economy. Production and Operations Management, 27(4), 756-773. doi:10.1111/poms.12822Roy, S., Das, M., Ali, S. M., Raihan, A. S., Paul, S. K., & Kabir, G. (2020). Evaluating strategies for environmental sustainability in a supply chain of an emerging economy. Journal of Cleaner Production, 262, 121389. doi:10.1016/j.jclepro.2020.121389Morais, D. O. C., & Silvestre, B. S. (2018). Advancing social sustainability in supply chain management: Lessons from multiple case studies in an emerging economy. Journal of Cleaner Production, 199, 222-235. doi:10.1016/j.jclepro.2018.07.097Stindt, D. (2017). A generic planning approach for sustainable supply chain management - How to integrate concepts and methods to address the issues of sustainability? Journal of Cleaner Production, 153, 146-163. doi:10.1016/j.jclepro.2017.03.126MOSLEMIPOUR, G., LEE, T. S., & LOONG, Y. T. (2017). Performance Analysis of Intelligent Robust Facility Layout Design. Chinese Journal of Mechanical Engineering, 30(2), 407-418. doi:10.1007/s10033-017-0073-9Emami, S., & S. Nookabadi, A. (2013). Managing a new multi-objective model for the dynamic facility layout problem. The International Journal of Advanced Manufacturing Technology, 68(9-12), 2215-2228. doi:10.1007/s00170-013-4820-5Al Hawarneh, A., Bendak, S., & Ghanim, F. (2019). Dynamic facilities planning model for large scale construction projects. Automation in Construction, 98, 72-89. doi:10.1016/j.autcon.2018.11.021Pournaderi, N., Ghezavati, V. R., & Mozafari, M. (2019). Developing a mathematical model for the dynamic facility layout problem considering material handling system and optimizing it using cloud theory-based simulated annealing algorithm. SN Applied Sciences, 1(8). doi:10.1007/s42452-019-0865-xTuranoğlu, B., & Akkaya, G. (2018). A new hybrid heuristic algorithm based on bacterial foraging optimization for the dynamic facility layout problem. Expert Systems with Applications, 98, 93-104. doi:10.1016/j.eswa.2018.01.011Moslemipour, G., Lee, T. S., & Rilling, D. (2011). A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems. The International Journal of Advanced Manufacturing Technology, 60(1-4), 11-27. doi:10.1007/s00170-011-3614-xTebaldi, L., Bigliardi, B., & Bottani, E. (2018). Sustainable Supply Chain and Innovation: A Review of the Recent Literature. Sustainability, 10(11), 3946. doi:10.3390/su10113946Tseng, M.-L., Islam, M. S., Karia, N., Fauzi, F. A., & Afrin, S. (2019). A literature review on green supply chain management: Trends and future challenges. Resources, Conservation and Recycling, 141, 145-162. doi:10.1016/j.resconrec.2018.10.009Ghobakhloo, M. (2020). Industry 4.0, digitization, and opportunities for sustainability. Journal of Cleaner Production, 252, 119869. doi:10.1016/j.jclepro.2019.119869Boar, A., Bastida, R., & Marimon, F. (2020). A Systematic Literature Review. Relationships between the Sharing Economy, Sustainability and Sustainable Development Goals. Sustainability, 12(17), 6744. doi:10.3390/su12176744Novais, L., Maqueira, J. M., & Ortiz-Bas, Á. (2019). A systematic literature review of cloud computing use in supply chain integration. Computers & Industrial Engineering, 129, 296-314. doi:10.1016/j.cie.2019.01.056Masi, D., Day, S., & Godsell, J. (2017). Supply Chain Configurations in the Circular Economy: A Systematic Literature Review. Sustainability, 9(9), 1602. doi:10.3390/su9091602Zavala-Alcívar, A., Verdecho, M.-J., & Alfaro-Saiz, J.-J. (2020). A Conceptual Framework to Manage Resilience and Increase Sustainability in the Supply Chain. Sustainability, 12(16), 6300. doi:10.3390/su12166300Li, K., Rollins, J., & Yan, E. (2017). Web of Science use in published research and review papers 1997–2017: a selective, dynamic, cross-domain, content-based analysis. Scientometrics, 115(1), 1-20. doi:10.1007/s11192-017-2622-5Kulturel-Konak, S., & Konak, A. (2014). A large-scale hybrid simulated annealing algorithm for cyclic facility layout problems. Engineering Optimization, 47(7), 963-978. doi:10.1080/0305215x.2014.933825Madhusudanan Pillai, V., Hunagund, I. B., & Krishnan, K. K. (2011). Design of robust layout for Dynamic Plant Layout Problems. Computers & Industrial Engineering, 61(3), 813-823. doi:10.1016/j.cie.2011.05.014Peng, Y., Zeng, T., Fan, L., Han, Y., & Xia, B. (2018). An Improved Genetic Algorithm Based Robust Approach for Stochastic Dynamic Facility Layout Problem. Discrete Dynamics in Nature and Society, 2018, 1-8. doi:10.1155/2018/1529058McKendall, A. R., & Hakobyan, A. (2010). Heuristics for the dynamic facility layout problem with unequal-area departments. European Journal of Operational Research, 201(1), 171-182. doi:10.1016/j.ejor.2009.02.028Yang, C.-L., Chuang, S.-P., & Hsu, T.-S. (2010). A genetic algorithm for dynamic facility planning in job shop manufacturing. The International Journal of Advanced Manufacturing Technology, 52(1-4), 303-309. doi:10.1007/s00170-010-2733-0Abedzadeh, M., Mazinani, M., Moradinasab, N., & Roghanian, E. (2012). Parallel variable neighborhood search for solving fuzzy multi-objective dynamic facility layout problem. The International Journal of Advanced Manufacturing Technology, 65(1-4), 197-211. doi:10.1007/s00170-012-4160-xGuan, X., Dai, X., Qiu, B., & Li, J. (2012). A revised electromagnetism-like mechanism for layout design of reconfigurable manufacturing system. Computers & Industrial Engineering, 63(1), 98-108. doi:10.1016/j.cie.2012.01.016Jolai, F., Tavakkoli-Moghaddam, R., & Taghipour, M. (2012). A multi-objective particle swarm optimisation algorithm for unequal sized dynamic facility layout problem with pickup/drop-off locations. International Journal of Production Research, 50(15), 4279-4293. doi:10.1080/00207543.2011.613863Kia, R., Baboli, A., Javadian, N., Tavakkoli-Moghaddam, R., Kazemi, M., & Khorrami, J. (2012). Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing. Computers & Operations Research, 39(11), 2642-2658. doi:10.1016/j.cor.2012.01.012McKendall, A. R., & Liu, W.-H. (2012). New Tabu search heuristics for the dynamic facility layout problem. International Journal of Production Research, 50(3), 867-878. doi:10.1080/00207543.2010.545446Hosseini-Nasab, H., & Emami, L. (2013). A hybrid particle swarm optimisation for dynamic facility layout problem. International Journal of Production Research, 51(14), 4325-4335. doi:10.1080/00207543.2013.774486Kaveh, M., Dalfard, V. M., & Amiri, S. (2013). A new intelligent algorithm for dynamic facility layout problem in state of fuzzy constraints. Neural Computing and Applications, 24(5), 1179-1190. doi:10.1007/s00521-013-1339-5KIA, R., JAVADIAN, N., PAYDAR, M. M., & SAIDI-MEHRABAD, M. (2013). A SIMULATED ANNEALING FOR INTRA-CELL LAYOUT DESIGN OF DYNAMIC CELLULAR MANUFACTURING SYSTEMS WITH ROUTE SELECTION, PURCHASING MACHINES AND CELL RECONFIGURATION. Asia-Pacific Journal of Operational Research, 30(04), 1350004. doi:10.1142/s0217595913500048Mazinani, M., Abedzadeh, M., & Mohebali, N. (2012). Dynamic facility layout problem based on flexible bay structure and solving by genetic algorithm. The International Journal of Advanced Manufacturing Technology, 65(5-8), 929-943. doi:10.1007/s00170-012-4229-6Samarghandi, H., Taabayan, P., & Behroozi, M. (2013). Metaheuristics for fuzzy dynamic facility layout problem with unequal area constraints and closeness ratings. The International Journal of Advanced Manufacturing Technology, 67(9-12), 2701-2715. doi:10.1007/s00170-012-4685-zYu-Hsin Chen, G. (2013). A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems. International Journal of Production Economics, 142(2), 362-371. doi:10.1016/j.ijpe.2012.12.012Bozorgi, N., Abedzadeh, M., & Zeinali, M. (2014). Tabu search heuristic for efficiency of dynamic facility layout problem. The International Journal of Advanced Manufacturing Technology, 77(1-4), 689-703. doi:10.1007/s00170-014-6460-9CHEN, G. Y.-H., & LO, J.-C. (2014). DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES. Asia-Pacific Journal of Operational Research, 31(04), 1450027. doi:10.1142/s0217595914500274Hosseini, S., Khaled, A. A., & Vadlamani, S. (2014). Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem. Neural Computing and Applications, 25(7-8), 1871-1885. doi:10.1007/s00521-014-1678-xKia, R., Khaksar-Haghani, F., Javadian, N., & Tavakkoli-Moghaddam, R. (2014). Solving a multi-floor layout design model of a dynamic cellular manufacturing system by an efficient genetic algorithm. Journal of Manufacturing Systems, 33(1), 218-232. doi:10.1016/j.jmsy.2013.12.005Nematian, J. (2014). A robust single row facility layout problem with fuzzy random variables. The International Journal of Advanced Manufacturing Technology, 72(1-4), 255-267. doi:10.1007/s00170-013-5564-yPourvaziri, H., & Naderi, B. (2014). A hybrid multi-population genetic algorithm for the dynamic facility layout problem. Applied Soft Computing, 24, 457-469. doi:10.1016/j.asoc.2014.06.051Derakhshan Asl, A., & Wong, K. Y. (2015). Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization. Journal of Intelligent Manufacturing, 28(6), 1317-1336. doi:10.1007/s10845-015-1053-5Li, L., Li, C., Ma, H., & Tang, Y. (2015). An Optimization Method for the Remanufacturing Dynamic Facility Layout Problem with Uncertainties. Discrete Dynamics in Nature and Society, 2015, 1-11. doi:10.1155/2015/685408Ulutas, B., & Islier, A. A. (2015). Dynamic facility layout problem in footwear industry. Journal of Manufacturing Systems, 36, 55-61. doi:10.1016/j.jmsy.2015.03.004Zarea Fazlelahi, F., Pournader, M., Gharakhani, M., & Sadjadi, S. J. (2016). A robust approach to design a single facility layout plan in dynamic manufacturing environments using a permutation-based genetic algorithm. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 230(12), 2264-2274. doi:10.1177/0954405415615728Hosseini, S. S., & Seifbarghy, M. (2016). A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem. RAIRO - Operations Research, 50(4-5), 869-890. doi:10.1051/ro/2016057Pourvaziri, H., & Pierreval, H. (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.011Tayal, A., & Singh, S. P. (2016). Integrating big data analytic and hybrid firefly-chaotic simulated annealing approach for facility layout problem. Annals of Operations Research, 270(1-2), 489-514. doi:10.1007/s10479-016-2237-xKumar, R., & Singh, S. P. (2017). A similarity score-based two-phase heuristic approach to solve the dynamic cellular facility layout for manufacturing systems. Engineering Optimization, 49(11), 1848-1867. doi:10.1080/0305215x.2016.1274205Liu, J., Wang, D., He, K., & Xue, Y. (2017). Combining Wang–Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem. European Journal of Operational Research, 262(3), 1052-1063. doi:10.1016/j.ejor.2017.04.002Vitayasak, S., Pongcharoen, P., & Hicks, C. (2017). A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm. International Journal of Production Economics, 190, 146-157. doi:10.1016/j.ijpe.2016.03.019Xiao, Y., Xie, Y., Kulturel-Konak, S., & Konak, A. (2017). A problem evolution algorithm with linear programming for the dynamic facility layout problem—A general layout formulation. Computers & Operations Research, 88, 187-207. doi:10.1016/j.cor.2017.06.025Li, J., Tan, X., & Li, J. (2018). Research on Dynamic Facility Layout Problem of Manufacturing Unit Considering Human Factors. Mathematical Problems in Engineering, 2018, 1-13. doi:10.1155/2018/6040561Vitayasak, S., & Pongcharoen, P. (2018). Performance improvement of Teaching-Learning-Based Optimisation for robust machine layout design. Expert Systems with Applications, 98, 129-152. doi:10.1016/j.eswa.2018.01.005Wei, X., Yuan, S., & Ye, Y. (2019). Optimizing facility layout planning for reconfigurable manufacturing system based on chaos genetic algorithm. Production & Manufacturing Research, 7(1), 109-124. doi:10.1080/21693277.2019.1602486Kulturel-Konak, S. (2007). Approaches to uncertainties in facility layout problems: Perspectives at the beginning of the 21st Century. Journal of Intelligent Manufacturing, 18(2), 273-284. doi:10.1007/s10845-007-0020-1Sharma, P., & Singhal, S. (2016). Implementation of fuzzy TOPSIS methodology in selection of procedural approach for facility layout planning. The International Journal of Advanced Manufacturing Technology, 88(5-8), 1485-1493. doi:10.1007/s00170-016-8878-8Bukchin, Y., & Tzur, M. (2014). A new MILP approach for the facility process-layout design problem with rectangular and L/T shape departments. International Journal of Production Research, 52(24), 7339-7359. doi:10.1080/00207543.2014.930534Meller, R. D., Kirkizoglu, Z., & Chen, W. (2010). A new optimization model to support a bottom-up approach to facility design. Computers & Operations Research, 37(1), 42-49. doi:10.1016/j.cor.2009.03.018Feng, J., & Che, A. (2018). Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments. Computers & Operations Research, 95, 163-171. doi:10.1016/j.cor.2018.03.013Allahyari, M. Z., & Azab, A. (2018). Mathematical modeling and multi-start search simulated annealing for unequal-area facility layout problem. Expert Systems with Applications, 91, 46-62. doi:10.1016/j.eswa.2017.07.049Ahmadi, A., Pishvaee, M. S., & Akbari Jokar, M. R. (2017). A survey on multi-floor facility layout problems. Computers & Industrial Engineering, 107, 158-170. doi:10.1016/j.cie.2017.03.015Drira, A., Pierreval, H., & Hajri-Gabouj, S. (2007). Facility layout problems: A survey. Annual Reviews in Control, 31(2), 255-267. doi:10.1016/j.arcontrol.2007.04.001Grobelny, J., & Michalski, R. (2017). A novel version of simulated annealing based on linguistic patterns for solving facility layout problems. Knowledge-Based Systems, 124, 55-69. doi:10.1016/j.knosys.2017.03.001Hathhorn, J., Sisikoglu, E., & Sir, M. Y. (2013). A multi-objective mixed-integer programming model for a multi-floor facility layout. International Journal of Production Research, 51(14), 4223-4239. doi:10.1080/00207543.2012.75348

Models and Algorithms for the Optimisation of Replenishment, Production and Distribution Plans in Industrial Enterprises

Tesis por compendio[ES] La optimización en las empresas manufactureras es especialmente importante, debido a las grandes inversiones que realizan, ya que a veces estas inversiones no obtienen el rendimiento esperado porque los márgenes de beneficio de los productos son muy ajustados. Por ello, las empresas tratan de maximizar el uso de los recursos productivos y financieros minimizando el tiempo perdido y, al mismo tiempo, mejorando los flujos de los procesos y satisfaciendo las necesidades del mercado. El proceso de planificación es una actividad crítica para las empresas. Esta tarea implica grandes retos debido a los cambios del mercado, las alteraciones en los procesos de producción dentro de la empresa y en la cadena de suministro, y los cambios en la legislación, entre otros. La planificación del aprovisionamiento, la producción y la distribución desempeña un papel fundamental en el rendimiento de las empresas manufactureras, ya que una planificación ineficaz de los proveedores, los procesos de producción y los sistemas de distribución contribuye a aumentar los costes de los productos, a alargar los plazos de entrega y a reducir los beneficios. La planificación eficaz es un proceso complejo que abarca una amplia gama de actividades para garantizar que los equipos, los materiales y los recursos humanos estén disponibles en el momento y el lugar adecuados. Motivados por la complejidad de la planificación en las empresas manufactureras, esta tesis estudia y desarrolla herramientas cuantitativas para ayudar a los planificadores en los procesos de la planificación del aprovisionamiento, producción y distribución. Desde esta perspectiva, se proponen modelos realistas y métodos eficientes para apoyar la toma de decisiones en las empresas industriales, principalmente en las pequeñas y medianas empresas (PYMES). Las aportaciones de esta tesis suponen un avance científico basado en una exhaustiva revisión bibliográfica sobre la planificación del aprovisionamiento, la producción y la distribución que ayuda a comprender los principales modelos y algoritmos utilizados para resolver estos planes, y pone en relieve las tendencias y las futuras direcciones de investigación. También proporciona un marco holístico para caracterizar los modelos y algoritmos centrándose en la planificación de la producción, la programación y la secuenciación. Esta tesis también propone una herramienta de apoyo a la decisión para seleccionar un algoritmo o método de solución para resolver problemas concretos de la planificación del aprovisionamiento, producción y distribución en función de su complejidad, lo que permite a los planificadores no duplicar esfuerzos de modelización o programación de técnicas de solución. Por último, se desarrollan nuevos modelos matemáticos y enfoques de solución de última generación, como los algoritmos matheurísticos, que combinan la programación matemática y las técnicas metaheurísticas. Los nuevos modelos y algoritmos comprenden mejoras en términos de rendimiento computacional, e incluyen características realistas de los problemas del mundo real a los que se enfrentan las empresas de fabricación. Los modelos matemáticos han sido validados con un caso de una importante empresa del sector de la automoción en España, lo que ha permitido evaluar la relevancia práctica de estos novedosos modelos utilizando instancias de gran tamaño, similares a las existentes en la empresa objeto de estudio. Además, los algoritmos matheurísticos han sido probados utilizando herramientas libres y de código abierto. Esto también contribuye a la práctica de la investigación operativa, y proporciona una visión de cómo desplegar estos métodos de solución y el tiempo de cálculo y rendimiento de la brecha que se puede obtener mediante el uso de software libre o de código abierto.[CA] L'optimització a les empreses manufactureres és especialment important, a causa de les grans inversions que realitzen, ja que de vegades aquestes inversions no obtenen el rendiment esperat perquè els marges de benefici dels productes són molt ajustats. Per això, les empreses intenten maximitzar l'ús dels recursos productius i financers minimitzant el temps perdut i, alhora, millorant els fluxos dels processos i satisfent les necessitats del mercat. El procés de planificació és una activitat crítica per a les empreses. Aquesta tasca implica grans reptes a causa dels canvis del mercat, les alteracions en els processos de producció dins de l'empresa i la cadena de subministrament, i els canvis en la legislació, entre altres. La planificació de l'aprovisionament, la producció i la distribució té un paper fonamental en el rendiment de les empreses manufactureres, ja que una planificació ineficaç dels proveïdors, els processos de producció i els sistemes de distribució contribueix a augmentar els costos dels productes, allargar els terminis de lliurament i reduir els beneficis. La planificació eficaç és un procés complex que abasta una àmplia gamma d'activitats per garantir que els equips, els materials i els recursos humans estiguen disponibles al moment i al lloc adequats. Motivats per la complexitat de la planificació a les empreses manufactureres, aquesta tesi estudia i desenvolupa eines quantitatives per ajudar als planificadors en els processos de la planificació de l'aprovisionament, producció i distribució. Des d'aquesta perspectiva, es proposen models realistes i mètodes eficients per donar suport a la presa de decisions a les empreses industrials, principalment a les petites i mitjanes empreses (PIMES). Les aportacions d'aquesta tesi suposen un avenç científic basat en una exhaustiva revisió bibliogràfica sobre la planificació de l'aprovisionament, la producció i la distribució que ajuda a comprendre els principals models i algorismes utilitzats per resoldre aquests plans, i posa de relleu les tendències i les futures direccions de recerca. També proporciona un marc holístic per caracteritzar els models i algorismes centrant-se en la planificació de la producció, la programació i la seqüenciació. Aquesta tesi també proposa una eina de suport a la decisió per seleccionar un algorisme o mètode de solució per resoldre problemes concrets de la planificació de l'aprovisionament, producció i distribució en funció de la seua complexitat, cosa que permet als planificadors no duplicar esforços de modelització o programació de tècniques de solució. Finalment, es desenvolupen nous models matemàtics i enfocaments de solució d'última generació, com ara els algoritmes matheurístics, que combinen la programació matemàtica i les tècniques metaheurístiques. Els nous models i algoritmes comprenen millores en termes de rendiment computacional, i inclouen característiques realistes dels problemes del món real a què s'enfronten les empreses de fabricació. Els models matemàtics han estat validats amb un cas d'una important empresa del sector de l'automoció a Espanya, cosa que ha permés avaluar la rellevància pràctica d'aquests nous models utilitzant instàncies grans, similars a les existents a l'empresa objecte d'estudi. A més, els algorismes matheurístics han estat provats utilitzant eines lliures i de codi obert. Això també contribueix a la pràctica de la investigació operativa, i proporciona una visió de com desplegar aquests mètodes de solució i el temps de càlcul i rendiment de la bretxa que es pot obtindre mitjançant l'ús de programari lliure o de codi obert.[EN] Optimisation in manufacturing companies is especially important, due to the large investments they make, as sometimes these investments do not obtain the expected return because the profit margins of products are very tight. Therefore, companies seek to maximise the use of productive and financial resources by minimising lost time and, at the same time, improving process flows while meeting market needs. The planning process is a critical activity for companies. This task involves great challenges due to market changes, alterations in production processes within the company and in the supply chain, and changes in legislation, among others. Planning of replenishment, production and distribution plays a critical role in the performance of manufacturing companies because ineffective planning of suppliers, production processes and distribution systems contributes to higher product costs, longer lead times and less profits. Effective planning is a complex process that encompasses a wide range of activities to ensure that equipment, materials and human resources are available in the right time and the right place. Motivated by the complexity of planning in manufacturing companies, this thesis studies and develops quantitative tools to help planners in the replenishment, production and delivery planning processes. From this perspective, realistic models and efficient methods are proposed to support decision making in industrial companies, mainly in small- and medium-sized enterprises (SMEs). The contributions of this thesis represent a scientific breakthrough based on a comprehensive literature review about replenishment, production and distribution planning that helps to understand the main models and algorithms used to solve these plans, and highlights trends and future research directions. It also provides a holistic framework to characterise models and algorithms by focusing on production planning, scheduling and sequencing. This thesis also proposes a decision support tool for selecting an algorithm or solution method to solve concrete replenishment, production and distribution planning problems according to their complexity, which allows planners to not duplicate efforts modelling or programming solution techniques. Finally, new state-of-the-art mathematical models and solution approaches are developed, such as matheuristic algorithms, which combine mathematical programming and metaheuristic techniques. The new models and algorithms comprise improvements in computational performance terms, and include realistic features of real-world problems faced by manufacturing companies. The mathematical models have been validated with a case of an important company in the automotive sector in Spain, which allowed to evaluate the practical relevance of these novel models using large instances, similarly to those existing in the company under study. In addition, the matheuristic algorithms have been tested using free and open-source tools. This also helps to contribute to the practice of operations research, and provides insight into how to deploy these solution methods and the computational time and gap performance that can be obtained by using free or open-source software.This work would not have been possible without the following funding sources: Conselleria de Educación, Investigación, Cultura y Deporte, Generalitat Valenciana for hiring predoctoral research staff with Grant (ACIF/2018/170) and the European Social Fund with the Grant Operational Programme of FSE 2014-2020. Conselleria de Educación, Investigación, Cultura y Deporte, Generalitat Valenciana for predoctoral contract students to stay in research centers outside the research centers outside the Valencian Community (BEFPI/2021/040) and the European Social Fund.Guzmán Ortiz, BE. (2022). Models and Algorithms for the Optimisation of Replenishment, Production and Distribution Plans in Industrial Enterprises [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/187461Compendi

Internet of Things in urban waste collection

Nowadays, the waste collection management has an important role in urban areas. This paper faces this issue and proposes the application of a metaheuristic for the optimization of a weekly schedule and routing of the waste collection activities in an urban area. Differently to several contributions in literature, fixed periodic routes are not imposed. The results significantly improve the performance of the company involved, both in terms of resources used and costs saving

Optimization of storage and picking systems in warehouses

La croissance du commerce électronique exige une hausse des performances des systèmes d'entreposage, qui sont maintenant repensés pour faire face à un volume massif de demandes à être satisfait le plus rapidement possible. Le système manuel et le système à robots mobile (SRM) sont parmi les plus utilisés pour ces activités. Le premier est un système centré sur l'humain pour réaliser des opérations complexes que les robots actuels ne peuvent pas effectuer. Cependant, les nouvelles générations de robots autonomes mènent à un remplacement progressif par le dernier pour augmenter la productivité. Quel que soit le système utilisé, plusieurs problèmes interdépendants doivent être résolus pour avoir des processus de stockage et de prélèvement efficaces. Les problèmes de stockage concernent les décisions d'où stocker les produits dans l'entrepôt. Les problèmes de prélèvement incluent le regroupement des commandes à exécuter ensemble et les itinéraires que les cueilleurs et les robots doivent suivre pour récupérer les produits demandés. Dans le système manuel, ces problèmes sont traditionnellement résolus à l'aide de politiques simples que les préparateurs peuvent facilement suivre. Malgré l'utilisation de robots, la même stratégie de solution est répliquée aux problèmes équivalents trouvés dans le SRM. Dans cette recherche, nous étudions les problèmes de stockage et de prélèvement rencontrés lors de la conception du système manuel et du SRM. Nous développons des outils d'optimisation pour aider à la prise de décision pour mettre en place leurs processus, en améliorant les mesures de performance typiques de ces systèmes. Certains problèmes traditionnels sont résolus avec des techniques améliorées, tandis que d'autres sont intégrés pour être résolus ensemble au lieu d'optimiser chaque sous-système de manière indépendante. Nous considérons d'abord un système manuel avec un ensemble connu de commandes et intégrons les décisions de stockage et de routage. Le problème intégré et certaines variantes tenant compte des politiques de routage communes sont modélisés mathématiquement. Une métaheuristique générale de recherche de voisinage variable est présentée pour traiter des instances de taille réelle. Des expériences attestent de l'efficience de la métaheuristique proposée par rapport aux modèles exacts et aux politiques de stockage communes. Lorsque les demandes futures sont incertaines, il est courant d'utiliser une stratégie de zonage qui divise la zone de stockage en zones et attribue les produits les plus demandés aux meilleures zones. Les tailles des zones sont à déterminer. Généralement, des dimensions arbitraires sont choisies, mais elles ignorent les caractéristiques de l'entrepôt et des demandes. Nous abordons le problème de dimensionnement des zones pour déterminer quels facteurs sont pertinents pour choisir de meilleures tailles de zone. Les données générées à partir de simulations exhaustives sont utilisées pour trainer quatre modèles de régression d'apprentissage automatique - moindres carrés ordinaire, arbre de régression, forêt aléatoire et perceptron multicouche - afin de prédire les dimensions optimales des zones en fonction de l'ensemble de facteurs pertinents identifiés. Nous montrons que tous les modèles entraînés suggèrent des dimensions sur mesure des zones qui performent meilleur que les dimensions arbitraires couramment utilisées. Une autre approche pour résoudre les problèmes de stockage pour le système manuel et pour le SRM considère les corrélations entre les produits. L'idée est que les produits régulièrement demandés ensemble doivent être stockés près pour réduire les coûts de routage. Cette politique de stockage peut être modélisée comme une variante du problème d'affectation quadratique (PAQ). Le PAQ est un problème combinatoire traditionnel et l'un des plus difficiles à résoudre. Nous examinons les variantes les plus connues du PAQ et développons une puissante métaheuristique itérative de recherche tabou mémétique en parallèle capable de les résoudre. La métaheuristique proposée s'avère être parmi les plus performantes pour le PAQ et surpasse considérablement l'état de l'art pour ses variantes. Les SRM permettent de repositionner facilement les pods d'inventaire pendant les opérations, ce qui peut conduire à un processus de prélèvement plus économe en énergie. Nous intégrons les décisions de repositionnement des pods à l'attribution des commandes et à la sélection des pods à l'aide d'une stratégie de prélèvement par vague. Les pods sont réorganisés en tenant compte du moment et de l'endroit où ils devraient être demandés au futur. Nous résolvons ce problème en utilisant la programmation stochastique en tenant compte de l'incertitude sur les demandes futures et suggérons une matheuristique de recherche locale pour résoudre des instances de taille réelle. Nous montrons que notre schéma d'approximation moyenne de l'échantillon est efficace pour simuler les demandes futures puisque nos méthodes améliorent les solutions trouvées lorsque les vagues sont planifiées sans tenir compte de l'avenir. Cette thèse est structurée comme suit. Après un chapitre d'introduction, nous présentons une revue de la littérature sur le système manuel et le SRM, et les décisions communes prises pour mettre en place leurs processus de stockage et de prélèvement. Les quatre chapitres suivants détaillent les études pour le problème de stockage et de routage intégré, le problème de dimensionnement des zones, le PAQ et le problème de repositionnement de pod. Nos conclusions sont résumées dans le dernier chapitre.The rising of e-commerce is demanding an increase in the performance of warehousing systems, which are being redesigned to deal with a mass volume of demands to be fulfilled as fast as possible. The manual system and the robotic mobile fulfillment system (RMFS) are among the most commonly used for these activities. The former is a human-centered system that handles complex operations that current robots cannot perform. However, newer generations of autonomous robots are leading to a gradual replacement by the latter to increase productivity. Regardless of the system used, several interdependent problems have to be solved to have efficient storage and picking processes. Storage problems concern decisions on where to store products within the warehouse. Picking problems include the batching of orders to be fulfilled together and the routes the pickers and robots should follow to retrieve the products demanded. In the manual system, these problems are traditionally solved using simple policies that pickers can easily follow. Despite using robots, the same solution strategy is being replicated to the equivalent problems found in the RMFS. In this research, we investigate storage and picking problems faced when designing manual and RMFS warehouses. We develop optimization tools to help in the decision-making process to set up their processes and improve typical performance measures considered in these systems. Some classic problems are solved with improved techniques, while others are integrated to be solved together instead of optimizing each subsystem sequentially. We first consider a manual system with a known set of orders and integrate storage and routing decisions. The integrated problem and some variants considering common routing policies are modeled mathematically. A general variable neighborhood search metaheuristic is presented to deal with real-size instances. Computational experiments attest to the effectiveness of the metaheuristic proposed compared to the exact models and common storage policies. When future demands are uncertain, it is common to use a zoning strategy to divide the storage area into zones and assign the most-demanded products to the best zones. Zone sizes are to be determined. Commonly, arbitrary sizes are chosen, which ignore the characteristics of the warehouse and the demands. We approach the zone sizing problem to determine which factors are relevant to choosing better zone sizes. Data generated from exhaustive simulations are used to train four machine learning regression models - ordinary least squares, regression tree, random forest, and multilayer perceptron - to predict the optimal zone sizes given the set of relevant factors identified. We show that all trained models suggest tailor-made zone sizes with better picking performance than the arbitrary ones commonly used. Another approach to solving storage problems, both in the manual and RMFS, considers the correlations between products. The idea is that products constantly demanded together should be stored closer to reduce routing costs. This storage policy can be modeled as a quadratic assignment problem (QAP) variant. The QAP is a traditional combinatorial problem and one of the hardest to solve. We survey the most traditional QAP variants and develop a powerful parallel memetic iterated tabu search metaheuristic capable of solving them. The proposed metaheuristic is shown to be among the best performing ones for the QAP and significantly outperforms the state-of-the-art for its variants. The RMFS allows easy repositioning of inventory pods during operations that can lead to a more energy-efficient picking process. We integrate pod repositioning decisions with order assignment and pod selection using a wave picking strategy such that pods are parked after being requested considering when and where they are expected to be requested next. We solve this integrated problem using stochastic programming considering the uncertainty about future demands and suggest a local search matheuristic to solve real-size instances. We show that our sample average approximation scheme is effective to simulate future demands since our methods improve solutions found when waves are planned without considering the future demands. This thesis is structured as follows. After an introductory chapter, we present a literature review on the manual and RMFS, and common decisions made to set up their storage and picking processes. The next four chapters detail the studies for the integrated storage and routing problem, the zone sizing problem, the QAP, and the pod repositioning problem. Our findings are summarized in the last chapter

Mathematical optimization and learning models to address uncertainties and sustainability of supply chain management

As concerns about climate change, biodiversity loss, and pollution have become more widespread, new worldwide challenges deal with the protection of the environment and the conservation of natural resources. Thus, in order to empower sustainability and circular economy ambitions, the world has shifted to embrace sustainable practices and policies. This is carried out, primarily, through the implementation of sustainable business practices and increased investments in green technology. Advanced information systems, digital technologies and mathematical models are required to respond to the demanding targets of the sustainability paradigm. This trend is expanding with the growing interest in production and services sustainability in order to achieve economic growth and development while preventing their negative impact on the environment. A significant step forward in this direction is enabled by Supply Chain Management (SCM) practices that exploit mathematical and statistical modeling to better support decisions affecting both profitability and sustainability targets. Indeed, these targets should not be approached as competing goals, but rather addressed simultaneously within a comprehensive vision that responds adequately to both of them. Accordingly, Green Supply Chain Management (GSCM) can achieve its goals through innovative management approaches that consider sustainable efficiency and profitability to be clearly linked by the savings that result from applying optimization techniques. To confirm the above, there is a growing trend of applying mathematical optimization models for enhancing decision-making in pursuit of both environmental and profit performance. Indeed, GSCM takes into account many decision problems, such as facility location, capacity allocation, production planning and vehicle routing. Besides sustainability, uncertainty is another critical issue in Supply Chain Management (SCM). Considering a deterministic approach would definitely fail to provide concrete decision support when modeling those kinds of scenarios. According to various hypothesis and strategies, uncertainties can be addressed by exploiting several modeling approaches arising from statistics, statistical learning and mathematical programming. While statistical and learning models accounts variability by definition, Robust Optimization (RO) is a particular modeling approach that is commonly applied in solving mathematical programming problems where a certain set of parameters are subject to uncertainty. In this dissertation, mathematical and learning models are exploited according to different approaches and models combinations, providing new formulations and frameworks to address strategic and operational problems of GSCM under uncertainty. All models and frameworks presented in this dissertation are tested and validated on real-case instances

Truckload Shipment Planning and Procurement

This dissertation presents three issues encountered by a shipper in the context of truckload transportation. In all of the studies, we utilize optimization techniques to model and solve the problems. Each study is inspired from the real world and much of the data used in the experiments is real data or representative of real data. The first topic is about the freight consolidation in truckload transportation. We integrate it with a purchase incentive program to increase truckload utilization and maximize profit. The second topic is about supporting decision making collaboration among departments of a manufacturer. It is a bi-objective optimization model. The third topic is about procurement in an adverse market. We study a modification of the existing procurement process to consider the market stochastic into marking decisions. In all three studies, our target is to develop effectively methodologies to seek optimal answers within a reasonable amount of time