Metaheuristic methods for the urban transit routing problem
In our research, we focus on these three issues, and concentrate on developing a metaheuristic framework for solving the UTRP. Embedding simple heuristic algorithms (hill-climbing and simulated annealing) within this framework, we have beaten previously best published results for Mandi&...
| Main Author: | |
|---|---|
| Published: |
Cardiff University
2009
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.584517 |