Free access
TECHNICAL PAPERS
Jul 15, 2009

Transit Route Network Design Problem: Review

Publication: Journal of Transportation Engineering
Volume 135, Issue 8

Abstract

Efficient design of public transportation networks has attracted much interest in the transport literature and practice, with many models and approaches for formulating the associated transit route network design problem (TRNDP) having been developed. The present paper systematically presents and reviews research on the TRNDP based on the three distinctive parts of the TRNDP setup: design objectives, operating environment parameters and solution approach.

Introduction

Public transportation is largely considered as a viable option for sustainable transportation in urban areas, offering advantages such as mobility enhancement, traffic congestion and air pollution reduction, and energy conservation while still preserving social equity considerations. Nevertheless, in the past decades, factors such as socioeconomic growth, the need for personalized mobility, the increase in private vehicle ownership and urban sprawl have led to a shift towards private vehicles and a decrease in public transportation’s share in daily commuting (Sinha 2003; TRB 2001; EMTA 2004; ECMT 2002; Pucher et al. 2007). Efforts for encouraging public transportation use focuses on improving provided services such as line capacity, service frequency, coverage, reliability, comfort and service quality which are among the most important parameters for an efficient public transportation system (Sinha 2003; Vuchic 2004).
In this context, planning and designing a cost and service efficient public transportation network is necessary for improving its competitiveness and market share. The problem that formally describes the design of such a public transportation network is referred to as the transit route network design problem (TRNDP); it focuses on the optimization of a number of objectives representing the efficiency of public transportation networks under operational and resource constraints such as the number and length of public transportation routes, allowable service frequencies, and number of available buses (Chakroborty 2003; Fan and Machemehl 2006a,b).
The practical importance of designing public transportation networks has attracted considerable interest in the research community which has developed a variety of approaches and models for the TRNDP including different levels of design detail and complexity as well as interesting algorithmic innovations. In this paper we offer a structured review of approaches for the TRNDP; researchers will obtain a basis for evaluating existing research and identifying future research paths for further improving TRNDP models. Moreover, practitioners will acquire a detailed presentation of both the process and potential tools for automating the design of public transportation networks, their characteristics, capabilities, and strengths.

Design of Public Transportation Networks

Network design is an important part of the public transportation operational planning process (Ceder 2001). It includes the design of route layouts and the determination of associated operational characteristics such as frequencies, rolling stock types, and so on. As noted by Ceder and Wilson (1986), network design elements are part of the overall operational planning process for public transportation networks; the process includes five steps: (1) design of routes; (2) setting frequencies; (3) developing timetables; (4) scheduling buses; and (5) scheduling drivers. Route layout design is guided by passenger flows: routes are established to provide direct or indirect connection between locations and areas that generate and attract demand for transit travel, such as residential and activity related centers (Levinson 1992). For example, passenger flows between a central business district (CBD) and suburbs dictate the design of radial routes while demand for trips between different neighborhoods may lead to the selection of a circular route connecting them. Anticipated service coverage, transfers, desirable route shapes, and available resources usually determine the structure of the route network. Route shapes are usually constrained by their length and directness (route directness implies that route shapes are as straight as possible between connected points), the usage of given roads, and the overlapping with other transit routes. The desirable outcome is a set of routes connecting locations within a service area, conforming to given design criteria. For each route, frequencies and bus types are the operational characteristics typically determined through design. Calculations are based on expected passenger volumes along routes that are estimated empirically or by applying transit assignment techniques, under frequency requirement constraints (minimum and maximum allowed frequencies guaranteeing safety and tolerable waiting times, respectively), desired load factors, fleet size, and availability. These steps as well as the overall design process have been largely based upon practical guidelines, the expert judgment of transit planners, and operators experience (Baaj and Mahmassani 1991). Two handbooks by Black (1995) and Vuchic (2004) outline frameworks to be followed by planners when designing a public transportation network that include: (1) establishing the objectives for the network; (2) defining the operational environment of the network (road structure, demand patterns, and characteristics); (3) developing; and (4) evaluating alternative public transportation networks.
Despite the extensive use of practical guidelines and experience for designing transit networks, researchers have argued that empirical rules may not be sufficient for designing an efficient transit network and improvements may lead to better quality and more efficient services. For example, Fan and Machemehl (2004) noted that researchers and practitioners have been realizing that systematic and integrated approaches are essential for designing economically and operationally efficient transit networks. A systematic design process implies clear and consistent steps and associated techniques for designing a public transportation network, which is the scope of the TRNDP.

TRNDP: Overview

Research has extensively examined the TRNDP since the late 1960s. In 1979, Newell discussed previous research on the optimal design of bus routes and Hasselström (1981) analyzed relevant studies and identified the major features of the TRNDP as demand characteristics, objective functions, constraints, passenger behavior, solution techniques, and computational time for solving the problem. An extensive review of existing work on transit network design was provided by Chua (1984) who reported five types of transit system planning: (1) manual; (2) market analysis; (3) systems analysis; (4) systems analysis with interactive graphics; and (5) mathematical optimization approach. Axhausemm and Smith (1984) analyzed existing heuristic algorithms for formulating the TRNDP in Europe, tested them, and discussed their potential implementation in the United States. Ceder and Wilson (1986) reported prior work on the TRNDP and distinguished studies into those that deal with idealized networks and to those that focus on actual routes, suggesting that the main features of the TRNDP include demand characteristics, objectives and constraints, and solution methods.
At the same period, Van Nes et al. (1988) grouped TRNDP models into six categories: (1) analytical models for relating parameters of the public transportation system; (2) models determining the links to be used for public transportation route construction; (3) models determining routes only; (4) models assigning frequencies to a set of routes; (5) two-stage models for constructing routes and then assigning frequencies; and (6) models for simultaneously determining routes and frequencies. Spacovic et al. (1994) and Spacovic and Schonfeld (1994) proposed a matrix organization and classified each study according to design parameters examined, objectives anticipated, network geometry, and demand characteristics. Ceder and Israeli (1997) suggested broad categorizations for TRNDP models into passenger flow simulation and mathematical programming models. Russo (1998) adopted the same categorization and noted that mathematical programming models guarantee optimal transit network design but sacrifice the level of detail in passenger representation and design parameters, while simulation models address passenger behavior but use heuristic procedures obtaining a TRNDP solution. Ceder (2001) enhanced his earlier categorization by classifying TRNDP models into simulation, ideal network, and mathematical programming models. Finally, in a recent series of studies, Fan and Machemehl (2004, 2006a,b) divided TRNDP approaches into practical approaches, analytical optimization models for idealized conditions, and metaheuristic procedures for practical problems.
The TRNDP is an optimization problem where objectives are defined, its constraints are determined, and a methodology is selected and validated for obtaining an optimal solution. The TRNDP is described by the objectives of the public transportation network service to be achieved, the operational characteristics and environment under which the network will operate, and the methodological approach for obtaining the optimal network design. Based on this description of the TRNDP, we propose a three-layer structure for organizing TRNDP approaches (Objectives, Parameters, and Methodology). Each layer includes one or more items that characterize each study.
The “Objectives” layer incorporates the goals set when designing a public transportation system such as the minimization of the costs of the system or the maximization of the quality of services provided. The “Parameters” layer describes the operating environment and includes both the design variables expected to be derived for the transit network (route layouts, frequencies) as well as environmental and operational parameters affecting and constraining that network (for example, allowable frequencies, desired load factors, fleet availability, demand characteristics and patterns, and so on). Finally, the “Methodology” layer covers the logical–mathematical framework and algorithmic tools necessary to formulate and solve the TRNDP. The proposed structure follows the basic concepts toward setting up a TRNDP: deciding upon the objectives, selecting the transit network items and characteristics to be designed, setting the necessary constraints for the operating environment, and formulating and solving the problem.

TRNDP: Objectives

