Abstract | ||
---|---|---|
The demand-adaptive systems studied in this paper attempt to offer demand-responsive services within the framework of traditional scheduled bus transportation: Users call to request service between two given points and, in so doing, induce detours in the vehicle routes; at the same time, though, a given set of compulsory stops is always served according to a predefined schedule, regardless of the current set of active requests. The model developed to select requests and determine the routing of the vehicle yields a difficult formulation but with a special structure that may be used to develop efficient algorithms. In this paper, we develop, test, and compare several solution strategies for the single line-single vehicle problem that belong to two general meta-heuristic classes, memory-enhanced greedy randomized multistart constructive procedures, and tabu search methods. Hybrid meta-heuristics combining the two methods are also analyzed. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1287/ijoc.1030.0051 | INFORMS Journal on Computing |
Keywords | Field | DocType |
demand-adaptive system,vehicle yield,demand-responsive service,compulsory stop,active request,demand-responsive transit systems,current set,single line-single vehicle problem,vehicle route,difficult formulation,paper attempt,meta heuristics,grasp,tabu search,hybrids,public transport | Mathematical optimization,GRASP,Constructive,Public transport,Tabu search,Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
17 | 1 | 1091-9856 |
Citations | PageRank | References |
4 | 0.64 | 5 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Teodor Gabriel Crainic | 1 | 2329 | 137.89 |
Federico Malucelli | 2 | 371 | 46.99 |
Maddalena Nonato | 3 | 105 | 14.60 |
François Guertin | 4 | 505 | 37.63 |