{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:29:22Z","timestamp":1772252962285,"version":"3.50.1"},"reference-count":72,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:00:00Z","timestamp":1631577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>This work presents a multistart algorithm for solving the capacitated vehicle routing problem with 2D loading constraints (2L-CVRP) allowing for the rotation of goods. Research dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics, such as the Constructive Genetic Algorithm (CGA) to construct promising initial solutions; a Tabu Search (TS) to improve the initial solutions on the routing problem, and a Large Neighborhood Search (LNS) for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multithreading programming to improve the performance. Additionally, memory structures such as hash-tables were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest to the community involved in symmetry studies, such as graph algorithms and graph theory.<\/jats:p>","DOI":"10.3390\/sym13091697","type":"journal-article","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T23:34:11Z","timestamp":1631662451000},"page":"1697","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Multi-Start Algorithm for Solving the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2030-3266","authenticated-orcid":false,"given":"Leandro Pinto","family":"Fava","sequence":"first","affiliation":[{"name":"Industrial Systems and Processes Graduate Program, University of Santa Cruz do Sul, Av. Independencia 2293, Santa Cruz do Sul 96815-900, RS, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6980-1485","authenticated-orcid":false,"given":"Jo\u00e3o Carlos","family":"Furtado","sequence":"additional","affiliation":[{"name":"Industrial Systems and Processes Graduate Program, University of Santa Cruz do Sul, Av. Independencia 2293, Santa Cruz do Sul 96815-900, RS, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3256-8069","authenticated-orcid":false,"given":"Gilson Augusto","family":"Helfer","sequence":"additional","affiliation":[{"name":"Applied Computing Graduate Program, University of Vale do Rio dos Sinos, Av. Unisinos 950, S\u00e3o Leopoldo 93022-750, RS, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0358-2056","authenticated-orcid":false,"given":"Jorge Luis Vict\u00f3ria","family":"Barbosa","sequence":"additional","affiliation":[{"name":"Applied Computing Graduate Program, University of Vale do Rio dos Sinos, Av. Unisinos 950, S\u00e3o Leopoldo 93022-750, RS, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7315-8739","authenticated-orcid":false,"given":"Marko","family":"Beko","sequence":"additional","affiliation":[{"name":"Instituto de Telecomunica\u00e7\u00f5es, Instituto Superior T\u00e9cnico, Universidade de Lisboa, 1049-001 Lisbon, Portugal"},{"name":"COPELABS, University Lus\u00f3fona\u2014ULHT, 1749-024 Lisbon, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1111-3513","authenticated-orcid":false,"given":"S\u00e9rgio Duarte","family":"Correia","sequence":"additional","affiliation":[{"name":"COPELABS, University Lus\u00f3fona\u2014ULHT, 1749-024 Lisbon, Portugal"},{"name":"VALORIZA\u2014Research Centre for Endogenous Resource Valorization, Polytechnic Institute of Portalegre, 7300-555 Portalegre, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0446-9271","authenticated-orcid":false,"given":"Valderi Reis Quietinho","family":"Leithardt","sequence":"additional","affiliation":[{"name":"COPELABS, University Lus\u00f3fona\u2014ULHT, 1749-024 Lisbon, Portugal"},{"name":"VALORIZA\u2014Research Centre for Endogenous Resource Valorization, Polytechnic Institute of Portalegre, 7300-555 Portalegre, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","article-title":"Fifty Years of Vehicle Routing","volume":"43","author":"Laporte","year":"2009","journal-title":"Transp. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Irnich, S., Toth, P., and Vigo, D. (2014). Chapter 1: The Family of Vehicle Routing Problems. Vehicle Routing, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611973594.ch1"},{"key":"ref_3","first-page":"393","article-title":"Solution of a Large-Scale Traveling-Salesman Problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"J. Oper. Res. Soc. Am."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Baioletti, M., Milani, A., Santucci, V., and Bartoccini, U. (2019, January 13\u201317). An experimental comparison of algebraic differential evolution using different generating sets. Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czech Republic.","DOI":"10.1145\/3319619.3326854"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Barbu, T. (2021). Automatic Unsupervised Texture Recognition Framework Using Anisotropic Diffusion-Based Multi-Scale Analysis and Weight-Connected Graph Clustering. Symmetry, 13.","DOI":"10.3390\/sym13060925"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kang, H.Y., and Lee, A. (2018). An Enhanced Approach for the Multiple Vehicle Routing Problem with Heterogeneous Vehicles and a Soft Time Window. Symmetry, 10.","DOI":"10.3390\/sym10110650"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Kucharska, E. (2019). Dynamic Vehicle Routing Problem\u2014Predictive and Unexpected Customer Availability. Symmetry, 11.","DOI":"10.3390\/sym11040546"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Seo, M., Lee, S., and Lee, S. (2019). Clustering-based Data Dissemination Protocol Using the Path Similarity for Autonomous Vehicles. Symmetry, 11.","DOI":"10.3390\/sym11020260"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Kim, J. (2020). Vehicle Detection Using Deep Learning Technique in Tunnel Road Environments. Symmetry, 12.","DOI":"10.3390\/sym12122012"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Xu, Y., Tang, W., Chen, B., Qiu, L., and Yang, R. (2021). A Model Predictive Control with Preview-Follower Theory Algorithm for Trajectory Tracking Control in Autonomous Vehicles. Symmetry, 13.","DOI":"10.3390\/sym13030381"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The Truck Dispatching Problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manag. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","article-title":"Recent advances on two-dimensional bin packing problems","volume":"123","author":"Lodi","year":"2002","journal-title":"Discret. Appl. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/trsc.1060.0165","article-title":"An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints","volume":"41","author":"Iori","year":"2007","journal-title":"Transp. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1002\/net.20192","article-title":"A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints","volume":"51","author":"Gendreau","year":"2007","journal-title":"Networks"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.cor.2007.10.021","article-title":"Ant colony optimization for the two-dimensional loading vehicle routing problem","volume":"36","author":"Fuellerer","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2007.05.058","article-title":"A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints","volume":"195","author":"Zachariadis","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Strodl, J., Doerner, K.F., Tricoire, F., and Hartl, R.F. (2010). On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard\nFeasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem. Hybrid Metaheuristics, Springer.","DOI":"10.1007\/978-3-642-16054-7_12"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10696-010-9061-4","article-title":"Simulated annealing for the vehicle routing problem with two-dimensional loading constraints","volume":"22","author":"Leung","year":"2010","journal-title":"Flex. Serv. Manuf. J."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.cor.2010.04.013","article-title":"Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem","volume":"38","author":"Leung","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.cor.2010.08.017","article-title":"A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem","volume":"38","author":"Duhamel","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.ejor.2013.01.040","article-title":"Integrated distribution and loading planning via a compact metaheuristic algorithm","volume":"228","author":"Zachariadis","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1111\/itor.12070","article-title":"A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations","volume":"21","author":"Dominguez","year":"2014","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1016\/j.ejor.2014.12.048","article-title":"A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints","volume":"243","author":"Wei","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.ejor.2017.08.035","article-title":"A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints","volume":"265","author":"Wei","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.apm.2019.01.022","article-title":"An open space based heuristic for the 2D strip packing problem with unloading constraints","volume":"70","author":"Wei","year":"2019","journal-title":"Appl. Math. Model."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ejor.2015.11.018","article-title":"The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints","volume":"251","author":"Zachariadis","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1111\/itor.12509","article-title":"Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls","volume":"27","author":"Pinto","year":"2018","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/trsc.1050.0145","article-title":"A Tabu Search Algorithm for a Routing and Container Loading Problem","volume":"40","author":"Gendreau","year":"2006","journal-title":"Transp. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TITS.2009.2020187","article-title":"A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem","volume":"10","author":"Tarantilis","year":"2009","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1016\/j.ejor.2009.03.046","article-title":"Metaheuristics for vehicle routing problems with three-dimensional loading constraints","volume":"201","author":"Fuellerer","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1795","DOI":"10.1016\/j.engappai.2013.03.012","article-title":"A GRASP\u00d7ELS for the vehicle routing problem with basic three-dimensional loading constraints","volume":"26","author":"Lacomme","year":"2013","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2248","DOI":"10.1016\/j.cor.2011.11.008","article-title":"A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints","volume":"39","author":"Bortfeldt","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1007\/s00291-018-0506-6","article-title":"A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints","volume":"40","author":"Koch","year":"2018","journal-title":"OR Spectr."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.ejor.2019.09.024","article-title":"The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints","volume":"282","author":"Bortfeldt","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","article-title":"Routing problems with loading constraints","volume":"18","author":"Iori","year":"2010","journal-title":"TOP"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00291-014-0386-3","article-title":"Vehicle routing problems with loading constraints: State-of-the-art and future directions","volume":"37","author":"Pollaris","year":"2014","journal-title":"OR Spectr."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","article-title":"The orienteering problem","volume":"34","author":"Golden","year":"1987","journal-title":"Nav. Res. Logist."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Santucci, V., and Baioletti, M. (2020). A Memetic Approach for the Orienteering Problem. Communications in Computer and Information Science, Springer International Publishing.","DOI":"10.1007\/978-3-030-45016-8_5"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"123691","DOI":"10.1016\/j.jclepro.2020.123691","article-title":"The green vehicle routing problem: A systematic literature review","volume":"279","author":"Moghdani","year":"2021","journal-title":"J. Clean. Prod."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Holland, J.H. (1992). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence, MIT Press.","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. Principles and Practice of Constraint Programming\u2014CP98, Springer.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02078647","article-title":"A user\u2019s guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","article-title":"A parallel tabu search algorithm for large traveling salesman problems","volume":"51","author":"Fiechter","year":"1994","journal-title":"Discret. Appl. Math."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1162\/106365601750406019","article-title":"Constructive Genetic Algorithm for Clustering Problems","volume":"9","author":"Lorena","year":"2001","journal-title":"Evol. Comput."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"5375","DOI":"10.1016\/j.asoc.2011.05.021","article-title":"Localized genetic algorithm for vehicle routing problem with time windows","volume":"11","author":"Ursani","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.cie.2007.11.018","article-title":"A Constructive Genetic Algorithm for permutation flowshop scheduling","volume":"55","author":"Nagano","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1111\/gean.12082","article-title":"A Constructive Genetic Algorithm for Discrete Dispersion on Point Feature Cartographic Label Placement Problems","volume":"48","author":"Gomes","year":"2015","journal-title":"Geogr. Anal."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","article-title":"A unified tabu search heuristic for vehicle routing problems with time windows","volume":"52","author":"Cordeau","year":"2001","journal-title":"J. Oper. Res. Soc."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cor.2013.10.017","article-title":"An effective tabu search approach with improved loading algorithms for the 3L-CVRP","volume":"55","author":"Tao","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/j.ejor.2017.10.029","article-title":"Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints","volume":"266","author":"Reil","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.ssci.2019.06.017","article-title":"Prioritization of OHS key performance indicators that affecting business competitiveness \u2013 A demonstration based on MAUT and Neural Networks","volume":"118","author":"Nara","year":"2019","journal-title":"Saf. Sci."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Glover, F., and Meli\u00e1n, B. (2003). Tabu Search. Intel. Artif., 7.","DOI":"10.4114\/ia.v7i19.714"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.cor.2018.12.023","article-title":"Heuristics for vehicle routing problems: Sequence or set optimization?","volume":"105","author":"Toffolo","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.cor.2017.02.022","article-title":"An open source Spreadsheet Solver for Vehicle Routing Problems","volume":"84","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_58","unstructured":"Johnson, D. (1973). Near-Optimal Bin Packing Algorithms, Massachusetts Institute of Technology. Dept. of Mathematics."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.ejor.2016.05.002","article-title":"A Biased-Randomised Large Neighbourhood Search for the two-dimensional Vehicle Routing Problem with Backhauls","volume":"255","author":"Dominguez","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"6082","DOI":"10.1016\/j.eswa.2015.04.001","article-title":"An intelligent model for logistics management based on geofencing algorithms and RFID technology","volume":"42","author":"Oliveira","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1093\/iwcomp\/iwz030","article-title":"Ubiquitous Intelligent Services for Vehicular Users: A Systematic Mapping","volume":"31","author":"Gomes","year":"2019","journal-title":"Interact. Comput."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijhcs.2018.04.001","article-title":"TrailCare: An indoor and outdoor Context-aware system to assist wheelchair users","volume":"116","author":"Barbosa","year":"2018","journal-title":"Int. J. Hum. Comput. Stud."},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Aranda, J.A.S., Bavaresco, R.S., de Carvalho, J.V., Yamin, A.C., Tavares, M.C., and Barbosa, J.L.V. (2021). A computational model for adaptive recording of vital signs through context histories. J. Ambient. Intell. Humaniz. Comput.","DOI":"10.1007\/s12652-021-03126-8"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s40593-015-0047-y","article-title":"A Multi-Temporal Context-aware System for Competences Management","volume":"25","author":"Rosa","year":"2015","journal-title":"Int. J. Artif. Intell. Educ."},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Machado, S.D., da Rosa Tavares, J.E., Martins, M.G., Barbosa, J.L.V., Gonz\u00e1lez, G.V., and Leithardt, V.R.Q. (2021). Ambient Intelligence Based on IoT for Assisting People with Alzheimer\u2019s Disease Through Context Histories. Electronics, 10.","DOI":"10.20944\/preprints202105.0018.v1"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/s10044-019-00829-9","article-title":"CHSPAM: A multi-domain model for sequential pattern discovery and monitoring in contexts histories","volume":"23","author":"Dupont","year":"2019","journal-title":"Pattern Anal. Appl."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.eswa.2015.09.016","article-title":"ORACON: An adaptive model for context prediction","volume":"45","author":"Barbosa","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"106497","DOI":"10.1016\/j.infsof.2020.106497","article-title":"A risk prediction model for software project management based on similarity analysis of context histories","volume":"131","author":"Filippetto","year":"2021","journal-title":"Inf. Softw. Technol."},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Lucca, A.V., Sborz, G.M., Leithardt, V., Beko, M., Zeferino, C.A., and Parreira, W. (2020). A Review of Techniques for Implementing Elliptic Curve Point Multiplication on Hardware. J. Sens. Actuator Netw., 10.","DOI":"10.3390\/jsan10010003"},{"key":"ref_71","doi-asserted-by":"crossref","unstructured":"Martins, J.A., Och\u00f4a, I.S., Silva, L.A., Mendes, A.S., Gonz\u00e1lez, G.V., Santana, J.D.P., and Leithardt, V.R.Q. (2020). PRIPRO: A Comparison of Classification Algorithms for Managing Receiving Notifications in Smart Environments. Appl. Sci., 10.","DOI":"10.3390\/app10020502"},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/TLA.2020.9099759","article-title":"A Solution for Dynamic Management of User Profiles in IoT Environments","volume":"18","author":"Leithardt","year":"2020","journal-title":"IEEE Lat. Am. Trans."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/9\/1697\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:02:52Z","timestamp":1760166172000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/9\/1697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,14]]},"references-count":72,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2021,9]]}},"alternative-id":["sym13091697"],"URL":"https:\/\/doi.org\/10.3390\/sym13091697","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202109.0125.v1","asserted-by":"object"}]},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,14]]}}}