Public transportation serves a very important social role while attempting to do this at the lowest possible operating cost. Objectives for designing daily operations of a public transportation system should encompass both angles. The literature suggests that most studies actually focus on both the service and economic efficiency when designing such a system. Practical goals for the TRNDP can be briefly summarized as follows (Fielding 1987; van Oudheudsen et al. 1987; Black 1995): (1) user benefit maximization; (2) operator cost minimization; (3) total welfare maximization; (4) capacity maximization; (5) energy conservation—protection of the environment; and (6) individual parameter optimization.
Mandl (1980) indicated that public transportation systems have different objectives to meet. He commented, “even a single objective problem is difficult to attack” (p. 401). Often, these objectives are controversial since cutbacks in operating costs may require reductions in the quality of services. Van Nes and Bovy (2000) pointed out that selected objectives influence the attractiveness and performance of a public transportation network. According to Ceder and Wilson (1986), minimization of generalized cost or time or maximization of consumer surplus were the most common objectives selected when developing transit network design models. Berechman (1993) agreed that maximization of total welfare is the most suitable objective for designing a public transportation system while Van Nes and Bovy (2000) argued that the minimization of total user and system costs seem the most suitable and less complicated objective (compared to total welfare), while profit maximization leads to nonattractive public transportation networks.
As can be seen in Table 1, most studies seek to optimize total welfare, which incorporates benefits to the user and to the system. User benefits may include travel, access and waiting cost minimization, minimization of transfers, and maximization of coverage, while benefits for the system are maximum utilization and quality of service, minimization of operating costs, maximization of profits, and minimization of the fleet size used. Most commonly, total welfare is represented by the minimization of user and system costs. Some studies address specific objectives from the user, the operator, or the environmental perspective. Passenger convenience, the number of transfers, profit and capacity maximization, travel time minimization, and fuel consumption minimization are such objectives. These studies either attempt to simplify the complex objective functions needed to setup the TRNDP (Newell 1979; Baaj and Mahmassani 1991; Chakroborty and Dwivedi 2002), or investigate specific aspects of the problem, such as objectives (Delle Site and Fillipi 2001), and the solution methodology (Zhao and Zeng 2006; Yu and Yang 2006).
Table 1. TRNDP Studies 1967–2007
YearAuthorsObjectivesParametersMethodology
Decision variablesNetwork structureDemand patternsDemand
1967HolroydTotal system costsRoute spacing, headwaysRectangular girdmany to manyFixedConventional (analytical)
1967Lampkin and SaalmansCapacity, travel timeRoutes, frequenciesNot specifiedmany to manyFixedHeuristic
1971Byrne and VuchicTotal welfare (total system and user cost)Route spacing, headwaysRectangular grid, parallel linesmany to oneFixedConventional (analytical)
1971ReaRoutes, frequenciesNot specifiedmany to manyFixedHeuristic
1972SalzbornFleet size, user waiting timeRoutes, frequenciesRectangular girdmany to oneTime dependentConventional (analytical)
1973HurdleTotal system and user costRoute spacings, headwaysRectangular girdmany to manyTime, space dependentConventional (analytical)
1974Silman et al.Passenger convenienceRoutes, headwaysNot specifiedmany to manyFixedHeuristic
1975ByrneTotal welfare (total system and user cost)Route lengths, route spacing, headwaysRadialmany to oneSpace dependentConventional (analytical)
1976ByrneTotal welfare (total system and user cost)Route lengths, route spacing, headwaysRectangular girdmany to oneSpace dependentConventional (analytical)
1979BlackTotal welfare (total community cost)Number of routes, number and spacing of stops, length of routes, headwaysRadialmany to oneSpace dependentConventional (analytical)
1979Dubois et al.Travel timeRoutes, frequenciesIrregular gridmany to manyService dependentHeuristic
1980MandlTransportation costRoutesIrregular gridmany to manyFixedHeuristic
1981Furth and WilsonNet social costHeadways, number of buses per routeNot specifiedmany to manyTime dependentConventional (NLP)
1981HasselstromConsumer surplusRoutes, frequenciesNot specifiedmany to manyService dependent Heuristic+linear programming
1982Kocur and HendricksonTotal welfare (operator profit and user benefit)Route spacing, headways, faresNot specifiedmany to oneService dependentConventional (analytical)
1984Morlok and VitonProfitProfitCapacity, frequencies, faresRadialmany to oneFixedConventional (analytical)
1983Tsao and SchonfeldTotal welfare (operator and user cost)Zones, headwaysRectangularmany to manyFixed/space dependentConventional (analytical)
1984Marwah et alTotal welfare (operator and user cost)Routes, frequenciesIrregular gridmany to manyFixed Heuristic+linear programming
1986VaughanTravel timeRoute spacings, headwaysRing and radial routesmany to manySpace dependentConventional (analytical)
1986Ceder and WilsonTotal welfare (operator and user cost)Routes, frequenciesNot specifiedmany to manyFixedHeuristic
1987Van Oudheusden et al.Total setup costRoutes, frequencies many to manyFixed/service dependentConventional (NLP)
1988LeblancTransit utilitization and costFrequenciesIrregular gridmany to manyService dependentConventional (NLP)
1988Van Nes et al.Number of passengersRoutes, frequenciesIrregular gridmany to manyElasticConventional (NLP)
1991Chang and SchonfeldTotal welfare (operator and user cost)Route spacings, headways, fares, costRectangularmany to oneElastic, time dependentConventional (analytical)
1991Baaj and MahmassaniTotal travel time, number of transfers, number of busesRoutes, frequencies many to manyFixed demandHybrid (AI)
1993Chang and SchonfeldTotal welfare (operator and user cost)Zone size, route length, route spacing, headwaysRectangularmany to oneTime dependentConventional (analytical)
1993Chang and SchonfeldTotal welfare (consumer surplus and system profit)Route spacings, headways, faresRectangularmany to manyTime, service dependentConventional (analytical)
1994Spacovic and SchonfeldTotal welfare (operator and user cost)Route lengths, route spacings, headways, stop locationsRectangularmany to oneFixed/space dependentConventional (analytical)
1994Spacovic et al.Total welfare (operator profit and social welfare)Route lengths, route spacings, headways, stop locationsRectangularmany to oneService dependentConventional (analytical)
1995Constantin and FlorianTotal expected travel and waiting timeFrequenciesnot specifiedmany to manyService dependentConventional (NLP)
1997Ceder and IsraeliLoad profile, fleet sizeRoutes, frequenciesnot specifiedmany to manyNot specifiedHeuristic
1997Chien and SchonfeldTotal welfare (total user and operator cost)Route and stop locations, headwaysRectangular gridmany to manySpace dependentConventional (analytical)
1997Shih et al.Total travel time, number of transfers, number of busesRoutes, frequencies, bus size, coordinationNot specifiedmany to manyFixedHeuristic
1998ImamProfitRoute spacing, headwaysRectangular gridmany to oneService dependentConventional (analytical)
1998Pattnaik et al.Total welfare (operator and user cost)Routes, frequenciesIrregular gridmany to manyFixedHeuristic
1998RussoSystem efficiencyFrequenciesNot specifiedmany to manyFixedConventional (NLP)
1998Bielli et al.Total welfare (operator and user cost)Routes, frequenciesNot specifiedmany to manyFixedHeuristic
1999Soehodo and NahryWaiting time, fleet sizeRoutes, frequenciesNot specifiedMany to manyFixedHeuristic and dynamic programming
2001Chien et al.Total welfare (user and operator cost)Routes, headwaysRectangular gridMany to oneSpace dependedHeuristic/metaheuristic (GA)
2001Delle site and Filippi fuel consumptionFuel consumptionService level, price, bus sizeNot specifiedmany to manyService dependentConventional (analytical)
2001Chien and SpacovicProfit, total welfare (operator and user cost)Headways, route spacing and faresIrregular gridmany to manySpace, service dependentConventional (analytical)
2002Biell et al.MultiobjectiveRoutes, frequenciesIrregular gridmany to manyFixedHeuristic/metaheuristic (GA)
2002Chakroborty and DwivediMultiobjectiveRoutesIrregular gridmany to manyFixedHeuristic/metaheuristic (GA)
2002Carresse and GorriTotal welfare (operator and user cost)Routes, frequenciesIrregular gridmany to manyFixedHeuristic
2003Van NesTotal welfare (operator and user cost)Stop spacing, route spacings, frequenciesNot specifiedmany to oneRelated to traveler groupConventional (analytical)
2003ChakrobortyMultiobjectiveRoutes, headways, stopping timesIrregular gridmany to manyFixedHeuristic/metaheuristic (GA)
2003Chien et al.Total welfare (operator and user cost)Route shapes, headwaysRectangular gridmany to oneService dependentTraditional heuristic
2003Tom and MohanTotal welfare (operator and user cost)Routes, frequenciesIrregular gridmany to manyFixedHeuristic/metaheuristic (GA)
2003Zhao and GanTransfersRoutesIrregular gridmany to manyFixedHeuristic/metaheuristic (SA, tabu Search)
2003Ngamchai and LovellTotal welfare (operator and user cost)Routes, frequenciesIrregular gridmany to manyFixedHeuristic/metaheuristic (GA)
2004Agrawai and MathewTotal welfare (operator and user cost)Routes, frequenciesNot specifiedmany to manyFixedHeuristic/metaheuristic (GA)
2004Cipriani et al.Total welfare (operator and user cost)Routes, frequencies, vehicle sizeNot specifiedmany to manyService dependentHeuristic/metaheuristic (GA)
2004PetrelliTotal welfare (operator and user cost)Routes, frequencies, vehicle sizeNot specifiedmany to manyFixedHeuristic/metaheuristic (GA)
2005Lee and VuchicTravel timeRoutes, frequenciesIrregular gridmany to manyService dependentHeuristic
2005Hu et al.Total welfare (operator and user cost)Routes, headwaysNot specifiedmany to manyFixedMetaheuristic (ACO/GA)
2005Zhao et al.Service coverage, minimization of transfersRoutes, frequenciesIrregular gridmany to manyFixedHeuristic/metaheuristic (SA/tabu search)
2006Fan and MachemehlTotal welfare (total operator and user cost, unsatisfied rideship cost)Routes, frequenciesIrregular gridmany to manyFixedHeuristic/metaheuristic (SA)
2006Fan and MachemehlTotal welfare (total operator and user cost, unsatisfied rideship cost)Routes, frequenciesIrregular gridmany to manyService dependentHeuristic/metaheuristic (SA)
2006Zhao and ZengCoverage, transfers, user costRoutes, frequenciesIrregular gridmany to manyFixedHeuristic/metaheuristic (GA+SA)
2006Yu and YangDirect traveler densityRoutes, stopsIrregular gridmany to manyFixedMetaheuristic (ACO)
2007Yu and ChengDirect traveler densityRoutes, stopsIrregular gridmany to manyFixedMetaheuristic (ACO)
2007Zhao and ZengTotal welfare (operator and user cost)Routes, frequenciesIrregular gridmany to manyFixedHeuristic/metaheuristic (SA)
Note: GA=genetic algorithm; SA=simulated annealing; and ACO=ant colony optimization.
Total welfare is, in a sense, a compromise between objectives. Moreover, as reported by some researchers such as Baaj and Mahmassani (1991), Bielli et al. (2002), Chackroborty and Dwivedi (2002), and Chakroborty (2003), transit network design is inherently a multiobjective problem. Multiobjective models for solving the TRNDP have been based on the calculation of indicators representing different objectives for the problem at hand, both from the user and operator perspectives, such as travel and waiting times (user), and capacity and operating costs (operator). In their multiobjective model for the TRNDP, Baaj and Majmassani (1991) relied on the planner’s judgment and experience for selecting the optimal public transportation network, based on a set of indicators. In contrast, Bielli et al. (2002) and Chakroborty and Dwivedi (2002), combined indicators into an overall, weighted sum value, which served as the criterion for determining the optimal transit network.

