Transit Scheduling Model Research Based on Time-Space Network

Yue Meng; Jian Zhang; Jian Qiang Nie; Gang Zhong

doi:10.4028/www.scientific.net/AMM.587-589.1809

Paper Titles

The Integrated Berth and Quay Crane Scheduling Problem in Container Terminals
p.1793

The Integrated Yard Truck and Yard Crane Scheduling and Storage Allocation Problem at Container Terminals
p.1797

The Study of Changchun Automobile Industrial Logistics Transport Land Distribution
p.1801

Traffic Demand Model to Study Urban Agglomeration Transportation System
p.1805

Transit Scheduling Model Research Based on Time-Space Network
p.1809

A Method of Bike Sharing Demand Forecasting
p.1813

Evaluation Model of Urban Expressway Nodes Based on Entropy Weight and Variable Weight Model
p.1817

On Urban Transportation Planning in an Information Society
p.1822

Parking on University Campus: How to Avoid the Tragedy of Commons?
p.1826

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 587-589Transit Scheduling Model Research Based on...

Transit Scheduling Model Research Based on Time-Space Network

Abstract:

This paper try to develop a transit scheduling model based on the time-space network. The object is using the minimum cost to finish the required trips in time-table with the consideration of certain assumptions and rules. In this paper we deal with the multi-depot vehicle schedule optimization problem, addressed as MDVSP, using one time-space network instead of the traditional connection-based networks. Furthermore, we introduce the concept of open-depot, which means the bus may not return the depot where it started.

You might also be interested in these eBooks

Sustainable Cities Development and Environment Protection IV

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 587-589)

Pages:

1809-1812

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.587-589.1809

Citation:

Cite this paper

Online since:

July 2014

Authors:

Yue Meng, Jian Zhang, Jian Qiang Nie, Gang Zhong

Keywords:

Multi-Deport, Time-Space Network, Transit Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Natalia Kliewer, Taïeb Mellouli, Leena Suhl A time-space network based exact optimization model for multi-depot bus scheduling European Journal of Operational Research Vol 175(3): 1616-1627, (2006).

DOI: 10.1016/j.ejor.2005.02.030

Google Scholar

[2] ME Berge, CA Hopperstad Demand driven dispatch: A method for dynamic aircraft capacity assignment, models and algorithms Operations research, Vol 41: 153-168, (1993).

DOI: 10.1287/opre.41.1.153

Google Scholar

[3] Kliewer, N, Mellouli, T, and Suhl, L. A new solution model for multi-depot multi-vehicle-type vehicle scheduling in (sub)urban public transport. In Proceedings of the 13th Mini-EURO Conference and the 9th meeting of the EURO working group on transportation, (2002).

Google Scholar

[4] Carpaneto G, Dell'Amico M, Fischetti M, Toth P A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19: 531-548 (1989).

DOI: 10.1002/net.3230190505

Google Scholar

[5] Mesquita M, Paixão JMP Multiple depot vehicle scheduling problem: a new heuristic based on quasi-assignment algorithms. In J-M.R. M Desrochers editor, Proceedings of the fifth international workshop on computer-aided scheduling of public transport, pp.167-180, (1992).

DOI: 10.1007/978-3-642-85968-7_12

Google Scholar

[6] Bertossi A. A, Carraresi. P, Gallo G On some matching problems arising in vehicle scheduling models. Networks 17: 271-281, (1987).

DOI: 10.1002/net.3230170303

Google Scholar

[7] Ribeiro C, Soumis F A column generation approach to the multiple-depot vehicle scheduling problem. Operation Research 42(1): 41-52, (1994).

DOI: 10.1287/opre.42.1.41

Google Scholar