Bee colony optimisation of the travelling salesman problem in light rail systems
The travelling salesman problem in transit planning is an extremely complex and non-deterministic polynomial problem. Many optimisation algorithms have been tested but failed to facilitate passengers getting to multiple stations by way of a complex rail transit network. Although various algorithms b...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
ICE Publishing
2019
|
| Subjects: | |
| Online Access: | http://eprints.um.edu.my/23185/ https://doi.org/10.1680/jtran.16.00113 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!