TRNDP: Parameters

There are multiple characteristics and design attributes to consider for a realistic representation of a public transportation network. These form the parameters for the TRNDP. Part of these parameters is the problem set of decision variables that define its layout and operational characteristics (frequencies, vehicle size, etc.). Another set of design parameters represent the operating environment (network structure, demand characters, and patterns), operational strategies and rules, and available resources for the public transportation network. These form the constraints needed to formulate the TRNDP and are, a-priori fixed, decided upon or assumed.

Decision Variables

Most common decision variables for the TRNDP are the routes and frequencies of the public transportation network (Table 1). Simplified early studies derived optimal route spacing between predetermined parallel or radial routes, along with optimal frequencies per route (Holroyd 1967; Byrne and Vuchic 1972; Byrne 1975, 1976; Kocur and Hendrickson 1982; Vaughan 1986), while later models dealt with the development of optimal route layouts and frequency determination. Other studies, additionally, considered fares (Kocur and Hendrickson 1982; Morlok and Viton 1984; Chang and Schonfeld 1991; Chien and Spacovic 2001), zones (Tsao and Schonfeld 1983; Chang and Schonfeld 1993a), stop locations (Black 1979; Spacovic and Schonfeld 1994; Spacovic et al. 1994; Van Nes 2003; Yu and Yang 2006) and bus types (Delle Site and Filippi 2001).

Network Structure

Some early studies focused on the design of systems in simplified radial (Byrne 1975; Black 1979; Vaughan 1986), or rectangular grid road networks (Hurdle 1973; Byrne and Vuchic 1972; Tsao and Schonfeld 1984). However, most approaches since the 1980s were either applied to realistic, irregular grid networks or the network structure was of no importance for the proposed model and therefore not specified at all.

Demand Patterns

Demand patterns describe the nature of the flows of passengers expected to be accommodated by the public transportation network and therefore dictate its structure. For example, transit trips from a number of origins (for example, stops in a neighborhood) to a single destination (such as a bus terminal in the CBD of a city) and vice-versa, are characterized as many-to-one (or one-to-many) transit demand patterns. These patterns are typically encountered in public transportation systems connecting CBDs with suburbs and imply a structure of radial or parallel routes ending at a single point; models for patterns of that type have been proposed by Byrne and Vuchic (1972), Salzborn (1972), Byrne (1975, 1976), Kocur and Hendrickson (1982), Morlok and Viton (1984), Chang and Schonfeld (1991, 1993a), Spacovic and Schonfeld (1994), Spacovic et al. (1994), Van Nes (2003), and Chien et al. (2003). On the other hand, many-to-many demand patterns correspond to flows between multiple origins and destinations within an urban area, suggesting that the public transportation network is expected to connect various points in an area.

Demand Characteristics

Demand can be characterized either as “fixed” (or “inelastic”) or “elastic”; the later meaning that demand is affected by the performance and services provided by the public transportation network. Lee and Vuchic (2005) distinguished between two types of elastic demand: (1) demand per mode affected by transportation services, with total demand for travel kept constant; and (2) total demand for travel varying as a result of the performance of the transportation system and its modes. Fan and Machemehl (2006b) noted that the complexity of the TRNDP has led researchers into assuming fixed demand, despite its inherent elastic nature. However, since the early 1980s, studies included aspects of elastic demand in modeling the TRNDP (Hasselstrom 1981; Kocur and Hendrickson 1982). Van Nes et al. (1988) applied a simultaneous distribution-modal split model based on transit deterrence for estimating demand for public transportation. In a series of studies, Chang and Schonfeld (1991, 1993a,b) and Spacovic et al. (1994) estimated demand as a direct function of travel times and fares with respect to their elasticities, while Chien and Spacovic (2001), followed the same approach assuming that demand is additionally affected by headways, route spacing and fares. Finally, studies by Leblanc (1988), Imam (1998), Cipriani et al. (2005), Lee and Vuchic (2005); and Fan and Machemehl (2006a) based demand estimation on mode choice models for estimating transit demand as a function of total demand for travel.
As reported by Hurdle (1973), demand varies with time and space, with temporal and location’ all dependencies considered in a number of papers. Chang and Schonfeld (1991, 1993a) developed models in which demand varied between different time periods. Other studies by Byrne (1975, 1976), Black (1979), Vaughan (1986), Spacovic and Schonfeld (1994), and Chien et al. (2001) analyzed location effects on demand when designing a public transportation service. Black (1979), for example, assumed exponentially declining demand on radial routes, when approaching to the CBD, while Chien et al. (2001, 2003) applied different demand densities among zones while keeping demand uniform within zones. Based on results of their analyses, Chien et al. (2003) reported that optimal transit design is sensitive to demand distribution over the service area.

Operational Strategies

