IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/2401333.html
   My bibliography  Save this article

Urban Rail Transit Network Planning Based on Particle Swarm Optimization Algorithm

Author

Listed:
  • Ning Yu
  • Ramin Ranjbarzadeh

Abstract

In order to solve the problem that the urban rail transit network is affected by a large number of signals, resulting in poor control effect, and improve the living comfort of residents near urban rail transit, a study on urban rail transit network planning based on particle swarm optimization algorithm is proposed. The learning factor is dynamically adjusted according to the inertia weight parameters, and the particle swarm optimization parameters are selected in combination with the setting of the maximum velocity parameters. The individual optimal particle is selected by using the dominant relationship between the individual particles, and the optimization of the optimal particle is completed by combining the selection requirements of the global optimal particle. We design the v2x communication implementation scheme, obtain the traffic flow information of urban rail transit, build the signal input and output model based on particle swarm optimization algorithm, obtain the output feedback signal, and determine the planning scale of urban rail transit network, so as to build the urban rail transit network planning model and complete the urban rail transit network planning. The experimental results show that the proposed method can improve the utilization rate of urban rail transit network planning, effectively control the change of network signal amplitude, and reduce the repetition rate of urban rail transit network planning.

Suggested Citation

  • Ning Yu & Ramin Ranjbarzadeh, 2022. "Urban Rail Transit Network Planning Based on Particle Swarm Optimization Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-9, August.
  • Handle: RePEc:hin:jnlmpe:2401333
    DOI: 10.1155/2022/2401333
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/2401333.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/2401333.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/2401333?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:2401333. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.