Announcements

“Optimizing Convolutional Neural Network Hyperparameters by Enhanced Swarm Intelligence Metaheuristics”
Milan Tuba et al.
Algorithms 2020, 13(3), 67; 10.3390/a13030067

“Nature-Inspired Optimization Algorithms for Text Document Clustering—A Comprehensive Analysis”
Amir H. Gandomi et al.
Algorithms 2020, 13(12), 345; 10.3390/a13120345

“A Comparative Study of Four Metaheuristic Algorithms, AMOSA, MOABC, MSPSO, and NSGA-II for Evacuation Planning”
Olive Niyomubyeyi et al.
Algorithms 2020, 13(1), 16; 10.3390/a13010016

“A Multiobjective Large Neighborhood Search Metaheuristic for the Vehicle Routing Problem with Time Windows”
Grigorios D. Konstantakopoulos et al.
Algorithms 2020, 13(10), 243; 10.3390/a13100243

“Research and Study of the Hybrid Algorithms Based on the Collective Behavior of Fish Schools and Classical Optimization Methods”
Liliya A. Demidova and Artyom V. Gorchakov
Algorithms 2020, 13(4), 85; 10.3390/a13040085

“A Survey of Advances in Landscape Analysis for Optimisation”
Katherine Mary Malan
Algorithms 2021, 14(2), 40; 10.3390/a14020040

“Bio-Inspired Algorithms and Its Applications for Optimization in Fuzzy Clustering”
Oscar Castillo et al.
Algorithms 2021, 14(4), 122; 10.3390/a14040122

“A Multi-Objective Optimization Method for Hospital Admission Problem—A Case Study on Covid-19 Patients”
Amr Mohamed AbdelAziz and Louai Alarabi et al.
Algorithms 2021, 14(2), 38; 10.3390/a14020038

“Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty”
Rafael D. Tordecilla et al.
Algorithms 2021, 14(2), 45; 10.3390/a14020045

“An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks”
Christian Blum et al.
Algorithms 2021, 14(3), 79; 10.3390/a14030079

“Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties”
Rhyd Lewis et al.
Algorithms 2020, 13(11), 269; 10.3390/a13110269

“COVID-19 Outbreak Prediction with Machine Learning”
Amir Mosavi et al.
Algorithms 2020, 13(10), 249; 10.3390/a13100249

“When 5G Meets Deep Learning: A Systematic Review”
Patricia Takako Endo et al.
Algorithms 2020, 13(9), 208; 10.3390/a13090208

“An IoT System for Social Distancing and Emergency Management in Smart Cities Using Multi-Sensor Data”
Massimo Merenda et al.
Algorithms 2020, 13(10), 254; 10.3390/a13100254

“Towards Cognitive Recommender Systems”
Amin Beheshti et al.
Algorithms 2020, 13(8), 176; 10.3390/a13080176

“A Review of Lithium-Ion Battery Fault Diagnostic Algorithms: Current Progress and Future Challenges”
Michael Fowler et al.
Algorithms 2020, 13(3), 62; 10.3390/a13030062

“A Review on Recent Advancements in FOREX Currency Prediction”
Karl Andersson et al.
Algorithms 2020, 13(8), 186; 10.3390/a13080186

“Designing the Uniform Stochastic Photomatrix Therapeutic Systems”
Yulian A. Menyaev et al.
Algorithms 2020, 13(2), 41; 10.3390/a13020041

“A Multiple-Input Neural Network Model for Predicting Cotton Production Quantity: A Case Study”
Ioannis E. Livieris et al.
Algorithms 2020, 13(11), 273; 10.3390/a13110273

“Groundwater Prediction Using Machine-Learning Tools”
Eslam A. Hussein et al.
Algorithms 2020, 13(11), 300; 10.3390/a13110300

We are pleased to welcome Dr. Martin Gebser, Prof. Dr. Antonio Sarasa Cabezuelo and Prof. Dr. Sheng Du to the Topical Advisory Panel of Algorithms (ISSN: 1999-4893).