Different operational strategies have been developed in an effort to improve capacity and bus systems performance. For example, Furth and Day (1985) evaluated restricted and semi-restricted zonal services, short-turns and limited-stop zonal services, and Ceder (1995) discussed on turnaround trips, interlining and deadheading. Modeling short-turn strategies is thoroughly discussed by Ceder (1989) and Delle Site and Filippi (1998) while an analysis of the deadheading problem is given by Eberlein et al. (1998). Skip-stop operations are analyzed in the Transit Capacity and Quality of Service Manual (TRB 2003), while other strategies such as rapid bus transit and route deviations have been also examined by researchers. Nevertheless, these strategies have been mostly examined at the bus line level. To our knowledge, incorporation of such strategies in the TRNDP has only been attempted by Soehodho and Nahry (1999). They introduced an approach that included turn-around-trips, interlining and deadheading in designing a transit network.

Constraints

Fan and Machemehl (2006a,b) noted that constraints for the TRNDP reflect performance of the public transportation network along with limitations in resources. Types of constraints were summarized by Zhao and Zeng (2006): including the range of feasible frequencies, minimum and maximum load factors, the shape, directness, maximum length, and number of routes, while the major resource limitation is the size of the bus fleet and operational budget.

TRNDP: Methodological Approaches

As reported by previous research, the TRNDP is a complex, difficult to solve optimization problem, where traditional mathematical programming formulations and solution techniques cannot be efficiently applied (Baaj and Mahmassani 1991; Chakroborty and Dwivedi 2002). Newell (1979) discerned the complexity of the problem, by noting that “the selection of an optimal route structure for a (transit) network of realistic size is a combinatorial problem of astronomical proportions.” Additionally, he mentioned that, while the selection of optimal frequencies in an existing network is, in general, a convex optimization problem, “. . . the choice of routes is generally a nonconvex (even concave) optimization problem for which no simple procedure exists short of direct comparison of various local minima” (p. 21). Baaj and Mahmassani (1991) indicated sources of complexity for the TRNDP: its combinatorial and multiobjective nature, the difficulties in formulating the problem and formally defining acceptable spatial route layouts, and the nonlinearities and nonconvexities characterizing the problem. Chackroborty (2003) suggested that formulating the TRNDP as a mathematical problem is difficult since the problem is inherently discrete and concepts such as “transfers” and “route continuity” are hard to represent.
Existing research exhibits a diversity of approaches in formulating and solving the TRNDP. In general, such methodologies are classified into two broad categories: analytical and heuristic (Baaj and Mahmassani 1991; Chakroborty and Dwivedi 2002). However, this study classifies methodologies found in the literature, in a disaggregated structure. (Fig. 1). We define two major categories: conventional and heuristic approaches; and relevant subclassifications.
Fig. 1. Classification of methodologies for the TRNDP

Conventional Methods

Conventional methods include primarily analytical models and in a lesser extend mathematical programming formulations. Analytical models focus on developing relationships between components of the public transportation network that are usually applied to small size networks with a simple or idealized structure (Ceder and Wilson 1986; van Nes et al. 1988; Chakroborty 2003). Early cases of analytical models have been presented by Holroyd (1967), Hurdle (1973), Byrne (1975, 1976), Kocur and Hendrickson (1982), while an extensive analysis of TRNDP using such methods is provided studies by Tsao and Schonfeld (1984), Chang and Schonfeld (1991, 1993a,b), Spacovic and Schonfeld (1994), Spacovic et al. (1994), Chien and Schonfeld (1997) and Chien and Spacovic (2001). Nevertheless, the disadvantages of analytical models have been indicated by researchers; Ceder (2001) noted that analytical models are suited for analyzing policies, where approximate values of design parameters are needed, and not a complete design while Tom and Mohan (2003) pointed out that such models are of theoretical interest only.
Van Nes et al. (1988) and Baaj and Mahmassani (1999) presented mathematical programming formulations for the TRNDP. Nonlinear programming models were developed by Constantine and Florian (1995), Russo (1998), and Delle Site and Fillipi (2001), but these models did not consider routes as decision variables. An alternative mathematical programming approach was proposed by Van Oudheudsen et al. (1987), where the writers formulated route selection as the set covering and the simple plant location problems. However, it has to be noted that, in most cases, heuristics were used to solve the mathematical programming models. Chakroborty (2003) highlighted the handicaps of such formulations, that they cannot adequately represent the problem in a realistic extent a result of the need for discrete decision variables, nonlinearities, and the existence of logical conditions. Moreover, he noted that most of the existing methods for tackling the TRNDP are heuristic.

Heuristics

Heuristic approaches are the alternative to analytical models. They exploit heuristic algorithms, in an effort to improve the TRNDP representation and results, while reducing the need for computational power. Most of these models consist of procedures for candidate route generation and route configuration, occasionally supported by preprocess and demand process algorithms (these will be analyzed in a subsequent paragraph). A set of candidate routes is generated according to some criteria and then optimal subsets of routes are selected with/without their associated frequencies determined, using some optimization algorithm. Typical setups of heuristic approaches incorporate a heuristic for generating candidate routes and another heuristic or metaheuristics algorithm for determining the optimal route configuration. However, there are some alternative approaches which develop initial routes and consequently improve them (Mandl 1980) or apply metaheuristics for direct construction of optimal routes (Bielli et al. 2002; Yang et al. 2007). Fig. 2 illustrates a typical heuristic flow chart for the TRNDP and Table 2 summarizes procedures followed by different heuristic model.
Fig. 2. Typical heuristic flowchart for the TRNDP
Table 2. TRNDP Heuristic and Metaheuristics Models
PaperRoutegenerationRouteconfigurationRouteconstructionRouteimprovementAlgorithms
Lampkin and Saalmans (1967)  Traditional heuristic
Silman et al. (1974)  Traditional heuristic (local search)
Dubois et al. (1979)  Traditional heuristic (local search)
Hasselstrom (1981)  Traditional heuristic/LP
Mandl (1980)   Traditional heuristic
Marwah et al. (1984)  Traditional heuristic
Ceder and Wilson (1986)  Traditional heuristic
Baaj and Mahmassani (1991)  Metaheuristic
Ceder and Israeli (1997)  Traditional heuristic
Pattnaik et al. (1998)  Traditional heuristic/metaheuristic (GA)
Bielli et al. (2002)  Traditional heuristic/metaheuristic (GA)
Carrese and Gori (2002)  Traditional heuristic
Chakroborty and Dwivedi (2002)  Traditional heuristic/metaheuristic (GA)
Chakroborty (2003)  Traditional heuristic/metaheuristic (GA)
Tom and Mohan (2003)  Traditional heuristic/metaheuristic (GA)
Ngamchai and Lovell (2003) Traditional heuristic/metaheuristic (GA)
Agrawai and Mathew (2004)  Traditional heuristic/metaheuristic (GA)
Petrelli (2004) Traditional heuristic/metaheuristic (GA)
Cipriani et al. (2005)  Traditional heuristic/metaheuristic (GA)
Lee and Vuchic (2005)  Traditional heuristic
Zhao et al. (2005)  Metaheuristic (SA/TS)
Fan and Machemehl (2006a)  Traditional heuristic/metaheuristic (GA)
Fan and Machemehl (2006b)  Traditional heuristic/metaheuristic (SA)
Zao and Zeng (2006)  Traditional heuristic/metaheuristic (SA+GA)
Yu and Yang (2006)  Metaheuristic (ACO/GA)
Hu et al. (2005)  Metaheuristic (ACO)
Yang et al. (2007)  Metaheuristic (ACO)
Zhao and Zeng (2007)  Metaheuristic (SA/TS/Greedy)
Note: GA=genetic algorithm; SA=simulated annealing; ACO=Ant colony optimization; and TS=tabu search.
According to the 1st case shown in Fig. 2, candidate routes are generated and then an optimization algorithm is used for selecting the most appropriate among them (route configuration). Throughout the optimization process, demand is assigned to candidate sets of routes in order to determine operational characteristics and evaluate the routes’ performance. The 2nd case involves the direct construction and, if necessary, improvement of the optimal set of routes.

Route Generation

