Solving Bus Terminal Location Problem Using Genetic Algorithm
Küçük Resim Yok
Tarih
2006
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
World Acad Sci, Eng & Tech-Waset
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Bus networks 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. The genetic algorithm (GA) is a search and optimization technique which works based on evolutionary principle of natural chromosomes. Specifically, the evolution of chromosomes due to the action of crossover, mutation and natural selection of chromosomes based on Darwin's survival-of-the-fittest principle, are all artificially simulated to constitute a robust search and optimization procedure. In this paper, we first state the problem as a mixed integer programming (MIP) problem. Then we design a new crossover and mutation for bus terminal location problem (BTLP). We tested the different parameters of genetic algorithm (for a sample problem) and obtained the optimal parameters for solving BTLP with numerical try and error.
Açıklama
Conference of the World-Academy-of-Science-Engineering-and-Technology -- AUG 25-27, 2006 -- Prague, CZECH REPUBLIC
Anahtar Kelimeler
Bus Networks, Genetic Algorithm (GA), Location Problem, Mixed Integer Programming (MIP)
Kaynak
Proceedings Of World Academy Of Science, Engineering And Technology, Vol 14
WoS Q Değeri
N/A
Scopus Q Değeri
Cilt
14