Dr. Martin Gebser currently works at the Department of Artificial Intelligence and Cybersecurity, University of Klagenfurt, Universitätsstraße 65-67, 9020 Klagenfurt, Austria. He has been serving as a Committee Member in the Programme Committee within the PADL since 2019, the Session Chair of Answer Set Programming (part of PADL 2022), and he was the Chair of Break: Ask Me Anything within the LPOP 2020 track. His research interests include artificial intelligence; declarative problem solving; knowledge representation and reasoning; computational logic; and answer set programming.

Prof. Dr. Antonio Sarasa Cabezuelo currently works at the Facultad de Informática, Universidad Complutense de Madrid, 28040 Madrid, Spain. He is a member of the Official Research Course group of the UCM in the Engineering of Software Languages and Applications (ILSA). He has participated as a researcher in ten national plan projects, one project of the Community of Madrid, being the IP of the group of the Faculty of Informatics of the UCM, and in twelve Educational Innovation projects, in five of them as the Director. He has been one of the Spanish MC Members in the action COST IS0704 INTEREDITION “An Interoperable Supranational Infrastructure for Digital Editions”. He has been a researcher of the network S2008/TIC-1650 "Research and development of technologies for ELearning in the CM (eMadrid)" of the Community of Madrid.

We are pleased to welcome Prof. Dr. Manuel Torrilhon, Prof. Dr. Changjiang Zhu and Dr. Ali Pinar to the Editorial Board of Algorithms (ISSN: 1999-4893).

Prof. Dr. Manuel Torrilhon is a full professor in the Mathematics Department at RWTH Aachen University in Germany, and currently serves as the Director of the Center for Computational Engineering Science at RWTH. His research focus is on numerical methods for mathematical modeling with partial differential equations, especially hyperbolic conservation laws, kinetic theory, the Boltzmann equation, and plasma physics.

Prof. Dr. Changjiang Zhu currently works as a full professor at the School of Mathematics, South China University of Technology, P. R. China. His areas of interest include fluid dynamics, hyperbolic conservation laws, the stability of nonlinear waves, and the Boltzmann equation.

Dr. Ali Pinar works on various applications that involve graphs. Recently, he has been working on modeling large-scale graphs, such as those of social networks and cyber networks. He is a distinguished member of the ACM and is also on the Editorial Boards of Algorithms (MDPI), SIAM Journal on Scientific Computing, SIAM News, and the Journal on Complex Networks.

“COVID-19 Prediction Applying Supervised Machine Learning Algorithms with Comparative Analysis Using WEKA”
Charlyn Nayve Villavicencio et al
Algorithms 2021, 14(7), 201; 10.3390/a14070201

“Short Communication: Detecting Heavy Goods Vehicles in Rest Areas in Winter Conditions Using YOLOv5”
Margrit Kasper-Eulaers and Per Egil Kummervold et al
Algorithms 2021, 14(4), 114; 10.3390/a14040114

“Phase Congruential White Noise Generator”
Yulian A. Menyaev et al
Algorithms 2021, 14(4), 118; 10.3390/a14040118

“Circle-U-Net: An Efficient Architecture for Semantic Segmentation”
Guanci Yang et al
Algorithms 2021, 14(6), 159; 10.3390/a14060159

“Bio-Inspired Algorithms and Its Applications for Optimization in Fuzzy Clustering”
Oscar Castillo et al
Algorithms 2021, 14(4), 122; 10.3390/a14040122

“A Real-Time Network Traffic Classifier for Online Applications Using Machine Learning”
Ahmed Abdelmoamen Ahmed et al
Algorithms 2021, 14(8), 250; 10.3390/a14080250

“An Integrated Neural Network and SEIR Model to Predict COVID-19”
Karl Andersson et al
Algorithms 2021, 14(3), 94; 10.3390/a14030094

“A Multi-Objective Optimization Method for Hospital Admission Problem—A Case Study on Covid-19 Patients”
Amr Mohamed AbdelAziz and Louai Alarabi et al
Algorithms 2021, 14(2), 38; 10.3390/a14020038

“Dynamic Shortest Paths Methods for the Time-Dependent TSP”
Christoph Hansknecht et al
Algorithms 2021, 14(1), 21; 10.3390/a14010021

