A new exact algorithm for the shortest path problem: An optimized shortest distance matrix

Yuan, Huiping; Hu, Jianlu; Song, Yufan; Li, Yanke; Du, Jie

doi:10.1016/j.cie.2021.107407

Cited by 10 publications

(4 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this is a problem that has been solved in graph theory. Some methods for computing shortest path lengths (Bellman-Ford and Dijkstra algorithms) are described in [28], and optimized versions can be found in [29]. A basic version of Dijkstra's algorithm is used in this work.…”

Section: Pressure Interpolation Using Gprmentioning

confidence: 99%

Pressure Interpolation in Water Distribution Networks by Using Gaussian Processes: Application to Leak Diagnosis

Liy-González,

Santos-Ruiz,

Delgado-Aguiñaga

et al. 2024

Processes

View full text Add to dashboard Cite

This work presents the reconstruction of the pressure head map of a water distribution system (WDS). This approach relies on historical data collected from a reduced number of sensors placed at some nodes of the WDS. Thus, a Gaussian regression process is then applied to estimate the pressure head at those nodes without a sensor, which allows the reconstruction of the pressure map for the whole network. Then, for leak diagnosis purposes, a dataset of pressure head maps of the WDN is created considering leaky scenarios, and a correlation method is applied to estimate the leak location. Then, for clarity, the Hanoi network is used to evaluate the performance of this leak diagnosis strategy in a simulation environment, assuming the availability of only three sensors. The results showed the potential for pressure head map reconstruction and leak localization.

show abstract

Section: Pressure Interpolation Using Gprmentioning

confidence: 99%

Pressure Interpolation in Water Distribution Networks by Using Gaussian Processes: Application to Leak Diagnosis

Liy-González,

Santos-Ruiz,

Delgado-Aguiñaga

et al. 2024

Processes

View full text Add to dashboard Cite

show abstract

“…The goal is to find m Hamiltonian cycles in G by minimizing the difference between the highest edge cost and the smallest edge cost in the tours. The SPP [6,7] and many variants have been proposed in the literature for facing problems arising in various fields, together with ever more efficient algorithms (see, for example, in [8][9][10][11]). Although the SPP can be solved in polynomial time using various algorithms, many of its variants are known to be NP-hard.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Equations ( 9) and (10) defines variables t i ; t o is set to zero (i.e., from the origin node the outflow is equal to zero), while t j is set greater than the flow leaving node i, if arc (i, j) is selected. Finally, in (11) and ( 12) the decision variables are defined.…”

Section: Mathematical Modelmentioning

confidence: 99%

The Cost-Balanced Path Problem: A Mathematical Formulation and Complexity Analysis

Ambrosino

Cerrone

2022

Mathematics

View full text Add to dashboard Cite

This paper introduces a new variant of the Shortest Path Problem (SPP) called the Cost-Balanced Path Problem (CBPP). Various real problems can either be modeled as BCPP or include BCPP as a sub-problem. We prove several properties related to the complexity of the CBPP problem. In particular, we demonstrate that the problem is NP-hard in its general version, but it becomes solvable in polynomial time in a specific family of instances. Moreover, a mathematical formulation of the CBPP, as a mixed-integer programming model, is proposed, and some additional constraints for modeling real requirements are given. This paper validates the proposed model and its extensions with experimental tests based on random instances. The analysis of the results of the computational experiments shows that the proposed model and its extension can be used to model many real applications. Obviously, due to the problem complexity, the main limitation of the proposed approach is related to the size of the instances. A heuristic solution approach should be required for larger-sized and more complex instances.

show abstract

“…Based on the literature that has been studied by [6]- [8], the techniques and methods used by [2] have limitations, namely: 1) focus on local features, 2) do not take context into account, 3) less effective for complex English, 4) the shortest path finding algorithm has high computational complexity, mainly when applied to long sentences. Referring to the limitations of previous research, a strategy is needed to extract relations between entities that still consider contextual sentences and are compatible with complex English structures.…”

Section: Introductionmentioning

confidence: 99%

Plant-Disease Relation Model through BERT-BiLSTM-CRF Approach

Riyanto,

Sitanggang,

Djatna

et al. 2024

IJEEI

View full text Add to dashboard Cite

Plant Disease Relations (PDR) is one of the Information Extraction (IE) subtasks that reveals the relationship between plant entities and diseases that appear together in a sentence. Previous studies have proposed methods for detecting the extraction of relationships between plant diseases (PDR). Previous research has proposed a Short Dependency Path-Convolutional Neural Network (SDP-CNN) method to predict relationships. However, the proposed method has limitations when faced with long and complex sentences. To overcome these limitations, this study proposes the BERT-BiLSTM-CRF method to improve the model performance in detecting PDR. First, the data is processed into the BERT Encoder layer after the tokenization process. After the BERT Encoder calculates the hidden information, the next step is to enter the linear layer to obtain word embedding. Calculation results in the bilinear layer are forwarded to the softmax layer to predict the relationship of each pair. Computation results in the softmax layer are sent to the BiLSTM layer. Finally, the CRF layer is entered to improve the prediction process. An 80:20 ratio for training and testing data was used to build the model using the same parameter values over ten attempts. GridSearch hyperparameter tuning is also involved in improving model performance. Experimental results show that the architecture proposed in this research can increase the F1 score by 0.790, which proved to be higher than SDP-CNN with a micro F1 score of 0.764. The problem of predicting PDR was overcome by the BERT-BILSTM-CRF method. The issue of forecasting PDR was resolved using the BERT-BILSTM-CRF approach.

show abstract

A new exact algorithm for the shortest path problem: An optimized shortest distance matrix

Cited by 10 publications

References 50 publications

Pressure Interpolation in Water Distribution Networks by Using Gaussian Processes: Application to Leak Diagnosis

Pressure Interpolation in Water Distribution Networks by Using Gaussian Processes: Application to Leak Diagnosis

The Cost-Balanced Path Problem: A Mathematical Formulation and Complexity Analysis

Plant-Disease Relation Model through BERT-BiLSTM-CRF Approach

Contact Info

Product

Resources

About