A Fast and Scalable Re-routing Algorithm based on Shortest Path and Genetic Algorithms J. Lee, J. Yang Jungkyu Lee

Jungkyu Lee, Jihoon Yang

Abstract


This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm, DGA, integrates Dijkstra’s shortest path algorithm with the genetic algorithm. Dijkstra’s algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. Then the genetic algorithm keeps finding the best routes with appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that DGA produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as Dijkstra’s algorithm in largescale routing problems.


Keywords


Evolutionary algorithm, routing in dynamic networks, car navigation system

Full Text:

PDF

References


EBU BPN. 027-1 Transport Protocol Experts Group (TPEG) Specifications.

EBU BPN. 027-2 Transport Protocol Experts Group (TPEG) Specifications.

EBU BPN. 027-3 Transport Protocol Experts Group (TPEG) Specifications.

EBU BPN. 027-4 Transport Protocol Experts Group (TPEG) Specifications.

EBU BPN. 027-5 Transport Protocol Experts Group (TPEG) Specifications.

EBU BPN. 027-6 Transport Protocol Experts Group (TPEG) Specifications.

E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269–271, 1959.
http://dx.doi.org/10.1007/BF01386390

M. Mitchell. An Introduction to Genetic Algorithms. MIT Press, 1996.

C.W. Ahn and R. S. Ramakrishna. A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Transactions on Evolutionary Computation, 6(6):566–579, 2002.
http://dx.doi.org/10.1109/TEVC.2002.804323

D. E. Goldberg. Genetic Algorithms in Search and Optimization. Addison-wesley, 1989.

Q. Zhang and Y. W. Leung. An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on Evolutionary Computation, 3(1):53–62, 1999.
http://dx.doi.org/10.1109/4235.752920

F. Xiang, L. Junzhou, W. Jieyi, and G. Guanqun. QoS routing based on genetic algorithm* 1. Computer Communications, 22(15-16):1392–1399, 1999.
http://dx.doi.org/10.1016/S0140-3664(99)00113-9

Y. Leung, G. Li, and Z. B. Xu. A genetic algorithm for the multiple destination routing problems. IEEE Transactions on Evolutionary Computation, 2(4):150–161, 1998.
http://dx.doi.org/10.1109/4235.738982

H. Kanoh. Dynamic route planning for car navigation systems using virus genetic algorithms. International Journal of Knowledge-based and Intelligent Engineering Systems, 11:65–78, 2007.

H. Kanoh and K. Hara. Hybrid genetic algorithm for dynamic multi-objective route planning with predicted traffic in a real-world road network. In Proceedings of the Conference on Genetic and Evolutionary Computation, pages 657–664. ACM, 2008.

B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming, 73(2):129–174, 1996.
http://dx.doi.org/10.1007/BF02592101

R. B. Dial. Algorithm 360: Shortest-path forest with topological ordering [H]. Communications of the ACM, 12(11):632–633, 1969.
http://dx.doi.org/10.1145/363269.363610

R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1):87–90, 1958.

R. S. Sutton and A. G. Barto. Reinforcement Learning. MIT Press, 1998.

R. Bellman. A Markovian decision process. Journal of Mathematics and Mechanics, 6, 1957.

L. P. Kaelbling, M. L. Littman, and A. W. Moore. Reinforcement learning: a survey. Journal of Artificial Intelligence Research, pages 237–285, 1996.

J. A. Boyan and M. L. Littman. Packet routing in dynamically changing networks: A reinforcement learning approach. Proceedings of the Advances in Neural Information Processing Systems, pages 671–671, 1994.

M. Stanojevi’c, M. Vujoˇsevi’c, and B. Stanojevi’c. Number of Efficient Points in some Multiobjective Combinatorial Optimization Problems. International Journal of Computers, Communications & Control, 3(Suppl.): 497-502, 2008.

I. Harbaoui Dridi, R. Kammarti, M. Ksouri, and P. Borne. Multi-Objective Optimization for the m-PDPTW: Aggregation MethodWith Use of Genetic Algorithm and Lower Bounds. International Journal of Computers, Communications & Control, 6(2): 246-257, 2011.




DOI: https://doi.org/10.15837/ijccc.2012.3.1389



Copyright (c) 2017 Jungkyu Lee, Jihoon Yang

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.