Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.595
JCR 5-Year IF: 0.661
Issues per year: 4
Current issue: Nov 2017
Next issue: Feb 2018
Avg review time: 106 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

1,853,225 unique visits
522,151 downloads
Since November 1, 2009



No robots online now


SJR SCImago RANK

SCImago Journal & Country Rank


SEARCH ENGINES

aece.ro - Google Pagerank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 17 (2017)
 
     »   Issue 4 / 2017
 
     »   Issue 3 / 2017
 
     »   Issue 2 / 2017
 
     »   Issue 1 / 2017
 
 
 Volume 16 (2016)
 
     »   Issue 4 / 2016
 
     »   Issue 3 / 2016
 
     »   Issue 2 / 2016
 
     »   Issue 1 / 2016
 
 
 Volume 15 (2015)
 
     »   Issue 4 / 2015
 
     »   Issue 3 / 2015
 
     »   Issue 2 / 2015
 
     »   Issue 1 / 2015
 
 
 Volume 14 (2014)
 
     »   Issue 4 / 2014
 
     »   Issue 3 / 2014
 
     »   Issue 2 / 2014
 
     »   Issue 1 / 2014
 
 
  View all issues  


FEATURED ARTICLE

Wind Speed Prediction with Wavelet Time Series Based on Lorenz Disturbance, ZHANG, Y., WANG, P., CHENG, P., LEI, S.
Issue 3/2017

AbstractPlus






LATEST NEWS

2017-Jun-14
Thomson Reuters published the Journal Citations Report for 2016. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.595, and the JCR 5-Year Impact Factor is 0.661.

2017-Apr-04
We have the confirmation Advances in Electrical and Computer Engineering will be included in the EBSCO database.

2017-Jan-30
We have the confirmation Advances in Electrical and Computer Engineering will be included in the Gale database.

Read More »


    
 

  4/2010 - 13

Genetic Algorithm-based Dynamic Vehicle Route Search using Car-to-Car Communication

OH, B. See more information about OH, B. on SCOPUS See more information about OH, B. on IEEExplore See more information about OH, B. on Web of Science, NA, Y. See more information about  NA, Y. on SCOPUS See more information about  NA, Y. on SCOPUS See more information about NA, Y. on Web of Science, YANG, J. See more information about  YANG, J. on SCOPUS See more information about  YANG, J. on SCOPUS See more information about YANG, J. on Web of Science, PARK, S. See more information about  PARK, S. on SCOPUS See more information about  PARK, S. on SCOPUS See more information about PARK, S. on Web of Science, NANG, J. See more information about  NANG, J. on SCOPUS See more information about  NANG, J. on SCOPUS See more information about NANG, J. on Web of Science, KIM, J. See more information about KIM, J. on SCOPUS See more information about KIM, J. on SCOPUS See more information about KIM, J. on Web of Science
 
Click to see author's profile on See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (4,747 KB) | Citation | Downloads: 1,348 | Views: 2,802

Author keywords
adaptive system, genetic algorithm, traffic information system

References keywords
genetic(10), algorithm(6), routing(5), problem(4), learning(4), algorithms(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2010-11-30
Volume 10, Issue 4, Year 2010, On page(s): 81 - 86
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2010.04013
Web of Science Accession Number: 000284782700013
SCOPUS ID: 78649707649

Abstract
Quick view
Full text preview
Suggesting more efficient driving routes generate benefits not only for individuals by saving commute time, but also for society as a whole by reducing accident rates and social costs by lessening traffic congestion. In this paper, we suggest a new route search algorithm based on a genetic algorithm which is more easily installable into mutually communicating car navigation systems, and validate its usefulness through experiments reflecting real-world situations. The proposed algorithm is capable of searching alternative routes dynamically in unexpected events of system malfunctioning or traffic slow-downs due to accidents. Experimental results demonstrate that our algorithm searches the best route more efficiently and evolves with universal adaptability.


References | Cited By  «-- Click to see who has cited this paper

[1] Explanation of Transport Protocol Experts Group, Dec. 2, 2008, Available: Temporary on-line reference link removed - see the PDF document

[2] E. Moon, "The Introduction of Digital Multimedia Broadcasting in Korea," July 2006, Available: Temporary on-line reference link removed - see the PDF document

[3] D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Upper Saddle River, NJ: Addison-Wesley, 1989.

[4] C. W. Ahn, R. S. Ramakrishna, and C. G. Kang, "A New Genetic Algorithm for Shortest Path Routing Problem," IEEE Transactions on Evolutionary Computation, Vol. 6, No. 6, Dec. 2002.

[5] J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving. Upper Saddle River, NJ: Addison-Wesley, 1984.

[6] A. Nagurney and Q. Qiang, "Robustness of transportation networks subject to degradable links," A Letters Journal Exploring the Frontiers of Physics, 68001-p1-p6, 2007.

[7] I. H. Jung, D. H. Son, "Survey of Highway Business Effect," Korea Research Institute for Human Settlements, 1995.

[8] E. W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, Vol. 1, pp. 269-271, 1959.
[CrossRef] [SCOPUS Times Cited 10032]


[9] Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA, 1998.

[10] G. Harik, E. Cant¢u-Paz, D. E. Goldberg, and B. L. Miller, "The Gambler's ruin problem, genetic algorithms, and the sizing of populations," Evol. Comput., Vol. 7, No. 3, pp. 231-253, 1999.
[CrossRef] [PubMed] [Web of Science Times Cited 150] [SCOPUS Times Cited 172]


[11] M. Munetomo, Y. Takai, and Y. Sato, "A Migration Scheme for the Genetic Adaptive Routing Algorithm," IEEE International Conference on Systems, Man, and Cybernetics, pp. 2774-2779, 1998.
[CrossRef]


[12] J. Inagaki, M. Haseyama, and H. Kitajima, "A Genetic Algorithm for Determining Multiple Route and Its Applications," Proceedings of IEEE International Symposium on Circuits and Systems, pp. 137-140, 1999.
[CrossRef]


[13] Y. Leung, G. Li, and Z. B. Xu, "A genetic algorithm for the multiple destination routing problems," IEEE Trans. EVol. Comput., Vol. 2, pp. 150-161, Nov. 1998.
[CrossRef] [SCOPUS Times Cited 83]


[14] Z. Xiawei, C. Changjia, and Z. Gang, "A genetic algorithm for multicasting routing problem," in Proc. Int. Conf. Communication Technology (WCC-ICCT 2000), pp. 1248-1253, 2000.

[15] N. Shimamoto, A. Hiramatsu, and K. Yamasaki, "A dynamic routing control based on a genetic algorithm," in Proc. IEEE Int. Conf. Neural Networks, pp. 1123-1128, 1993.
[CrossRef] [SCOPUS Times Cited 51]


[16] D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley.

[17] X. Hue, "Genetic algorithms for optimization: Background and applications," Edinburgh Parallel Computing Centre, Univ. Edinburgh, Edinburgh, Scotland, Ver 1.0, Feb. 1997.

[18] Sebastian Zander, Thuy Nguyen, and Grenville Armitage, "Automated traffic classification and application identification using machine learning," in Proc. of IEEE Conf. on Local Computer Networks, pp. 250-257, 2005.
[CrossRef] [SCOPUS Times Cited 262]




References Weight

Web of Science® Citations for all references: 150 TCR
SCOPUS® Citations for all references: 10,600 TCR

Web of Science® Average Citations per reference: 8 ACR
SCOPUS® Average Citations per reference: 558 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2018-02-21 15:13 in 53 seconds.




Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2018
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania


All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.




Website loading speed and performance optimization powered by: