Skip to Content
You are currently on the new version of our website. Access the old version .

Algorithms, Volume 13, Issue 11

2020 November - 41 articles

Cover Story: We review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to model things such as waiting times at road junctions and delays due to transfers in public transport. The usual way of handling such penalties is through graph expansion. As an alternative, we propose two variants of Dijkstra’s algorithm that operate on the original, unexpanded graph. Analyses are then presented to gauge the relative advantages and disadvantages of these methods. Asymptotically, compared to using Dijkstra’s algorithm on expanded graphs, our first variant is faster for very sparse graphs but slower with dense graphs. In contrast, the second variant features identical worst-case run times. View this paper
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (41)

  • Article
  • Open Access
5 Citations
3,431 Views
14 Pages

Searching via Nonlinear Quantum Walk on the 2D-Grid

  • Giuseppe Di Molfetta and
  • Basile Herzog

23 November 2020

We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational ad...

(This article belongs to the Section Analysis of Algorithms and Complexity Theory)
  • Article
  • Open Access
6 Citations
5,341 Views
27 Pages

Finding the Best 3-OPT Move in Subcubic Time

  • Giuseppe Lancia and
  • Marcello Dalpasso

23 November 2020

Given a Traveling Salesman Problem solution, the best 3-OPT move requires us to remove three edges and replace them with three new ones so as to shorten the tour as much as possible. No worst-case algorithm better than the Θ(n3) enumeration of...

(This article belongs to the Special Issue 2020 Selected Papers from Algorithms Editorial Board Members)
  • Article
  • Open Access
15 Citations
5,032 Views
14 Pages

23 November 2020

A Pseudo-Random Number Generator (PRNG) is any algorithm generating a sequence of numbers approximating properties of random numbers. These numbers are widely employed in mid-level cryptography and in software applications. Test suites are used to ev...

  • Article
  • Open Access
7 Citations
3,257 Views
24 Pages

20 November 2020

We develop a family of three-step sixth order methods with generic weight functions employed in the second and third sub-steps for solving nonlinear systems. Theoretical and computational studies are of major concern for the convergence behavior with...

(This article belongs to the Special Issue Iterative Algorithms for Nonlinear Problems: Convergence and Stability)
  • Article
  • Open Access
11 Citations
4,045 Views
22 Pages

Combining Optimization and Simulation for Designing a Robust Short-Sea Feeder Network

  • Carl Axel Benjamin Medbøen,
  • Magnus Bolstad Holm,
  • Mohamed Kais Msakni,
  • Kjetil Fagerholt and
  • Peter Schütz

20 November 2020

Here we study a short-sea feeder network design problem based on mother and daughter vessels. The main feature of the studied system is performing transshipment of cargo between mother and daughter vessels at appropriate locations at sea. This operat...

(This article belongs to the Special Issue Simulation-Optimization in Logistics, Transportation, and SCM)
  • Article
  • Open Access
29 Citations
6,284 Views
14 Pages

I3D-Shufflenet Based Human Action Recognition

  • Guocheng Liu,
  • Caixia Zhang,
  • Qingyang Xu,
  • Ruoshi Cheng and ,
  • Yong Song,
  • Xianfeng Yuan and
  • Jie Sun
  • + 2 authors+ 0 author

18 November 2020

In view of difficulty in application of optical flow based human action recognition due to large amount of calculation, a human action recognition algorithm I3D-shufflenet model is proposed combining the advantages of I3D neural network and lightweig...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Article
  • Open Access
2 Citations
6,630 Views
23 Pages

Graphs from Features: Tree-Based Graph Layout for Feature Analysis

  • Rosane Minghim,
  • Liz Huancapaza,
  • Erasmo Artur,
  • Guilherme P. Telles and
  • Ivar V. Belizario

18 November 2020

Feature Analysis has become a very critical task in data analysis and visualization. Graph structures are very flexible in terms of representation and may encode important information on features but are challenging in regards to layout being adequat...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
5 Citations
4,759 Views
15 Pages

