A genetic algorithm for finding the k shortest paths in a network

@inproceedings{Hamed2010AGA,
  title={A genetic algorithm for finding the k shortest paths in a network},
  author={Ahmed Hamed},
  year={2010}
}
osting by E Abstract Most of the multimedia applications require the k shortest paths during the communication between a single source and multiple destinations. This problem is known as multimedia multicast routing and has been proved to be NP-complete. The paper proposes a genetic algorithm to determine the k shortest paths with bandwidth constraints from a single source node to multiple destinations nodes. The algorithm uses the connection matrix of a given network, and the bandwidth of the… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

A comparative study of k-shortest path algorithms. In: Proc. 11th UK performance engineering workshop for computer and telecommunications Systems

  • AW Brander, MC Sinclair
  • 1995

A comparative study of kshortest path algorithms

  • AW Brander, MC Sinclair
  • 1995

Finding the k shortest paths by AI search techniques

  • T. Shibuya
  • Cooperative Res Rep Model Algorithms
  • 1995

Using simulated annealing to solve the K-shortest path problem

  • A Consiglio, A. Pecorella
  • Proc. conf. Italian assoc. operations research;
  • 1995

Parallel algorithm for finding first K Shortest paths

  • N Kumar, RK Ghosh
  • Comput Sci Inform
  • 1994

Computing the K-shortest paths, under nonnegative weighting

  • AG Law, A. Rezazadeh
  • Proc. 22nd Manitoba Conf. Numerical Mathematics…
  • 1993

A binary enumeration tree to find K shortest paths

  • P Carraresi, C. Sodini
  • Proc. 7th Symp. operations research
  • 1983

Similar Papers

Loading similar papers…