.png){kind=icon}
.png){kind=icon}
Return
Solving urban transit route design problem using selection hyper-heuristics
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2018.10.022.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The urban transit routing problem (UTRP) focuses on finding efficient travelling routes for vehicles in a public transportation system. It is one of the most significant problems faced by transit planners and city authorities throughout the world. This problem belongs to the class of difficult combinatorial problems, whose optimal solution is hard to find with the complexity that arises from the large search space, and the number of constraints imposed in constructing the solution. Hyper-heuristics have emerged as general-purpose search techniques that explore the space of low level heuristics to improve a given solution under an iterative framework. In this work, we evaluate the performance of a set of selection hyper-heuristics on the route design problem of bus networks, with the goal of minimising the passengers' travel time, and the operator's costs. Each selection hyper-heuristic is empirically tested on a set of benchmark instances and statistically compared to the other selection hyper-heuristics to determine the best approach. A sequence-based selection method combined with the great deluge acceptance method achieved the best performance, succeeding in finding improved results in much faster run times over the current best known solutions. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Transportation
Optimisation
Routing
Meta-heuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W