Efficient Rule Generation for Associative Classification

  • Chartwut Thanajiranthorn and
  • Panida Songram

17 November 2020

Associative classification (AC) is a mining technique that integrates classification and association rule mining to perform classification on unseen data instances. AC is one of the effective classification techniques that applies the generated rules...

(This article belongs to the Special Issue Algorithms in Decision Support Systems)
  • Article
  • Open Access
124 Citations
15,402 Views
16 Pages

Groundwater Prediction Using Machine-Learning Tools

  • Eslam A. Hussein,
  • Christopher Thron,
  • Mehrdad Ghaziasgar,
  • Antoine Bagula and
  • Mattia Vaccari

17 November 2020

Predicting groundwater availability is important to water sustainability and drought mitigation. Machine-learning tools have the potential to improve groundwater prediction, thus enabling resource planners to: (1) anticipate water quality in unsample...

(This article belongs to the Special Issue Interpretability, Accountability and Robustness in Machine Learning)
  • Article
  • Open Access
6 Citations
5,893 Views
18 Pages

Modalflow: Cross-Origin Flow Data Visualization for Urban Mobility

  • Ignacio Pérez-Messina,
  • Eduardo Graells-Garrido,
  • María Jesús Lobo and
  • Christophe Hurter

15 November 2020

Pervasive data have become a key source of information for mobility and transportation analyses. However, as a secondary source, it has a different methodological origin than travel survey data, usually relying on unsupervised algorithms, and so it r...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
4 Citations
4,019 Views
14 Pages

A Novel Multi-Dimensional Composition Method Based on Time Series Similarity for Array Pulse Wave Signals Detecting

  • Hongjie Zou,
  • Yitao Zhang,
  • Jun Zhang,
  • Chuanglu Chen and ,
  • Xingguang Geng,
  • Shaolong Zhang and
  • Haiying Zhang
  • + 2 authors+ 0 author

14 November 2020

Pulse wave signal sensed over the radial artery on the wrist is a crucial physiological indicator in disease diagnosis. The sensor array composed of multiple sensors has the ability to collect abundant pulse wave information. As a result, it has grad...

(This article belongs to the Special Issue Algorithms and Applications of Time Series Analysis)
  • Article
  • Open Access
2 Citations
3,634 Views
24 Pages

Variational Multiscale Nonparametric Regression: Algorithms and Implementation

  • Miguel del Alamo,
  • Housen Li,
  • Axel Munk and
  • Frank Werner

13 November 2020

Many modern statistically efficient methods come with tremendous computational challenges, often leading to large-scale optimisation problems. In this work, we examine such computational issues for recently developed estimation methods in nonparametr...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Feature Paper
  • Article
  • Open Access
4 Citations
5,755 Views
22 Pages

13 November 2020

We propose and investigate two new methods to approximate f(A)b for large, sparse, Hermitian matrices A. Computations of this form play an important role in numerous signal processing and machine learning tasks. The main idea behind both methods is t...

(This article belongs to the Special Issue Efficient Graph Algorithms in Machine Learning)
  • Article
  • Open Access
1 Citations
4,376 Views
33 Pages

Computing Maximal Lyndon Substrings of a String

  • Frantisek Franek and
  • Michael Liut

12 November 2020

There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maxima...

(This article belongs to the Special Issue Combinatorial Methods for String Processing)
  • Editorial
  • Open Access
4 Citations
2,618 Views
2 Pages

11 November 2020

This Special Issue of Algorithms presents recent advances in the area of graphs and networks, focusing particularly on optimisation problems and their associated algorithms [...]

(This article belongs to the Special Issue Algorithms for Graphs and Networks)
  • Article
  • Open Access
5 Citations
4,849 Views
15 Pages

11 November 2020

Stability of persistence diagrams under slight perturbations is a key characteristic behind the validity and growing popularity of topological data analysis in exploring real-world data. Central to this stability is the use of Bottleneck distance whi...

(This article belongs to the Special Issue Topological Data Analysis)
  • Article
  • Open Access
