Route layout analysis for express buses

Transportation Research Part C: Emerging Technologies

Volumn 19, Issue 2, 2011, Pages 374-385

  Wirasinghe, S C ^a   Vandebona, U ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Bus transit; Cost minimization; Optimization; Route design

Indexed keywords

ANALYTICAL MODELS; CATCHMENTS; FLEET OPERATIONS; OPTIMIZATION; ROADS AND STREETS; TRAFFIC CONTROL; TRANSPORTATION ROUTES; TRAVEL TIME;

BUS TRANSITS; COST MINIMIZATION; GRID ROAD NETWORK; LAYOUT ANALYSIS; OPTIMUM SELECTION; ROUTE DESIGN; ROUTE SELECTION; SYMBIOTIC RELATIONSHIP;

BUSES;

ANALYTICAL METHOD; BUS TRANSPORT; OPTIMIZATION; ROUTING; TRANSPORTATION PLANNING; TRAVEL TIME;

EID: 78951469532     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2010.05.021     Document Type: Article

References (17)

1. Bruno G., Gendreau M., Laporte G. A heuristic for the location of a rapid transit line. Computers and Operations Research 2002, 29(1):1-12.
2. Chandrasekar P., Cheu R.L., Chin H.C. Simulation evaluation of route-based control of bus operations. Journal of Transportation Engineering 2002, 128(6):519-527.
3. Chien S., Yang Z., Hou E. Genetic algorithm approach for transit route planning and design. Journal of Transportation Engineering 2001, 127(3):200-207.
4. Dufourd H., Gendreau M., Laporte G. Locating a transit line using tabu search. Location Science 1996, 4(1):1-19.
5. Fan W., Machemehl R.B. Optimal transit route network design problem with variable transit demand: genetic algorithm approach. Journal of Transportation Engineering 2006, 132(2):40-51.
6. Gutin G., Yeob A., Zverovich A. Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Applied Mathematics 2002, 117:81-86.
7. Jorgensen R.M., Larsen J., Bergvinsdottir K.B. Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society 2007, 58:1321-1331.
8. Newell G.F. Dispatching policies for a transportation route. Transportation Science 1971, 5(1):91-105.
9. Newell G.F., Potts R.B. Maintaining a bus schedule. Proceedings of ARRB Conference 1964, 2(1):388-393.
10. Shrivastava P., O'Mahony M. A model for development of optimized feeder routes and coordinated schedules-a genetic algorithms approach. Transport Policy 2006, 13:413-425.
11. Ukkusuri S.V., Mathew T.V., Waller S.T. Robust transportation network design under demand uncertainty. Computer-Aided Civil and Infrastructure Engineering 2007, 22:6-18.
12. Van Oudheusden D.L., Ranjithan S., Singh K.N. The design of bus route systems - an interactive location allocation approach. Transportation 1987, 14:253-270.
13. Vogt L., Poojari C.A., Beasley J.E. A tabu search algorithm for the single vehicle routing allocation problem. Journal of the Operational Research Society 2007, 58(4):467-480.
14. Wirasinghe S.C. Re-examination of Newell's dispatching policy and extension to a bus route with many to many time varying demand. Proceedings of the 11th International Symposium on Transportation and Traffic Theory 1990, 363-378. Elsevier, New York. M. Koshi (Ed.).
15. Wirasinghe S.C., Ghoneim N. Location of bus-stops for many to many travel demand. Transportation Science 1981, 15(3):210-221.
16. Wirasinghe S.C., Liu G. Optimal schedule for a transit route with one intermediate time point. Transportation Planning and Technology 1995, 19:121-145.
17. Yang Z., Yu B., Cheng C. A parallel ant colony algorithm for bus network optimization. Computer-Aided Civil and Infrastructure Engineering 2007, 22:44-55.