Evidence map›Paper›PMID 24959603›Full record

ArticleTheScientificWorldJournal2014

A bio-inspired method for the constrained shortest path problem.

Hongping Wang, Xi Lu, Xiaoge Zhang, Qing Wang, Yong Deng

Abstract read
In one paragraph

Article in TheScientificWorldJournal, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Hongping WangSchool of Computer and Information Science, Southwest University, Chongqing 400715, China.
Xi LuSchool of Computer and Information Science, Southwest University, Chongqing 400715, China.
Xiaoge ZhangSchool of Computer and Information Science, Southwest University, Chongqing 400715, China.ORCID 0000-0001-6831-3175
Qing WangSchool of Computer and Information Science, Southwest University, Chongqing 400715, China.
Yong DengSchool of Computer and Information Science, Southwest University, Chongqing 400715, China ; School of Engineering, Vanderbilt University, Nashiville, TN 37235, USA.ORCID 0000-0002-5481-5673

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem. In this paper, we propose an innovative method which is based on the internal mechanism of the adaptive amoeba algorithm. The proposed method is divided into two parts. In the first part, we employ the original amoeba algorithm to solve the shortest path problem in directed networks. In the second part, we combine the Physarum algorithm with a bio-inspired rule to deal with the CSP. Finally, by comparing the results with other method using an examples in DCLC problem, we demonstrate the accuracy of the proposed method.

Indexed as

AlgorithmsNeural Networks, Computer

Identifiers

PMID24959603
PMCPMC4052047

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.