47 Citations
6,026 Views
19 Pages

11 November 2020

In this work, a deep Gaussian process (DGP) based framework is proposed to improve the accuracy of predicting flight trajectory in air traffic research, which is further applied to implement a probabilistic conflict detection algorithm. The Gaussian...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Article
  • Open Access
10 Citations
3,860 Views
14 Pages

Self-Learning Salp Swarm Optimization Based PID Design of Doha RO Plant

  • Naresh Patnana,
  • Swapnajit Pattnaik,
  • Tarun Varshney and
  • Vinay Pratap Singh

10 November 2020

In this investigation, self-learning salp swarm optimization (SLSSO) based proportional- integral-derivative (PID) controllers are proposed for a Doha reverse osmosis desalination plant. Since the Doha reverse osmosis plant (DROP) is interacting with...

(This article belongs to the Special Issue Swarm Intelligence Applications and Algorithms)
  • Article
  • Open Access
3 Citations
2,779 Views
15 Pages

10 November 2020

The Wyoming Department of Transportation (WYDOT) initiated a project to optimize the heights of barriers that are not satisfying the barrier design criteria, while prioritizing them based on an ability to achieve higher monetary benefits. The equival...

(This article belongs to the Special Issue Bayesian Networks: Inference Algorithms, Applications, and Software Tools)
  • Article
  • Open Access
15 Citations
4,100 Views
19 Pages

Algorithm for Mapping Kidney Tissue Water Content during Normothermic Machine Perfusion Using Hyperspectral Imaging

  • Wenke Markgraf,
  • Jannis Lilienthal,
  • Philipp Feistel,
  • Christine Thiele and
  • Hagen Malberg

10 November 2020

The preservation of kidneys using normothermic machine perfusion (NMP) prior to transplantation has the potential for predictive evaluation of organ quality. Investigations concerning the quantitative assessment of physiological tissue parameters and...

(This article belongs to the Special Issue Algorithms in Hyperspectral Data Analysis)
  • Article
  • Open Access
1 Citations
4,378 Views
27 Pages

Similarity-Driven Edge Bundling: Data-Oriented Clutter Reduction in Graphs Layouts

  • Fabio Sikansi,
  • Renato R. O. da Silva,
  • Gabriel D. Cantareira,
  • Elham Etemad and
  • Fernando V. Paulovich

10 November 2020

Graph visualization has been successfully applied in a wide range of problems and applications. Although different approaches are available to create visual representations, most of them suffer from clutter when faced with many nodes and/or edges. Am...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
10 Citations
3,504 Views
17 Pages

Differential Evolution with Linear Bias Reduction in Parameter Adaptation

  • Vladimir Stanovov,
  • Shakhnaz Akhmedova and
  • Eugene Semenkin

9 November 2020

In this study, a new parameter control scheme is proposed for the differential evolution algorithm. The developed linear bias reduction scheme controls the Lehmer mean parameter value depending on the optimization stage, allowing the algorithm to imp...

(This article belongs to the Section Evolutionary Algorithms and Machine Learning)
  • Article
  • Open Access
15 Citations
8,257 Views
20 Pages

9 November 2020

A large amount of time series data is being generated every day in a wide range of sensor application domains. The symbolic aggregate approximation (SAX) is a well-known time series representation method, which has a lower bound to Euclidean distance...

(This article belongs to the Special Issue Algorithms and Applications of Time Series Analysis)
  • Article
  • Open Access
17 Citations
4,113 Views
27 Pages

Efficient Time and Space Representation of Uncertain Event Data

  • Marco Pegoraro,
  • Merih Seran Uysal and
  • Wil M. P. van der Aalst

9 November 2020

Process mining is a discipline which concerns the analysis of execution data of operational processes, the extraction of models from event data, the measurement of the conformance between event data and normative models, and the enhancement of all as...

(This article belongs to the Special Issue Process Mining and Emerging Applications)
  • Article
  • Open Access
5 Citations
4,539 Views
22 Pages

