Study on the vehicle scheduling problem in transportation system

Bingqiang Situ · Wenzhou Jin

5 citations0/0 files storedIEEE International Conference on Computer Science and Information Technology

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Vehicle Routing Optimization Methods Railway Systems and Energy Efficiency

Abstract

The vehicle scheduling problem (VSP) is a classical optimization problem which is part of the operational planning of public transportation systems. This paper analyzes of the optimization models for vehicle scheduling problem in public transport network. The departure time model and departure interval model are formulated in this presented paper. The heuristic algorithms to solve the above models are developed, which optimize the departure time and interval. Finally, the proposed solution methodology is applied to a case study, and the computational results are presented.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 5 citations exist upstream.

References

1999A stochastic user equilibrium assignment model for congested transit networks 2001Optimal timetables for public transportation 2007Optimization models for the single delay management problem in public transportation 1996Multi-Objective Approach for Designing Transit Routes with Frequencies 2004Study of dispatching at minimum waiting time of public transportation transfer under the condition of ITS 1996Advanced Methods in Transportation Analysis

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.