The basic construction of the objective functions of the transit network design problem is described, and a new approach taking account of both passenger and operator interests is proposed. The approach presented combines the philosophy of the mathematical programming approaches with decision-making techniques in order to allow the user to select from a number of alternatives. The nature of the overall formulation is nonlinear and mixed-integer programming.
Get full access to this article
View all access options for this article.
References
1.
CederA., and WilsonN.. Bus Network Design. Transportation Research, Vol. 20B, No. 4, 1986, pp. 331–334.
2.
DialR. B., and BunyanR. E.. Public Transit Planning System. Socio-Economic Planning Science, Vol. 1, 1968, pp. 345–362.
3.
HeathingtonK. W., MillerJ., KnoxR. R., HoffG. C., and BruggmanJ.. Computer Simulation of a Demand Scheduled Bus System Offering Door-to-Door Service. In Highway Research Record 91, HRB, National Research Council, Washington, D.C., 1968, pp. 26–40.
4.
VandebonaU., and RichardsonA. J.. Simulation of Transit Route Operations. In Transportation Research Record 1036, TRB, National Research Council, Washington, D.C., 1985, pp. 36–40.
5.
KocurG., and HendricksonC.. Design of Local Bus Service with Demand Equilibration. Transportation Science, Vol. 16, No. 2, 1982, pp. 149–170.
6.
TsaoS., and SchonfeldP.. Branched Transit Services: An Analysis. Journal of Transportation Engineering, Vol. 110, No. 1, 1984, pp. 112–128.
7.
KuahG. K., and PerlJ.. Optimization of Feeder Bus Routes and Bus-Stop Spacing. Journal of Transportation Engineering, Vol. 114, No. 3, 1988, pp. 341–354.
8.
HasselstromD.Public Transportation Planning. Ph.D. dissertation. Department of Business Administration, University of Gothenburg, Sweden, 1981.
9.
DuboisD., BelG., and LibreM.. A Set of Methods in Transportation Network Synthesis and Analysis. Operations Research, Vol. 30, No. 9, 1979, pp. 797–808.
10.
SilmanL. A., BarzilyZ., and PassyU.. Planning the Route System for Urban Buses. Computers and Operations Research, Vol. 1, 1974, pp. 201–211.
11.
ReaT. C.Designing Urban Transit Systems: An Approach to the Route Technology Selection Problem. PB 204 881. University of Washington, Seattle, 1971.
12.
MandlC. E.Evaluation and Optimization of Urban Public Transportation Networks. European Journal of Operation Research, Vol. 5, 1979, pp. 396–404.
13.
MarwahB. R., UmrigarF. S., and PatnaikS. B.. Optimal Design of Bus Routes and Frequencies for Ahmedabad. In Transportation Research Record 994, TRB, National Research Council, Washington, D.C., 1984, pp. 41–47.
14.
SharpG. P.Public Transit System Network Models: Consideration of Guideway Construction, Passenger Travel, Delay Time and Vehicle Scheduling. Ph.D. dissertation. Georgia Institute of Technology, Atlanta, 1974.
15.
KeudelW.Computer-Aided Line Network Design (DIANA) and Minimization of Transfer Times in Networks (FABIAN). Proc., International Workshop on Computer-Aided Transit Scheduling (DadunaJ. R. and WrenA., eds.), International Lecture Notes in Economics and Mathematical Sciences, No. 308, Springer-Verlag, Berlin, 1988.
16.
CederA.Bus Frequency Determination Using Passenger Count Data. Transportation Research, Vol. 18A, No. 5–6, 1984, pp. 439–453.
17.
CederA.Methods for Creating Bus Timetables. Transportation Research, Vol. 21A, No. 1, 1986, pp. 59–83.
18.
CederA., and SternH.. Deficit Function Bus Scheduling with Dead-heading Trip Insertion for Fleet Size Reduction. Transportation Science, Vol. 14, No. 1, 1981, pp. 19–34.
19.
CederA., and SternH.. A Graphical Person-Machine Interactive Approach for Bus Scheduling. In Transportation Research Record 857, TRB, National Research Council, Washington, D.C., 1982, pp. 69–74.
20.
SternH., and CederA.. An Improved Lower Bound to the Minimum Fleet Size Problem. Transportation Science, Vol. 17, No. 4, 1983, pp. 471–483.
21.
CederA., and IsraeliY.. Scheduling Considerations in Designing Transit Routes at the Network Level. Proc., 5th International Workshop on Computer-Aided Transit Scheduling (DesrochersM. and RousseauJ. M., eds.), Lecture Notes in Economics and Mathematical Systems, No. 386, Springer-Verlag, Berlin, 1992, pp. 113–136.
22.
IsraeliY., and CederA.. Public Transportation Assignment with Passenger Strategies for Overlapping Route Choice. In Transportation and Traffic Theory(13th ISTTT) (LesortJ. B., ed.), Elsevier Science and Pergamon Publishing, 1996, pp. 561–588.
23.
MagnantiT. L., and WongR. L.. Network Design and Transportation Planning: Models and Algorithms. Transportation Science, Vol. 18, No. 1, 1984, pp. 1–55.
24.
CohonJ. L.Multiobjective Programming and Planning. Academic Press, New York, 1978.
25.
GiocoecheaA., HansenD. R., and DucksteinL.. Multiobjective Decision Analysis with Engineering and Business Applications. John Wiley & Sons, New York, 1982.
26.
IsraeliY., and CederA.. Transit Route Design Using Scheduling and Multi-Objective Programming Techniques. In Computer-Aided Transit Scheduling. Springer-Verlag, Berlin, 1995, pp. 56–75.
27.
IsraeliY., and CederA.. Multi-Objective Approach for Designing Transit Routes with Frequencies. In Advanced Methods in Transportation Analysis (BiancoL. and TothP., eds.), Springer-Verlag, Berlin, 1996, pp. 157–182.
28.
MiniekaE.Optimization Algorithms for Networks and Graphs. Marcel Dekker, New York, 1978, pp. 181–234.
29.
MarguierP. H. J., and CederA.. Passenger Waiting Strategies for Overlapping Bus Routes. Transportation Science, Vol. 18, No. 3, 1984, pp. 207–230.
30.
ZelenyM.Compromise Programming. In Multiple Criteria Decision Making (CochraneJ. L. and ZelenyM., eds.), University of South Carolina Press, Columbia, 1973.
31.
ZelenyM.A Concept of Compromise Solutions and the Method of the Displaced Ideal. Computers and Operation Research, Vol. 1, No. 4, 1974, pp. 479–496.
32.
DucksteinL., and OpricovicS.. Multiobjective Optimization in River Basin Development. Water Resources Research, Vol. 16, No. 1, 1980, pp. 14–20.
