Genetic Algorithm for Biobjective Urban Transit Routing Problem
This paper considers solving a biobjective urban transit routing problem with a genetic algorithm approach. The objectives are to minimize the passengers’ and operators’ costs where the quality of the route sets is evaluated by a set of parameters. The proposed algorithm employs an adding-node proce...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/698645 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562110794563584 |
|---|---|
| author | J. S. C. Chew L. S. Lee H. V. Seow |
| author_facet | J. S. C. Chew L. S. Lee H. V. Seow |
| author_sort | J. S. C. Chew |
| collection | DOAJ |
| description | This paper considers solving a biobjective urban transit routing problem with a genetic algorithm approach. The objectives are to minimize the passengers’ and operators’ costs where the quality of the route sets is evaluated by a set of parameters. The proposed algorithm employs an adding-node procedure which helps in converting an infeasible solution to a feasible solution. A simple yet effective route crossover operator is proposed by utilizing a set of feasibility criteria to reduce the possibility of producing an infeasible network. The computational results from Mandl’s benchmark problems are compared with other published results in the literature and the computational experiments show that the proposed algorithm performs better than the previous best published results in most cases. |
| format | Article |
| id | doaj-art-5a2bab8a8457433e84ffc649ccd412cf |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-5a2bab8a8457433e84ffc649ccd412cf2025-02-03T01:23:24ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/698645698645Genetic Algorithm for Biobjective Urban Transit Routing ProblemJ. S. C. Chew0L. S. Lee1H. V. Seow2Department of Mathematics, Faculty of Science, Universiti Putra Malaysia, (UPM), 43400 Serdang, Selangor, MalaysiaDepartment of Mathematics, Faculty of Science, Universiti Putra Malaysia, (UPM), 43400 Serdang, Selangor, MalaysiaNottingham University Business School, University of Nottingham Malaysia Campus, Jalan Broga, 43500 Semenyih, Selangor, MalaysiaThis paper considers solving a biobjective urban transit routing problem with a genetic algorithm approach. The objectives are to minimize the passengers’ and operators’ costs where the quality of the route sets is evaluated by a set of parameters. The proposed algorithm employs an adding-node procedure which helps in converting an infeasible solution to a feasible solution. A simple yet effective route crossover operator is proposed by utilizing a set of feasibility criteria to reduce the possibility of producing an infeasible network. The computational results from Mandl’s benchmark problems are compared with other published results in the literature and the computational experiments show that the proposed algorithm performs better than the previous best published results in most cases.http://dx.doi.org/10.1155/2013/698645 |
| spellingShingle | J. S. C. Chew L. S. Lee H. V. Seow Genetic Algorithm for Biobjective Urban Transit Routing Problem Journal of Applied Mathematics |
| title | Genetic Algorithm for Biobjective Urban Transit Routing Problem |
| title_full | Genetic Algorithm for Biobjective Urban Transit Routing Problem |
| title_fullStr | Genetic Algorithm for Biobjective Urban Transit Routing Problem |
| title_full_unstemmed | Genetic Algorithm for Biobjective Urban Transit Routing Problem |
| title_short | Genetic Algorithm for Biobjective Urban Transit Routing Problem |
| title_sort | genetic algorithm for biobjective urban transit routing problem |
| url | http://dx.doi.org/10.1155/2013/698645 |
| work_keys_str_mv | AT jscchew geneticalgorithmforbiobjectiveurbantransitroutingproblem AT lslee geneticalgorithmforbiobjectiveurbantransitroutingproblem AT hvseow geneticalgorithmforbiobjectiveurbantransitroutingproblem |