Ant colony algorithm for rational transit network design of urban passenger transport
| Parent link: | Mechanical Engineering, Automation and Control Systems (MEACS): proceedings of the International Conference, Tomsk, 16-18 October, 2014/ National Research Tomsk Polytechnic University (TPU) ; Institute of Electrical and Electronics Engineers (IEEE). [5 p.].— , 2014 |
|---|---|
| Autor Corporativo: | |
| Outros autores: | , , , |
| Summary: | Title screen This study presents an optimization model for a transit network design of urban passenger transport. It aims to maximize the number of direct travelers per unit length, that is direct traveler density, subject to route length and nonlinear rate constraints (ratio of the length of a route to the shortest road distance between the origin and destination). Ant colony optimization algorithm is one of the possible meta-heuristic approaches, which are used to find an optimal route by using the graphs. The essence of this method is that its model derived from the study of the real ants behavior as the creation of the algorithm was inspired by these invertebrates. Data collected in Tomsk, Russia, are used to test the model and the algorithm. The results show that the optimized transit network has significantly reduced transfers and travel time. They also reveal that the proposed algorithm is effective and efficient compared to some existing meta-heuristic algorithm. Режим доступа: по договору с организацией-держателем ресурса |
| Idioma: | inglés |
| Publicado: |
2014
|
| Subjects: | |
| Acceso en liña: | http://dx.doi.org/10.1109/MEACS.2014.6986883 |
| Formato: | Electrónico Capítulo de libro |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=639007 |
| Summary: | Title screen This study presents an optimization model for a transit network design of urban passenger transport. It aims to maximize the number of direct travelers per unit length, that is direct traveler density, subject to route length and nonlinear rate constraints (ratio of the length of a route to the shortest road distance between the origin and destination). Ant colony optimization algorithm is one of the possible meta-heuristic approaches, which are used to find an optimal route by using the graphs. The essence of this method is that its model derived from the study of the real ants behavior as the creation of the algorithm was inspired by these invertebrates. Data collected in Tomsk, Russia, are used to test the model and the algorithm. The results show that the optimized transit network has significantly reduced transfers and travel time. They also reveal that the proposed algorithm is effective and efficient compared to some existing meta-heuristic algorithm. Режим доступа: по договору с организацией-держателем ресурса |
|---|---|
| DOI: | 10.1109/MEACS.2014.6986883 |