Special Issue "Deep Learning and Hybrid-Metaheuristics: Novel Engineering Applications"

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Engineering Mathematics".

Deadline for manuscript submissions: closed (30 April 2021).

Special Issue Editors

Prof. Dr. Víctor Yepes
E-Mail Website
Guest Editor
Institute of Concrete Science and Technology (ICITECH), Universitat Politècnica de València, 46022 València, Spain
Interests: multiobjective optimization; structures optimization; lifecycle assessment; social sustainability of infrastructures; reliability-based maintenance optimization; optimization and decision-making under uncertainty
Special Issues and Collections in MDPI journals
Dr. José Antonio García
E-Mail Website
Guest Editor
Pontificia Universidad Católica de Valparaíso, Chile
Interests: optimization; deep learning; operations research; artificial intelligence applications to industrial problems

Special Issue Information

Dear Colleagues,

Hybrid metaheuristic methods have shown very good performances in different combinatorial problems. Additionally, the rise of machine learning techniques has created a space to develop metaheuristic algorithms that use these techniques in order to tackle NP-hard problems and improve the convergence of algorithms. In this Special Issue, we invite researchers to submit papers in this optimization line, applying hybrid algorithms to industrial problems, including but not limited to industrial applications, and challenging problems arising in the fields of big data, construction, sustainability, transportation, and logistics, among others.

Deep learning techniques have also been important tools in extracting features, classifying situations, predicting events, and assisting in decision making. Some of these tools have been applied, for example, to Industry 4.0. Among the main techniques used are feedforward networks (FNN), convolutional networks (CNN), long-term short memory (LSTM), autoencoders (AE), generative adversarial networks, and deep Q-networks (DQNs). Contributions on practical deep learning applications and cases are invited to this Special Issue, including but not limited to applications to the industry of computational vision, natural language processing, supervised learning applied to industry, unsupervised learning applied to industry, and reinforcement learning, among others.

Prof. Dr. Víctor Yepes
Dr. José Antonio García
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Construction
  • Smart cities
  • Optimization
  • Deep learning

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Article
A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit Problem
Mathematics 2021, 9(4), 315; https://doi.org/10.3390/math9040315 - 05 Feb 2021
Viewed by 448
Abstract
Most humans today have mobile phones. These devices are permanently collecting and storing behavior data of human society. Nevertheless, data processing has several challenges to be solved, especially if it is obtained from obsolete technologies. Old technologies like GSM and UMTS still account [...] Read more.
Most humans today have mobile phones. These devices are permanently collecting and storing behavior data of human society. Nevertheless, data processing has several challenges to be solved, especially if it is obtained from obsolete technologies. Old technologies like GSM and UMTS still account for almost half of all devices globally. The main problem in the data is known as neighboring network hit (NNH). An NNH occurs when a cellular device connects to a site further away than it corresponds to by network design, introducing an error in the spatio-temporal mobility analysis. The problems presented by the data are mitigated by eliminating erroneous data or diluting them statistically based on increasing the amount of data processed and the size of the study area. None of these solutions are effective if what is sought is to study mobility in small areas (e.g., Covid-19 pandemic). Elimination of complete records or traces in the time series generates deviations in subsequent analyses; this has a special impact on reduced spatial coverage studies. The present work is an evolution of the previous approach to NNH correction (NFA) and travel inference (TCA), based on binary logic. NFA and TCA combined deliver good travel counting results compared to government surveys (2.37 vs. 2.27, respectively). However, its main contribution is given by the increase in the precision of calculating the distances traveled (37% better than previous studies). In this document, we introduce FNFA and FTCA. Both algorithms are based on fuzzy logic and deliver even better results. We observed an improvement in the trip count (2.29, which represents 2.79% better than NFA). With FNFA and FTCA combined, we observe an average distance traveled difference of 9.2 km, which is 9.8% better than the previous NFA-TCA. Compared to the naive methods (without fixing the NNHs), the improvement rises from 28.8 to 19.6 km (46.9%). We use duly anonymized data from mobile devices from three major cities in Chile. We compare our results with previous works and Government’s Origin and Destination Surveys to evaluate the performance of our solution. This new approach, while improving our previous results, provides the advantages of a model better adapted to the diffuse condition of the problem variables and shows us a way to develop new models that represent open challenges in studies of urban mobility based on cellular data (e.g., travel mode inference). Full article
Show Figures

Figure 1

Article
An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics
Mathematics 2021, 9(3), 225; https://doi.org/10.3390/math9030225 - 24 Jan 2021
Viewed by 484
Abstract
The optimization methods and, in particular, metaheuristics must be constantly improved to reduce execution times, improve the results, and thus be able to address broader instances. In particular, addressing combinatorial optimization problems is critical in the areas of operational research and engineering. In [...] Read more.
The optimization methods and, in particular, metaheuristics must be constantly improved to reduce execution times, improve the results, and thus be able to address broader instances. In particular, addressing combinatorial optimization problems is critical in the areas of operational research and engineering. In this work, a perturbation operator is proposed which uses the k-nearest neighbors technique, and this is studied with the aim of improving the diversification and intensification properties of metaheuristic algorithms in their binary version. Random operators are designed to study the contribution of the perturbation operator. To verify the proposal, large instances of the well-known set covering problem are studied. Box plots, convergence charts, and the Wilcoxon statistical test are used to determine the operator contribution. Furthermore, a comparison is made using metaheuristic techniques that use general binarization mechanisms such as transfer functions or db-scan as binarization methods. The results obtained indicate that the KNN perturbation operator improves significantly the results. Full article
Show Figures

Figure 1

Back to TopTop