1992
DOI: 10.1007/978-3-642-85968-7_9
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling Considerations in Designing Transit Routes at the Network Level

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

1995
1995
2019
2019

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 15 publications
0
9
0
Order By: Relevance
“…In 1979, Newell [8] discussed previous research on the optimal design of the bus routes and Hasselstrom [9] 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. More information can be found in the articles of Ceder and Israeli [10], Odoni et al [11], Bussieck et al [12], Marc et al [13], Konstantinos et al [3]. The first approaches to the line planning problem had the idea to assemble lines from shorter pieces in an iterative process.…”
Section: Related Literaturementioning
confidence: 99%
“…In 1979, Newell [8] discussed previous research on the optimal design of the bus routes and Hasselstrom [9] 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. More information can be found in the articles of Ceder and Israeli [10], Odoni et al [11], Bussieck et al [12], Marc et al [13], Konstantinos et al [3]. The first approaches to the line planning problem had the idea to assemble lines from shorter pieces in an iterative process.…”
Section: Related Literaturementioning
confidence: 99%
“…This section provides a short overview of the literature for the LPP. Additional information can be found in the article of Ceder and Israeli (1992), which covers the literature up to the beginning of the 1990s; see also Odoni, Rousseau, and Wilson (1994) and Bussieck, Winter, and Zimmermann (1997).…”
Section: Related Workmentioning
confidence: 99%
“…Another formulation of the presented problem, including the constraints of the PT network design can be found in Ceder and Israeli (1992) and Israeli and Ceder (1996). The nature of both formulations is non-linear (non-linear and mixed integer programming).…”
Section: Concuding Remarksmentioning
confidence: 99%