Route generation approaches are heuristic. They are typically shortest-path-based algorithms, generating routes under some constraints, either by adding nodes or links of a road network. These constraints may include the number of routes, the route length, travel time, and so on. Among early studies, Silman et al. (1974) constructed candidate routes that satisfied length constraints, by adding links. Dubois et al. (1977) followed a node-addition approach, attempting to generate rather straight routes with adequate passenger loads. Their methods, as well as those by Hasselstrom (1981) and Marwah et al. (1984), constrained route lengths with respect to their shortest paths. Moreover, Hasselstrom’s method generated all feasible routes for the transit system based on practical criteria. Recent approaches such as those by Ceder and Israeli (1997), Pattnaik et al. (1998), Tom and Mohan (2003), Agrawi and Mathew (2004), Lee and Vuchic (2005), and Fan and Machemehl (2006a,b) used shortest path algorithms for developing candidate routes. For instance, Fan and Machemehl (2006a,b) combined Dijkstra’s shortest path algorithm and Yen’s k-shortest path algorithm for this purpose. Finally, Ngamchai and Lovell (2003) applied a heuristic procedure based on the selection of neighboring nodes of the transit network.
Ceder and Wilson (1986) and Baaj and Mahmassani (1991, 1995) developed demand guided algorithms for generating transit routes. The former only considered travel time as a constraint and constructed routes in such a way that demand differences between those routes and shortest paths were minimized. Baaj and Mahmassani (1991), on the other hand, followed an approach of generating shortest paths, expanding them into routes through specific strategies and filtering final routes with respect to their number, demand satisfied and number of transfers. Finally, in a more recent study, Chakroborty and Dwivedi (2002) used a demand driven node-addition approach. They estimated the level of activity for each network node (incoming and outgoing passengers) and guided the construction of routes accordingly. As constraints they used the network structure (connectivity of nodes), route length and number of nodes per route.

Route Configuration

Route configuration includes selection and improvement of optimal routes along with frequency determination. Route configuration procedures are iterative processes guided by a search algorithm and supported by external modules for demand assignment, route analysis, and evaluation. Search algorithms vary from local search algorithms to metaheuristics. However, some studies have used linear programming formulations for route selection and frequency determination. Therefore, reviewed methods for route configuration can be characterized with respect to the algorithm implemented (mathematical programming, traditional heuristic, or metaheuristic) and whether routes and frequencies are determined sequentially and/or simultaneously.
Traditional heuristics involve iterative procedures and local search methods or mathematical programming models for determining final routes and frequencies. Models by Lampkin and Saalmans (1967), Silman et al. (1974), and Dubois et al. (1977) sequentially selected (and improved) routes and derived frequencies, based on iterative methods combined with local search algorithms. Hasselstrom (1981) and Marwah et al. (1984) used linear programming models for simultaneously obtaining routes and frequencies. In a later study, Ceder and Wilson (1986) proposed a bilevel model for route configuration. In the first level, which focused on the user perspective only, an optimization model was used to select optimal routes. While in the second level, a heuristic, sequential method was applied to consider both user and operator perspectives for route and frequency determination. Lee and Vuchic (2005) presented an iterative approach for sequentially determining routes and frequencies for a transit network. The method incorporated an algorithm for reassigning demand in each iteration, enabling it to handle variability in transit demand. In an alternative model, Soehodo and Nahry (1998) presented an alternative bilevel optimization model for configuring transit networks. They applied both dynamic programming and a maximal cardinality matching method that optimized scheduling by using dynamic programming and fleet requirements.
Since 1991, Baaj and Mahmassani discussed shortcomings of existing methods for solving the TRNDP such as the multiobjective nature of the problem and the difficulty in exploiting empirical knowledge and practical guidelines. They indicated that proper incorporation of practice in artificial intelligence (AI) search methods would result in a better design of public transportation routes. They proposed an AI-based method whose route configuration procedure included a module for analyzing route characteristics and a route improvement algorithm. However, their method did not mention any specific AI search algorithm but just the programming language (LISP) used, which as stated by the writers, incorporated such algorithms.
Among metaheuristics, genetic algorithms (GAs) have received significant attention for the route configuration part of the TRNDP. This is a result of advantages such as efficient handling of external procedures and discrete variables during the optimization process, capability of incorporating case-specific information and expertise both at the beginning and during optimization, and inherent management of boundary conditions for decision variables (Chakroborty 2003). GAs were used for the optimal selection of routes and determination of frequencies in at least ten studies: Pattnaik et al. (1998), Chakroborty and Dwivedi (2002), Bielli et al. (2002), Chakroborty (2003), Tom and Mohan (2003), Ngamchai and Lovell (2003), Agrawi and Mathew (2004), Petrelli (2004), Cipriani et al. (2005), and Fan and Machemehl (2006a). Most of these studies implemented simple GA structures. Only Agrawi and Matthew (2004) used an advanced parallel GA for improved performance. Differences between most approaches focused on the representation scheme of candidate solutions, Pattnaik et al. (1998), Tom and Mohan (2003), and Agrawi and Mathew (2004) represented routes and frequencies as binary strings, Bielli et al. (2002) assigned fixed positions for each route in a string, with a flag and an associated frequency characterizing each route, Chakroborty and Dwivedi (2002), and Chakroborty (2003) represented routes by their nodes, and Fan and Machemehl (2006a) used a float representation of route indexes. Of specific interest though is the model by Ngamchai and Lovel (2003) who developed a GA that incorporated operators that were used for configuring the route network and improving it at the same time.
GA performance for the TRNRP has been discussed by some researchers. For instance, Chackroborty and Dwivedi (2002) noted that according to their analyses, GAs were found to be superior to existing heuristics in the TRNDP, while Chackroborty (2003) indicated the “efficacy” of these algorithms. Tom and Mohan (2003) came up with similar findings. Petrelli (2004) reported that GAs “proved to be robust and efficient and have produced reasonable network configurations.”
Zhao and Gan (2003) and Zhao et al. (2005) used a combination of simulated annealing and tabu search for obtaining optimal route layouts. Simulated annealing was also proposed by Fan and Machemehl (2006b) as an alternative to using GAs. By comparing both metaheuristics, they concluded that simulated annealing outperformed the GA in terms of the quality of route configuration(s) derived. Another model by Zhao and Zeng (2006) combined simulated annealing and genetic algorithms, the simulated annealing algorithm sequentially searched for optimal transit routes and then headways, while the GA intervened to improve search. Their results also indicated that simulated annealing provided better results compared to the GA alone. Additionally, Zhao and Zeng (2007) used an integrated simulated annealing and tabu search optimization algorithm (instead of GAs) and reported that they obtained good results for a large transit networks in a reasonable amount of time.

Route Construction and Improvement

An alternative to generating and configuring routes is the direct construction and, if necessary, improvement of transit routes and frequencies. For instance, Mandl’s (1980) method improved a feasible set of transit routes guided by their associated transportation cost. Carrese and Gori (2002) based their approach in flow concentration using a heuristic procedure for concentrating flows among main road network paths, and then constructed routes and assigned frequencies guided by these flows and route constraints. They also improved routes by processes transfer reduction and route expansion. Apart from simple heuristic procedures, such as the above-mentioned, a modern metheuristic, ant colony optimization (ACO) was implemented in constructing optimal transit routes, since they are, by their nature, suitable for constructing optimal paths [for a review of ACO, the reader is referred to Dorigo and Stützle (2004)]. ACO for the TRNDP was first proposed by Hu et al. (2005) along with a genetic algorithm, the ACO algorithm simulated the process of finding optimal routes commencing from a terminal to an ant’s process of searching food sources from the nest. Another ACO-based study by Yu and Yang (2006) for simultaneously constructing optimal bus lines and stops. Finally, Yang et al. (2007) proposed an advanced ACO algorithm for the TRNDP. The main idea of their algorithm was to obtain optimal pairs of origins and destinations for the network and form bus routes.

Demand Assignment

Assignment of passengers to routes is among the critical issues for designing a transit network, since frequencies as well as, the number of vehicles rely upon the assignment of passenger flows along routes. As Speiss and Florian (1989) and Desaulnier and Hickman (2003) indicated, transit assignment has been extensively examined as a separate problem, or as part of more complex problems, such as the TRNDP. A recent review on transit assignment aspects can be found in Desaulnier and Hickman (2003). In this analysis, we only intend to discuss assignment components in the various TRNDP approaches reviewed. Multipath assignment has been considered in most heuristic studies. Passenger trips are distributed in alternative routes according to user acceptability (Lampkin and Saalmans 1967). For example, assigned trips to routes, based on a “frequency share rule,” demand is distributed according to the probability that a bus from each route arrives earlier that those of competing routes. Hasselstrom (1981) assigned trips based on the model proposed by Andreasson (1977). A route is desirable if its ride time is less or equal to the sum of waiting time plus the travel time of a minimum time route. Marwah et al. (1984) used a linear programming model to concentrate flows in paths so that travel time along with operator cost is minimized. Both Baaj and Mahmassani (1991) and Fan and Machemehl (2004, 2006a,b) adopted a lexicographic strategy for trip assignment originally proposed by Han and Wilson (1983). The former considered the number of transfers as a principal criterion for trip assignment along with travel and waiting time, while Fan and Machemehl (2006a,b) distributed trips with respect to the number of transfers and long walks while taking into account travel times in cases of ties. Among other studies, Carrese and Gori (2002) used a flow-speed relationship for an all-or-nothing iterative assignment method aiming at concentrating flows in a few links, while Petrelli (2004) used the hyperpath technique for distributing demand for transit along routes.

