Finding shortest path in static networks
Open Access
- 21 January 2012
- journal article
- Published by Center for Strategic Studies in Business and Finance SSBFNET in International Journal of Finance & Banking Studies (2147-4486)
- Vol. 1 (1), 29-34
- https://doi.org/10.20525/ijfbs.v1i1.134
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
This publication has 10 references indexed in Scilit:
- Marginal Likelihood Estimation with the Cross-Entropy MethodSSRN Electronic Journal, 2012
- Cross-Entropy MethodPublished by Wiley ,2011
- Efficient estimation of large portfolio loss probabilities in t-copula modelsEuropean Journal of Operational Research, 2010
- Solving the Shortest Path Problem with Interval ArcsFuzzy Optimization and Decision Making, 2006
- The Cross-Entropy Method for Network Reliability EstimationAnnals of Operations Research, 2005
- A Tutorial on the Cross-Entropy MethodAnnals of Operations Research, 2005
- The Transform Likelihood Ratio Method for Rare Event Simulation with Heavy TailsQueueing Systems, 2004
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networksEuropean Journal of Operational Research, 2003
- Fuzzy shortest path problemComputers & Industrial Engineering, 1994
- A note on two problems in connexion with graphsNumerische Mathematik, 1959