On the Solutions of Second-Order Differential Equations with Polynomial Coefficients: Theory, Algorithm, Application

  • Kyle R. Bryenton,
  • Andrew R. Cameron,
  • Keegan L. A. Kirk,
  • Nasser Saad and ,
  • Patrick Strongman and
  • Nikita Volodin
  • + 1 author+ 0 author

9 November 2020

The analysis of many physical phenomena is reduced to the study of linear differential equations with polynomial coefficients. The present work establishes the necessary and sufficient conditions for the existence of polynomial solutions to linear di...

(This article belongs to the Special Issue Iterative Algorithms for Nonlinear Problems: Convergence and Stability)
  • Editorial
  • Open Access
3,388 Views
4 Pages

7 November 2020

Nonsmooth optimization refers to the general problem of minimizing (or maximizing) functions that have discontinuous gradients. This Special Issue contains six research articles that collect together the most recent techniques and applications in the...

(This article belongs to the Special Issue Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov)
  • Article
  • Open Access
4 Citations
3,911 Views
20 Pages

Cross-Entropy Method in Application to the SIRC Model

  • Maria Katarzyna Stachowiak and
  • Krzysztof Józef Szajowski

6 November 2020

The study considers the usage of a probabilistic optimization method called Cross-Entropy (CE). This is the version of the Monte Carlo method created by Reuven Rubinstein (1997). It was developed in the context of determining rare events. Here we wil...

(This article belongs to the Special Issue Algorithms for Sequential Analysis)
  • Article
  • Open Access
22 Citations
5,513 Views
15 Pages

Identifying Influential Nodes of Complex Networks Based on Trust-Value

  • Jinfang Sheng,
  • Jiafu Zhu,
  • Yayun Wang,
  • Bin Wang and
  • Zheng’ang Hou

5 November 2020

The real world contains many kinds of complex network. Using influence nodes in complex networks can promote or inhibit the spread of information. Identifying influential nodes has become a hot topic around the world. Most of the existing algorithms...

(This article belongs to the Section Analysis of Algorithms and Complexity Theory)
  • Article
  • Open Access
23 Citations
7,662 Views
27 Pages

Translating Workflow Nets to Process Trees: An Algorithmic Approach

  • Sebastiaan J. van Zelst and
  • Sander J. J. Leemans

2 November 2020

Since their introduction, process trees have been frequently used as a process modeling formalism in many process mining algorithms. A process tree is a (mathematical) tree-based model of a process, in which internal vertices represent behavioral con...

(This article belongs to the Special Issue Process Mining and Emerging Applications)
  • Article
  • Open Access
6 Citations
6,348 Views
26 Pages

31 October 2020

In modern production systems, scheduling problems have to be solved in consideration of frequently changing demands and varying production parameters. This paper presents a approach combining forecasting and classification techniques to predict uncer...

(This article belongs to the Special Issue Simulation-Optimization in Logistics, Transportation, and SCM)
  • Article
  • Open Access
23 Citations
6,487 Views
13 Pages

Using Zigzag Persistent Homology to Detect Hopf Bifurcations in Dynamical Systems

  • Sarah Tymochko,
  • Elizabeth Munch and
  • Firas A. Khasawneh

31 October 2020

Bifurcations in dynamical systems characterize qualitative changes in the system behavior. Therefore, their detection is important because they can signal the transition from normal system operation to imminent failure. In an experimental setting, th...

(This article belongs to the Special Issue Topological Data Analysis)
  • Article
  • Open Access
38 Citations
5,349 Views
19 Pages

Short-Term Firm-Level Energy-Consumption Forecasting for Energy-Intensive Manufacturing: A Comparison of Machine Learning and Deep Learning Models

  • Andrea Maria N. C. Ribeiro,
  • Pedro Rafael X. do Carmo,
  • Iago Richard Rodrigues,
  • Djamel Sadok and ,
  • Theo Lynn and
  • Patricia Takako Endo
  • + 1 author+ 0 author

30 October 2020

