Finding shortest path in static networks
Seher Abbasi · Fahimeh Moosavi
International Journal of Finance & Banking Studies · 2012 · Vol. 1 / Issue 1 · 29-34
Publication metrics
External links open provider records or DOI searches. Provider counts are not combined. Mendeley readership measures saves, not citations.
Dimensions
Live provider badge. If unavailable, use the Dimensions link above.
Observed 21 Oct 2026, 00:21 UTC
Observed 21 Oct 2026 00:21 UTC
OpenAlex and Mendeley observations refresh on article visits, at most once per 24 hours. Unavailable data is not zero. Google Scholar opens a DOI search.
Citations received by this article, grouped by the year of the citing work. Crossref and OpenAlex lifetime totals remain separate in Publication metrics.
2017–2026 Annual history last updated:
Citations received
OpenAlex · year of the citing work
Hover over a year or focus the chart and use arrow keys to inspect values.
2017–2026 annual-history window. 2026 is year to date. Unknown years have gaps.
View data & coverage
2026 is incomplete. Within a successfully fetched ten-year window, omitted years mean zero. Years beyond a saved observation’s window remain unknown (—). Older citations are excluded, so this chart’s sum may differ from the OpenAlex lifetime total. The date above belongs to this annual history; an unsuccessful refresh keeps the previous observation.
Abstract
This paper considers the problem of finding the shortest path in a static network, where the costs are constant. The CE Algorithm based strategy that is presented by Rubinstein to solving rare event and combinatorial optimization problem is modified to finding shortest path in this research. To analyze the efficiency of the used algorithm three sets of small, medium and large sized problems that generated randomly are solved. The results on the set of problems show that the modified algorithm produces good solutions and time saving in computation of large-scale network.
Keywords: {'name': 'shortest path'}, {'name': 'CE Algorithm'}, {'name': 'rare event'}, {'name': 'combinatorial'}
Authors & affiliations
Seher Abbasi
Affiliation not supplied
Fahimeh Moosavi
Affiliation not supplied
Deposited references
Supplied references, not a list of publications citing this article.
DOI: 10.1007/s10479-005-5724-z
DOI: 10.2139/ssrn.2055042
DOI: 10.1016/j.ejor.2010.01.003
DOI: 10.1007/s10479-005-5726-x
DOI: 10.1023/B:QUES.0000027989.97672.be
DOI: 10.1002/9780470400531.eorms0210
DOI: 10.1007/BF01386390
[1] M. Bazaraa, J. Jarvis, H. Sherali, Linear Programming and Network Flows, second ed., Wiley, New York, 1990.
DOI: 10.1016/0360-8352(94)90335-2
DOI: 10.1109/ICEC.1997.592343
DOI: 10.1007/s10700-005-4916-y
DOI: 10.1016/S0377-2217(01)00354-X