Discussion

Modeling of transit network design has received considerable attention by researchers for the last four decades; efforts focused on the design of public transportation networks with superior performance to those planned and designed by ad-hoc practices and rules thumb. Different approaches explored the TRNDP demonstrating a variety of methodologies for representing and solving the problem. This study disaggregated the TRNDP into three layers in an effort to reveal key characteristics in modeling the problem: the “objectives” layer, the “parameters” layer, and the “methodology” layer (key-characteristics are summarized in Fig. 3).
Fig. 3. Key characteristics of TRNDP models
The “objectives” and “parameters” layers compose the problem’s design space. Both levels are characterized by a variety of elements, an indication of TRNDP complexity. The design of a public transportation network is driven by different (often contradicting) objectives and affected by a multiattribute design environment. Among objectives, social welfare is reported as the most common: It is typically interpreted as the minimization of the sum of operator and user costs. However, as Baaj and Mahmassani (1991) pointed out, the TRNDP is inherently multiobjective. For this reason, some studies examined multiple objectives, allowing planners to select the best combination of different objectives.
Most common decision variables encountered were routes and frequencies (or equivalently headways). Other decision variables include zone sizes, stop locations, vehicle size, and fare level. Fare setting is, however, frequently a part of the overall transport operator’s strategy and influenced by external socioeconomic factors. Moreover, modern transit systems offer a variety of fare products that are difficult to represent in a single fare “level.”
Decisions between many-to-many and many-to-one patterns is directly related to the urban structure and spatial distribution of human activities: In cases of public transportation networks oriented toward serving commuting trips to and from a city’s CBD, it is expected that a simplified many-to-one pattern may be adequate. Many-to-many patterns are suitable in cases of systems planned to serve cities with multiple activity centers and/or passengers with various trip purposes in urban areas. As for demand characteristics, time and space dependencies have been explicitly examined in some studies. The effects of service characteristics on demand and vice versa have been of particular interest among researchers. Most approaches incorporated mode choice models to capture the share of public transportation for different service configurations. Although as discussed, the overall effects of the public transportation network service on total demand (which may be considerable in networks with many captive passengers) were not incorporated in the models investigated.
Constraints and operational strategies reflect the operator’s policy and resources of the operator. Desired performance and safety aspects are regulated by constraints such as allowable frequencies and load factors along with route shapes and lengths, while the number and size of vehicles and the operating cost are factors indicating resource availability.
Methodologies applied in solving the TRNDP form the problem’s modeling approach; this is the part that has attracted most research efforts. The variety of techniques and tools selected in the different studies is influenced by:
1.
The selected level of detail in the design environment;
2.
The quality of the anticipated solution; and
3.
Available computational power.
Some conventional models assume idealized situations and require minimal computational effort. However, their results can only serve as indications for planners, particularly for evaluating the performance of existing bus lines. Mathematical programming models could assure optimal solutions under specific constraints; nevertheless, their complexity and difficulty in adequately representing a public transportation network, along with their extensive computational requirements, are major drawbacks.
Early heuristics attempted to improve the level of detail captured under the constraint of the limited, at the time, computational power available. These models were mainly criticized for their inability to handle large networks, the fact that they actually produce approximate, adequate, but not always optimal (or near-optimal) solutions, and for limitations in their technical features, such as the level of representation achieved. Nevertheless, they provided the basis for later methodologies, many of which are based on met heuristic algorithms. Models based solely, or in part, on met heuristics usually retain the philosophy of earlier heuristics. Their structure includes a route generation and a route selection-configuration procedure while metaheuristics are implemented in an effort to obtain network configurations of superior quality. However, in most cases, routes are generated using heuristic techniques.
With or without the use of met heuristics, partitioning the TRNDP in a sequence of procedures is attractive in that these procedures become manageable and the TRNDP easier to process. Two major approaches were identified: (1) route generation and configuration; and (2) route construction and improvement. Route generation in almost all cases is an independent, preprocessing procedure, while route configuration is either sequential (routes are selected and then frequencies are assigned to them), or simultaneous (routes and associated frequencies are determined at the same time). However, researchers in the fields of operations research and optimization argue that sequential methods often provide inferior results compared to methods that simultaneously optimize all aspects of a system [for instance in the case of location—routing optimization problems, as noted by Nagy and Salhi (2007)]. For the TRNDP, this would mean construction of routes and determination of frequencies at the same time. Despite this, the real essence of the problem cannot be neglected. In practice, differences between results obtained through a sequential and a simultaneous approach would probably be of minor importance compared to uncertainties incorporated in the assumptions made with formulating the problem, example are travel speeds, traffic conditions in the route network, and so on. Therefore, from a planning perspective, the existing approaches seem adequate. But to our knowledge, this is a topic yet to be thoroughly investigated. Direct construction and route improvement has been examined to a lesser extent in the literature. However, modern metaheuristics such as ACO seem to be promising in this direction.
Given the above, a general framework can be derived for the TRNDP (Fig. 4). The framework includes two levels. The first level incorporates the design environment (design level), and the second handles the modeling characteristics of the problem. Framework details encompass all aforementioned elements and aspects of the TRNDP, objectives for prevailing conditions and corresponding design parameters should be selected, and an appropriate formulation—solution method consisting of network element generation and configuration supported by an optimization algorithm is implemented.
Fig. 4. General framework for the TRNDP

Conclusions and Paths for Future Research

The objective of this paper was to systematically review and highlight elements of past research dealing with the transit route network design problem (TRNDP). The review revealed over sixty studies published in the last four decades that have addressed the TRNDP, each of them adopting different approaches and assumptions. Elements of these studies were categorized in a three-layer/multi-item structure and a generic framework for developing methodologies for the TRNDP was suggested. As discussed in the review, the complexity of the problem in conjunction with the anticipated level of detail and algorithmic performance has led to different approaches starting from plain analytical models to advanced metaheuristics.
Despite the large number of existing studies, the TRNDP is a field with strong potential for future research. A first direction could be the nature of the problem. Until now all studies have focused on planning daily operations. It would be interesting to systematically investigate models for different environments such as mega-events or emergencies, whose objectives, design characteristics, and solution procedures could vary significantly. Objectives are environment dependent, they are chosen for a public transportation network expected to provide services in day-to-day operations. In the cases of mega-events or emergencies, the above-mentioned objectives may not be suitable. For instance, travel time and capacity were deemed as objectives for planning some public transportation networks of that type, while operator cost was neglected (Bovy 2002; Dimitriou et al. 2006).
Attention should also be given toward improving solutions provided by models. In this sense, models will be expected to lead to more realistic, yet useful, solutions. For instance, detail enhancements can be investigated to represent the design parameters of the TRNDP more realistically, in accordance with continuous improvements in computational capabilities. Reasonable decision variables such as stop locations could be added and operational strategies could be considered either as elements preset or to be decided through the models. These would certainly require more detailed O-D matrices, even at the bus stop level. Also, policies for transfers and items related to passenger behavior (for example, waiting time, walking distances, and so on) could be improved, while for service dependent demand, which has been incorporated in some models in the form of transit demand share, efforts could be toward incorporating influences of service on total demand for travel. However, in conjunction with the above, it would be useful for researchers to investigate the opinion, needs and requirements of practitioners with respect to the outputs of existing models.
Modeling approaches can be improved by using other algorithms, already applied in problems of similar complexity such as efforts could also tackle simultaneous construction and configuration of transit routes. Further modeling with multiple objectives would be another area for further research, for example, the potential of combining existing procedures with algorithms and techniques for multiobjective optimization is of significant interest. Finally, as noted by Fan and Machemehl (2004), other directions for research would include the evaluation of existing models using larger and more complex networks and the development of decision support systems which could interact with the planners and graphically represent results produced by the models.