To minimise environmental impact, to avoid regulatory penalties, and to improve competitiveness, energy-intensive manufacturing firms require accurate forecasts of their energy consumption so that precautionary and mitigation measures can be taken. D...

  • Article
  • Open Access
6 Citations
3,987 Views
21 Pages

30 October 2020

Studying real-world networks such as social networks or web networks is a challenge. These networks often combine a complex, highly connected structure together with a large size. We propose a new approach for large scale networks that is able to aut...

(This article belongs to the Special Issue Efficient Graph Algorithms in Machine Learning)
  • Article
  • Open Access
11 Citations
3,833 Views
9 Pages

Efficient Data Structures for Range Shortest Unique Substring Queries

  • Paniz Abedin,
  • Arnab Ganguly,
  • Solon P. Pissis and
  • Sharma V. Thankachan

30 October 2020

Let T[1,n] be a string of length n and T[i,j] be the substring of T starting at position i and ending at position j. A substring T[i,j] of T is a repeat if it occurs more than once in T; otherwise, it is a unique substring of T. Repeats and unique su...

(This article belongs to the Special Issue Combinatorial Methods for String Processing)
  • Article
  • Open Access
17 Citations
4,581 Views
14 Pages

A Multiple-Input Neural Network Model for Predicting Cotton Production Quantity: A Case Study

  • Ioannis E. Livieris,
  • Spiros D. Dafnis,
  • George K. Papadopoulos and
  • Dionissios P. Kalivas

29 October 2020

Cotton constitutes a significant commercial crop and a widely traded commodity around the world. The accurate prediction of its yield quantity could lead to high economic benefits for farmers as well as for the rural national economy. In this researc...

(This article belongs to the Section Databases and Data Structures)
  • Article
  • Open Access
14 Citations
3,423 Views
13 Pages

28 October 2020

Visual traffic surveillance using computer vision techniques can be noninvasive, automated and cost effective. Traffic surveillance systems with the ability to detect, count and classify vehicles can be employed in gathering traffic statistics and ac...

  • Article
  • Open Access
1 Citations
3,096 Views
15 Pages

Exploring the Dynamic Organization of Random and Evolved Boolean Networks

  • Gianluca d’Addese,
  • Salvatore Magrì,
  • Roberto Serra and
  • Marco Villani

28 October 2020

The properties of most systems composed of many interacting elements are neither determined by the topology of the interaction network alone, nor by the dynamical laws in isolation. Rather, they are the outcome of the interplay between topology and d...

(This article belongs to the Section Evolutionary Algorithms and Machine Learning)
  • Article
  • Open Access
3 Citations
3,413 Views
24 Pages

Efficient Strategies Algorithms for Resource Allocation Problems

  • Yacouba Adama Koné,
  • Jacqueline Konaté,
  • Oumar Y. Maïga and
  • Hamidou Tembiné

23 October 2020

Strategic modelling with a panoramic view plays an important role in decision-making problems. It offers the possibility of generating different solutions before making a decision. This is particularly relevant in critical situations. This article ad...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Article
  • Open Access
30 Citations
5,196 Views
10 Pages

22 October 2020

Deep neural networks (DNNs) are vulnerable to adversarial attacks. In particular, a single perturbation known as the universal adversarial perturbation (UAP) can foil most classification tasks conducted by DNNs. Thus, different methods for generating...

(This article belongs to the Special Issue Iterative Algorithms for Nonlinear Problems: Convergence and Stability)
  • Article
  • Open Access
4 Citations
4,703 Views
17 Pages

22 October 2020

Predictive process monitoring aims to accurately predict a variable of interest (e.g., remaining time) or the future state of the process instance (e.g., outcome or next step). The quest for models with higher predictive power has led to the developm...

(This article belongs to the Special Issue Process Mining and Emerging Applications)
  • Article
  • Open Access
29 Citations
8,816 Views
21 Pages

22 October 2020

In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be use...

(This article belongs to the Special Issue Algorithms for Graphs and Networks)
XFacebookLinkedIn
Algorithms - ISSN 1999-4893