• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 17
  • 8
  • 2
  • 1
  • Tagged with
  • 34
  • 34
  • 34
  • 13
  • 13
  • 11
  • 10
  • 6
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Mathematical models for the optimum scheduling of commuter trains / [by] F.J.M. Salzborn

Salzborn, Franz Johann January 1970 (has links)
Reprint from published paper in back pocket / 68 leaves : ill., tables / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Mathematics, 1971
2

Linear and nonlinear estimators of the O-D matrix

Wills, Michael Jeffrey January 1978 (has links)
The general objective of this work is to construct, test and apply a method of estimating a matrix of passenger trips between origins and destinations (0-D) from existing data and without recourse to a survey. This objective is attained in five steps. First, it is shown that existing 0-D survey methods are expensive, cumbersome and unreliable. Then, three families of models are hypothesized to estimate the 0-D matrix from the traffic volumes observed on highway links; these are nonlinear, linear and sequential models. The third step selects the nonlinear class of models, which are estimated and systematically tested on a variety of data, including data for Canada as a whole. Here it is shown that these estimates give good approximations of the 0-D matrix together with reasonable parameters. Given the construction of the first intercity car and bus 0-D matrices for Canada, a fourth step uses these data to estimate what seems to be the first complete intercity multimodal passenger travel demand model for the entire country. This model is shown to be a special case of a more general and "flexible" model, which is in turn estimated and analysed from several points of view. In the empirical parts of the work, likelihood ratio tests are used throughout and families of models are hierarchically nested, leading to a natural framework for the evaluation of successive restrictions on the most general formulations. Efficient algorithms are developed which permit the estimation of large and complex models on extensive datasets. / Arts, Faculty of / Geography, Department of / Graduate
3

Public transport network design for competitive service providers.

January 2009 (has links)
Chan, Yon Sim Eddie. / Thesis submitted in: November 2008. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 89-92). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Background --- p.2 / Chapter 1.3 --- Literature Review --- p.5 / Chapter 2 --- Game Theoretic Models For Competing Operators --- p.10 / Chapter 2.1 --- Competitive Equilibrium Model --- p.12 / Chapter 2.1.1 --- Base Model Formulation --- p.12 / Chapter 2.1.2 --- Capacitated Model Formulation --- p.16 / Chapter 2.1.3 --- Solution Methods --- p.19 / Chapter 2.2 --- Net Profit Maximizing --- p.26 / Chapter 2.2.1 --- Equitable Route Assignment --- p.27 / Chapter 2.3 --- Congestion Game Model with Player- and Route-dependent Operating Cost --- p.31 / Chapter 2.3.1 --- Best-Response Algorithm --- p.34 / Chapter 2.3.2 --- Integer Programming Formulation --- p.41 / Chapter 2.3.3 --- Net Profit Maximizing --- p.43 / Chapter 3 --- Network Design --- p.45 / Chapter 3.1 --- Network Structure --- p.47 / Chapter 3.2 --- Comparison Between Two Network Structures --- p.49 / Chapter 3.2.1 --- Routes with Same Ridership --- p.49 / Chapter 3.2.2 --- Routes with Different Ridership --- p.65 / Chapter 3.2.3 --- Network with Player- and Route-specific Profit Function --- p.69 / Chapter 4 --- Elastic Demand --- p.71 / Chapter 4.1 --- Congestion Game Model with Service-Quality-Based Elastic Demand --- p.71 / Chapter 4.1.1 --- Network with Service-Quality-Based Elastic Demand --- p.82 / Chapter 5 --- Conclusion --- p.84 / Chapter 5.1 --- Future Work --- p.84 / Chapter 5.1.1 --- Impact of Network Design and structure --- p.84 / Chapter 5.1.2 --- Non-cooperative and Cooperative Games --- p.86 / Chapter 5.1.3 --- Joint game-theoretic model of both passenger and providers --- p.87 / Bibliography --- p.89
4

Reliability-based transit assignment : formulations, solution methods, and network design applications

Jiang, Yu, 姜宇 January 2014 (has links)
abstract / Civil Engineering / Doctoral / Doctor of Philosophy
5

Modeling equilibria in integrated transportation-land use models

Zhao, Yong 28 August 2008 (has links)
Not available / text
6

A dynamic solution to the time constrained transportation scheduling problem

Xenos, Michael John, 1936- January 1968 (has links)
No description available.
7

Development of a general transportation scheduling model

Hogan, Jerry Harold, 1937- January 1967 (has links)
No description available.
8

Flow path network design and layout configuration for material delivery systems

Bakkalbasi, Omer 12 1900 (has links)
No description available.
9

Optimization of urban travel modal choice for the journey to and from work in the city of Atlanta

Torres-Diaz, Jose 05 1900 (has links)
No description available.
10

A new behavioral principle for travelers in an urban network : final report

January 1981 (has links)
Stanley B. Gershwin, David M. Orlicki, Yacov Zahavi. / Cover title. "October 1981." Contract no. DTRS-57-80-C-00012. Performing organizations: Mobility Systems, Inc. and Massachusetts Institute of Technology, Laboratory for Information and Decision Systems. Under contract to the Transportation Systems Center. / Includes bibliographical references.

Page generated in 0.1188 seconds