Acknowledgments

The paper has benefited from the constructive comments of two anonymous referees. The writers would like to thank them for their time and effort.

References

Agrawai, J., and Mathew, T. V. (2004). “Transit route design using parallel genetic algorithm.” J. Comput. Civ. Eng., 18(3), 248–256.
Andreasson, I. (1977). “A method for the analysis of transit networks.” Advances of operations research, M. Roubens, ed., North Holland, 1–8.
Axhausemm, K. W., and Smith, R. L., Jr. (1984). “Evaluation of heuristic transit network optimization algorithms.” Transportation Research Record. 976, 7–20.
Baaj, M. H., and Mahmassani, H. S. (1991). “An AI-based approach for transit route system planning and design.” J. Adv. Transp., 25(2), 187–210.
Baaj, M. H., and Mahmassani, H. S. (1995). “Hybrid route generation heuristic algorith for the design of transit networks.” Transp. Res., Part C, 3(1), 31–50.
Berechman, Y. (1993). Public transit economics and deregulation policy, North-Holland, Amsterdam, The Netherlands.
Bielli, M., Caramia, M., and Carotenuto, P. (2002). “Genetic algorithms in bus network optimization.” Transp. Res. Circ., 10(1), 19–34.
Bielli, M., Carotenuto, P., and Confessore, G. (1998). “A new approach for transport network design and optimization.” Proc., 38th the Conf. Congress of the European Regional Science Association, Vienna, Austria.
Black, A. (1979). “Optimizing urban mass transit systems: A general model.” Transportation Research Record. 677, 41–47.
Black, A. (1995). Urban mass transportation planning (McGraw-Hill series in transportation), McGraw-Hill, New York, 411.
Bovy, Ph. (2002). “Mega sports event transportation and main mobility management issues.” OECD Round Table 122, Paris, ⟨http://www.mobility-bovy.ch/pdf/ECMT_BOVY_5_3_02.pdf⟩.
Byrne, B. (1975). “Public transportation line positions and headways for minimum user and system cost in a radial case.” Transp. Res. Rec. (9), 97–102.
Byrne, B. (1976). “Cost minimizing positions, lengths and headways for parallel public transit lines having different speeds.” Transp. Res. Rec., 10, 209–214.
Byrne, B., and Vuchic, V. (1972). “Public transportation line positions and headways for minimum cost.” Traffic flow and transportation, F. G. Newell, ed., Elsevier, New York, 347–360.
Carrese, S., and Gori, S. (2002). “An urban bus network design procedure.” Transportation planning, M. Patriksson and M. Labbé, eds., Kluwer Academic, The Netherlands, 177–195.
Ceder, A. (1989). “Optimal design of transit short-turn trips.” Transportation Research Record. 1221, 8–22.
Ceder, A. (1995). “Transit vehicle-type scheduling problem.” Transportation Research Record. 1503, 34–38.
Ceder, A. (2001). “Operational objective functions in designing public transport routes.” J. Adv. Transp., 35(2), 125–144.
Ceder, A., and Israeli, Y. (1997). “User and operator perspectives in transit network design.” Transportation Research Record. 1623, 3–7.
Ceder, A., and Wilson, N. H. M. (1986). “Bus network design.” Transp. Res., Part B: Methodol., 20B(4), 331–344.
Chakroborty, P. (2003). “Genetic algorithms for optimal urban transit network design.” Comput. Aided Civ. Infrastruct. Eng., 18(3), 184–200.
Chakroborty, P., and Dwivedi, T. (2002). “Optimal route network design for transit systems using genetic algorithms.” Eng. Optimiz., 34(1), 83–100.
Chang, S. K., and Schonfeld, P. M. (1991). “Multiple period optimization of bus transit systems.” Transp. Res., Part B: Methodol., 25B(6), 453–478.
Chang, S. K., and Schonfeld, P. M. (1993a). “Welfare maximization with financial constraints for bus transit systems.” Transportation Research Record. 1395, 48–57.
Chang, S. K., and Schonfeld, P. M. (1993b). “Optimal dimensions of bus service zones.” J. Transp. Eng., 119(4), 567–585.
Chien, S., Dimitrijevic, B., and Spacovic, L. (2003). “Optimization of bus route planning in urban commuter networks.” J. Public Transportation, 6(1), 53–80.
Chien, S., and Schonfeld, P. (1997). “Optimization of grid transit system in heterogeneous urban environment.” J. Transp. Eng., 123(1), 28–35.
Chien, S., and Spacovic, L. (2001). “Optimization of grid bus transit systems with elastic demand.” J. Adv. Transp., 36(1), 63–91.
Chien, S., Yang, Z., and Hou, E. (2001). “Genetic algorithm approach for transit route planning and design.” J. Transp. Eng., 127(3), 200–207.
Chua, T. A. (1984). “The planning of urban bus routes and frequencies: A survey.” Transportation, 12(2), 147–172.
Cipriani, E., Fusco, G., Gori, S., and Petrelli, M. (2005). “A procedure for the solution of the urban bus network design problem with elastic demand.” Advanced OR and AI Methods in Transportation: Proc., 10th Meeting of the EURO Working Group on Transportation, Publishing House of Poznan Univ. of Technology, Poland, 681–685.
Constantin, I., and Florian, M. (1995). “Optimizing frequencies in a transit network: A nonlinear bi-level programming approach.” Int. Trans. in Oper. Res., 2(2), 149–164.
Delle Site, P., and Filippi, F. (1998). “Service optimization for bus corridors with short turn strategies and variable vehicle size.” Transp. Res. Part A, 32(1), 19–38.
Delle Site, P., and Filippi, F. (2001). “Bus service optimization with fuel saving objective and various financial constraints.” Transp. Res. A, 35(2), 163–182.
Desaulniers, G., and Hickman, M. (2003). “Public transit.” Les Cahiers du GERAD, GERAD, HEC Montréal, Montreal, Canada, G-2003-77, Canada.
Dimitriou, D., Karlaftis, M. G., Kepaptsoglou, K., and Stathopoulos, A. (2006). “Public transportation during the Athens 2004 Olympics: From planning to performance.” Proc., 85th Transportation Research Board Annual Meeting, Washington, D.C.
Dorigo, M., and Stutzle, T. (2004). Ant colony optimization, MIT Press, Cambridge, Mass.
Dubois, D., Bell, G., and Llibre, M. (1979). “A set of methods in transportation network synthesis and analysis.” J. Oper. Res. Soc., 30, 797–808.
European Conference on Ministers of Transport (ECMT). (2002). “Implementing sustainable urban transport policies.” Final Rep., ECMT/OECD Publication Service, Paris, France
European Metropolitan Transport Authorities (EMTA). (2004). EMTA barometer of public transport in european metropolitan areas 2002, Madrid.
Eberlein, X. J., Wilson, N., Barnhart, C., and Bernstein, D. (1998). “The real-time deadheading problem in transit operations control.” Transp. Res., Part B: Methodol., 32(2), 77–100.
Fan, W., and Machemehl, R. (2004). “Optimal transit route network design problem: Algorithms, implementations, and numerical results.” Rep. SWUTC/04/167244-1, Center for Transportation Research, Univ. of Texas at Austin, Tex.
Fan, W., and Machemehl, R. (2006a). “Optimal transit route network design problem with variable transit demand: A genetic algorithm approach.” J. Transp. Eng., 132(1), 40–51.
Fan, W., and Machemehl, R. (2006b). “Using a simulated annealing algorithm to solve the transit route network design problem.” J. Transp. Eng., 132(2), 122–132.
Fielding, G. L. (1987). Managing public transit strategically, Jossey-Bass Publishers, San Francisco.
Furth, P. G., and Day, F. B. (1985). “Transit routing and scheduling strategies for heavy demand corridors.” Transportation Research Record. 1011, 23–26.
Furth, P. G., and Wilson, N. H. M. (1981). “Setting frequencies on bus routes: Theory and practice.” Transportation Research Record. 818, 1–7.
Han, A., and Wilson, N. H. M. (1982). “The allocation of buses in heavily utilized networks with overlapping routes.” Transp. Res., Part B: Methodol., 16(3), 221–232.
Hasselström, D. (1981). “Public transportation planning—A mathematical programming approach.” Ph.D. thesis, Dept. of Business Administration, Univ. of Göteborg, Sweden.
Holroyd, E. M. (1967). “Optimum bus service: A theoretical model for a large uniform urban area.” Vehicular traffic science, L. C. Edie, ed., Elsevier, New York, 308–328.
Hu, J., Shi, X., Song, J., and Xu, Y. (2005). “Optimal design for urban mass transit network based on evolutionary algorithm.” Lecture notes in computer science 3611, L. Wang, K. Chen, and Y. S. Ong, eds., Springer, Berlin-Heidelberg.
Hurdle, V. F. (1973). “Minimum cost locations for parallel public transit lines.” Transp. Sci., 7(4), 340–350.
Imam, M. O. (1998). “Optimal design of public bus service with demand equilibrium.” J. Transp. Eng., 124(5), 431–436.
Kocur, G., and Hendrickson, C. (1982). “Design of local bus service with demand equilibrium.” Transp. Sci., 16(4), 359–394.
Lampkin, W., and Saalmans, P. D. (1967). “The design of routes, service frequencies and schedules for a municipal bus undertaking: A case study.” Oper. Res. Q., 18, 375–397.
LeBlanc, L. J. (1988). “Transit system network design.” Transp. Res., Part B: Methodol., 22(5), 383–390.
Lee, Y.-J., and Vuchic, V. R. (2005). “Transit network design with variable demand.” J. Transp. Eng., 131(1), 1–10.
Levinson, H. S. (1992). “System and service planning.” Public transportation, 2nd Ed., G. E. Gray and L. A. Hoel, eds., Prentice-Hall, New York.
Mandl, C. E. (1980). “Evaluation and optimization of urban public transportation networks.” Eur. J. Oper. Res., 5(6), 396–404.
Marwah, B. R., Farokh, S., Umrigar, S., and Patnaik, S. B. (1984). “Optimal design of bus routes and frequencies for Ahmedabad.” Transportation Research Record. 994, 41–47.
Morlok, E. K., and Viton, P. A. (1984). “Feasibility of profitable transit service in radial urban corridors.” Transportation Research Record. 980, 46–54.
Nagy, G., and Salhi, S. (2007). “Location-routing: Issues, models and methods.” Am. Nat., 177, 649–672.
Newell, G. F. (1979). “Some issues relating to the optimal design of bus routes.” Transp. Sci., 13(1), 20–35.
Ngamchai, S., and Lovell, D. J. (2003). “Optimal time transfer in bus transit route network design using an genetic algorithm.” J. Transp. Eng., 129(5), 510–521.
Pattnaik, S. B., Mohan, S., and Tom, V. M. (1998). “Urban bus transit route network using genetic algorithm.” J. Transp. Eng., 124(4), 368–375.
Petrelli, M. (2004). “A transit network design model for urban areas.” Urban transport X, C. A. Brebbia and L. C. Wadhwa, eds., WIT Press, U.K., 163–172.
Pucher, J., Peng, Z.-R., Mittal, N., Zhu, Y., and Korattyswaroopam, N. (2007). “Urban transport trends and policies in China and India: Impacts of rapid economic growth.” Transport Rev., 27(4), 379–410.
Rea, J. C. (1971). “Designing urban transit systems: An approach to the route technology selection problem.” PB 204881, Univ. of Washington, Seattle.
Russo, F. (1998). “Transit frequencies design for enhancing the efficiency of public urban transportation systems: An optimization model and an algorithm.” Proc., 31st Int. Symp. on Automotive Technology and Automation, Dusseldorf, Germany.
Salzborn, F. J. M. (1972). “Optimum bus scheduling.” Transp. Sci., 6(2), 137–148.
Shih, M.-C., Mahmassani, H., and Baaj, H. (1997). “Planning and design model for transit route networks with coordinated operations.” Transportation Research Record. 1623, 16–23.
Silman, L. A., Barzily, Z., and Passy, U. (1974). “Planning the route system for urban buses.” Comput. Oper. Res., 1(2), 201–211.
Sinha, K. C. (2003). “Sustainability and urban public transportation.” J. Transp. Eng., 129(4), 331–341
Soehodho, S., and Nahry. (1999). “Optimal scheduling of public transport fleet at network fleet.” J. Adv. Transp., 34(2), 297–323.
Spasovic, L. N., Boile, M. P., and Bladikas, A. K. (1994). “Bus transit service coverage for maximum profit and social welfare.” Transportation Research Record. 1451, 12–22.
Spacovic, L. N., and Schonfeld, P. M. (1994). “Method for optimizing transit service coverage.” Transportation Research Record. 1402, 28–39.
Spiess, H., and Florian, M. (1989). “Optimal strategies: A new assignment model for transit networks.” Transp. Res., Part B: Methodol., 23(2), 83–102.
Tom, V. M., and Mohan, S. (2003). “Transit route network design using frequency coded genetic algorithm.” J. Transp. Eng., 129(2), 186–195.
Transport Research Board (TRB). (2001). “Making transit work.” Special Rep. 257, National Academy, Washington, D.C.
Transport Research Board (TRB). (2003). Transit capacity and quality of service manual, National Research Council, Washington, D.C.
Tsao, S., and Schonfeld, P. M. (1984). “Optimization of zonal transit service.” J. Transp. Eng., 109(2), 257–272.
Van Nes, R. (2003). “Multi user-class urban transit network design.” Transportation Research Record. 1835, 25–33.
Van Nes, R., and Bovy, P. H. L. (2000). “The importance of objectives in urban transit network design.” Transportation Research Record. 1735, 50–57.
Van Nes, R., Hamerslag, R., and Immers, B. H. (1988). “Design of public transport networks.” Transportation Research Record. 1202, 74–83.
Van Oudheusden, D. L., Ranjithan, S., and Singh, K. N. (1987). “The design of bus route systems—An interactive location allocation approach.” Transportation, 14(3), 253–270.
Vaughan, R. (1986). “Optimum polar networks for an urban bus system with a many-to-many travel demand.” Transp. Res., Part B: Methodol., 20B(3), 215–224.
Vuchic, V. (2004). Urban transit: Operations, planning and economics, Wiley, Hoboken, N.J.
Yang, Z., Yu, B., and Cheng, C. (2007). “A parallel ant colony algorithm for bus network optimization.” Computer Aided Civil and Environmental Engineering, 22(1), 44–55.
Yu, B., and Yang, Z. (2006). “Model and algorithm for iterative design of bus network.” Proc., 9th Int. Conf. on the Applications of Advanced Technologies in Transportation (AATT 2006), Chicago, 731–736.
Zhao, F., and Gan, A. (2003). “Optimization of transit network to minimize transfers.” Rep. BD015-02, Florida International Univ., Fla.
Zhao, F., Ubaka, I., and Gan, A. (2005). “Transit network optimization: Minimizing transfers and maximizing service coverage with an integrated simulated annealing and tabu search method.” Transportation Research Record. 1923, 180–188.
Zhao, F., and Zeng, X. (2006). “Optimization of transit network layout and headway with a combined genetic algorithm and simulated annealing method.” Eng. Optimiz., 38(6), 701–722.
Zhao, F., and Zeng, X. (2007). “Optimization of user and operator cost for large scale transit networks.” J. Transp. Eng., 133(4), 240–251.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering
Journal of Transportation Engineering
Volume 135Issue 8August 2009
Pages: 491 - 505

History

Received: Sep 21, 2007
Accepted: Mar 12, 2009
Published online: Jul 15, 2009
Published in print: Aug 2009

Permissions

Request permissions for this article.

Authors

Affiliations

Konstantinos Kepaptsoglou, M.ASCE [email protected]
Ph.D. Candidate, Researcher, Dept. of Transportation Planning and Engineering, School of Civil Engineering, National Technical Univ. of Athens, Athens, Greece (corresponding author). E-mail: [email protected]
Matthew Karlaftis, Ph.D., M.ASCE [email protected]
Assistant Professor, Dept. of Transportation Planning and Engineering, School of Civil Engineering, National Technical Univ. of Athens, Athens, Greece. E-mail: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

View Options

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share