A GENETIC ALGORITHM APPROACH TO METRO DESIGN PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

AFANDIZADEH SH.; AHMADI NEJAD M.; HASHEMI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2011 | Volume:8 | Issue:1 (26) Page(s): 1-10

Download Full-Text

Persian Verion

View:

2,249

Download:

Cites:

Information Journal Paper

Title

A GENETIC ALGORITHM APPROACH TO METRO DESIGN PROBLEM

Author(s)

AFANDIZADEH SH. | AHMADI NEJAD M. | HASHEMI M. | Issue Writer Certificate

Keywords

METRO NETWORK DESIGNQ3

ALIGNMENTQ2

LOCATIONQ3

GENETIC ALGORITHMQ2

Abstract

Because the making and developing of metro system need a lot of investment like construction and maintenance cost, performance and effectiveness of metro design and its operational planning should be noticed. Also, metro cause directly and indirectly such effect like development of a city, mobility in economical centers, change in the pattern of trips, change land use and etc, we can lead these effect to desirable direction by correct and purposeful planning. Therefore, the optimum and correct design of metro system, specifically in network routing, is so important. For solving this problem in large network with standard and conventional methods, a lot of evaluations are needed. Usually, these methods require more time and cost, so, the necessity and tendency for heuristic method can show itself. Until now, many heuristic methods have presented for solving route generation and these problems, but most of them design one metro route and pay less attention for generating a network path and analyze them. Moreover, the parameters and constraints used in these methods are not sufficient and suitable. In this paper, we propose a heuristic method based on GENETIC ALGORITHM to solve METRO NETWORK DESIGN problem. At first, many routes are generated on the basis of proposed algorithm; and then, by GENETIC ALGORITHM and with synthesizing routes, several networks are created; and finally, a suitable network will be selected. This proposed method is evaluated in the form of case study and its results shows that this method can be adaptable for METRO NETWORK DESIGN in cities.

Cites

No record.

References

No record.

Cite

APA: Copy

AFANDIZADEH, SH., AHMADI NEJAD, M., & HASHEMI, M.. (2011). A GENETIC ALGORITHM APPROACH TO METRO DESIGN PROBLEM. JOURNAL OF TRANSPORTATION RESEARCH, 8(1 (26)), 1-10. SID. https://sid.ir/paper/83959/en

Vancouver: Copy

AFANDIZADEH SH., AHMADI NEJAD M., HASHEMI M.. A GENETIC ALGORITHM APPROACH TO METRO DESIGN PROBLEM. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2011;8(1 (26)):1-10. Available from: https://sid.ir/paper/83959/en

IEEE: Copy

SH. AFANDIZADEH, M. AHMADI NEJAD, and M. HASHEMI, “A GENETIC ALGORITHM APPROACH TO METRO DESIGN PROBLEM,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 8, no. 1 (26), pp. 1–10, 2011, [Online]. Available: https://sid.ir/paper/83959/en

Related Journal Papers