“Machine Learning Predicts Outcomes of Phase III Clinical Trials for Prostate Cancer”
Felix D. Beacher et al
Algorithms 2021, 14(5), 147; 10.3390/a14050147

We are currently recruiting Topical Advisory Panel Members for Algorithms (ISSN 1999-4893). The main responsibilities of Members of the Topical Advisory Panel include regularly providing support to Guest Editors and Section Board Members. Further information on the role and responsibilities of Topical Advisory Panel Members is available here: https://www.mdpi.com/editors.

Algorithms is a fully open access journal published online monthly by MDPI since 2008. It is indexed by MathSciNet, Scopus, ESCI, and EI Compendex and has received a CiteScore (2020) of 2.90. The aims and scope of the journal can be found on our website: https://www.mdpi.com/journal/algorithms/about.

To qualify as a Topical Advisory Panel Member, applicants must:

• Have experience in the field related to the journal;
• Have received a Ph.D. in the last 10 years, approximately;
• Have published at least 6-8 papers in the last 5 years as a first author or corresponding author;
• Currently hold an independent research position in academia or a government institute.

If you are interested in this position, please apply via the following link: https://www.mdpi.com/journal/algorithms/topical_advisory_panel_application, or send an email to the Editorial Office (algorithms@mdpi.com) with your academic resume attached.

It is our pleasure to welcome Dr. Arun Kumar Sangaiah (VIT University), Prof. Ivan Kisel (Frankfurt Institute for Advanced Studies), Dr. Mostafa Abbaszadeh (Amirkabir University of Technology), and various other prominent academics as new Editorial Board Members of Algorithms (ISSN: 1999-4893). We look forward to their contributions to the journal.

It is our pleasure to announce that Dr. Seyedali Mirjalili, Editorial Board Member of Algorithms (ISSN: 1999-4893), has been listed as one of the 2021 Highly Cited Researchers by Clarivate. Dr. Seyedali Mirjalili is recognized for his advances in Swarm Intelligence (SI) and optimization, including the first set of Swarm Intelligence techniques from a synthetic intelligence standpoint—representing a radical departure from how natural systems are typically understood—and a systematic design framework to reliably benchmark, evaluate, and propose computationally cheap robust optimization algorithms.

It is our great honor to congratulate the Editorial Board Members and Editors in MDPI's journals who have been distinguished as 2021 Highly Cited Researchers by Clarivate, according to Web of Science data. We herewith express our gratitude for the immense impact the named researchers continue to make on scientific progress and on our journals' development.

Clarivate's annual list of Highly Cited Researchers^TM identifies the most highly cited scientists for the past decade. Their impactful papers are among the top 1 per cent in the citation distribution of one or more of 22 fields analyzed in the "Essential Science Indicators", distinguishing them as hugely influential among their peers.

The full list of 2021 Highly Cited Researchers  can be accessed at the following webpage in the Web of Science^TM https://recognition.webofscience.com/awards/highly-cited/2021/.

--- Highly Cited Researchers (HCR) is a Clarivate product.

Academic editors play a crucial role in leading our journals and ensuring that each article undergoes a robust and timely peer-review. With the launch of Topics this year and addition of Topic Editors to our family of academic editors, we decided it would be a good time to restructure our academic boards, thus providing more clarity and support for each role. MDPI is pleased to announce the launch of a new position—Topical Advisory Panel Member, that will replace the previous position of Topics Board Member. The Topical Advisory Panel will be comprised of early career researchers eager to gain experience in editorial work.

The main responsibility of the new members of the Topical Advisory Panel is to regularly provide support to Guest Editors, Topic Editors, and Section Board Members. The responsibilities of the Topical Advisory Panel are available here: https://www.mdpi.com/editors.

Each year, the members’ performances are evaluated, and outstanding members are promoted to the Editorial Board by the Editor-in-Chief.

To qualify as a Topical Advisory Panel Member, applicants must:

• Have expertise and experience in the field related to the journal;
• Have received a Ph.D. in the last 10 years, approximately;
• Have at least 6-8 published papers in the last 5 years as first author or corresponding author;
• Currently hold an independent research position in academia or a government institute.

If you are interested in this role, please contact the editorial office by email.

We look forward to hearing from you soon.