The Urban Path Routing Adjustable Optimization by Means of Wavelet Transform and Multistage Genetic Algorithm

Publish Year: 1398
نوع سند: مقاله ژورنالی
زبان: English
View: 473

This Paper With 8 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

این Paper در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_JACM-5-4_011

تاریخ نمایه سازی: 19 تیر 1398

Abstract:

This paper introduces the optimization algorithm to improve search rate in urban path routing problems using viral infection and local search in urban environment. This algorithm operates based on two different approaches including wavelet transform and genetic algorithm. The variables proposed by driver such as degree of difficulty and difficulty traffic are of the essence in this technique. Wavelet transform as the first part of proposed algorithm derives edges risk. Finally, multistage genetic algorithm operates to find the optimal solution which is defined as the shortest path. The proposed algorithm is applied to the case study. The performances of the algorithm is investigated by comparing with other methods.

Authors

Seid Miad Zandavi

Department of Aerospace Engineering, Sharif University of Technology, ۱۴۵۸۸۸۹۶۹۴ Tehran, Iran

Hamoon Pourmirzaagha

Department of Mechanical Engineering, Ramsar Branch, Islamic Azad University, Ramsar, Iran

Alireza Yekrangi Sendi

Department of Mechanical Engineering, Ramsar Branch, Islamic Azad University, Ramsar, Iran

Ershad Sadeghi Toosi

Department of Physics, Neka Branch, Islamic Azad University, Neka, Iran

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • McQuillan, J., Richer, I., & Rosen, E., The new routing ...
  • Frank, H., Shortest paths in probabilistic graphs, Operations Research, 17(4), 1969, 583-599. ...
  • Beigy, H., & Meybodi, M. R., Utilizing distributed learning automata ...
  • Misra, S., & Oommen, B. J., Dynamic algorithms for the ...
  • Burton, D., On the inverse shortest path problem, Département de Mathématique, ...
  • Waller, S. T., & Ziliaskopoulos, A. K., On the online ...
  • Pritchard, D., & Thurimella, R., Fast computation of small cuts ...
  • T. time-volume function Studies, Tehran Comprehensive Transportation and Traffic Studies ...
  • Zitzler, E., Evolutionary algorithms for multiobjective optimization: Methods and applications, ed. ...
  • Satoh, H., Minimal generation gap model for GAs considering both ...
  • Pourtakdoust, S. H., & Zandavi, S. M., A hybrid simplex ...
  • Gouveia, L., Simonetti, L., & Uchoa, E., Modeling hop-constrained and ...
  • Hao, H., & Barooah, P., Stability and robustness of large ...
  • Alam, A., Fuel-efficient heavy-duty vehicle platooning, Doctoral dissertation, KTH Royal ...
  • Lenzen, C., & Patt-Shamir, B., Fast routing table construction using ...
  • نمایش کامل مراجع