Volume 20, Issue 3 (International Journal of Industrial Eng. & Production Research Urban Planning 2009)                   2009, 20(3): 75-86 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Seyed-Hosseini S, Heydari R, Heydari T. Solving Urban Bus Terminal Location Problem Using Genetic Algorithm. Journal title 2009; 20 (3) :75-86
URL: http://ijiepm.iust.ac.ir/article-1-156-en.html
Solving Urban Bus Terminal Location Problem Using Genetic Algorithm
S.M. Seyed-Hosseini * , R. Heydari , T. Heydari
, seyedhoseini@yahoo.com
Abstract:   (45288 Views)
Bus network design is an important problem in public transportation. The main step to this design, is determining the number of required terminals and their locations. This is an especial type of facility location problem, a large scale combinatorial optimization problem that requires a long time to be solved. Branch & bound and simulated annealing methods have already been used for solving Urban Bus Terminal Location Problem(UBTLP) that first method requires much time and second method doesn’t reach desired solution. In this paper, a Genetic Algorithm is suggested for solving the problem. The main advantages of proposed algorithm are reaching better solution and taking less time. The demonstrated results have shown that proposed Genetic Algorithm can be an efficient and confident approach for solving UBTLP. For verification of proposed methodology, two illustrative practical examples are solved and obtained outcomes are reported.
Keywords: Bus Networks, Location Problem, Genetic Algorithm (GA), Mixed Integer Programming (MIP)
Full-Text [PDF 390 kb]   (6503 Downloads)    
Type of Study: Research | Subject: Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE
Received: 2010/02/20 | Published: 2009/12/15
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

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