当前位置: 首页> 国外交通期刊数据库 >详情
原文传递 Optimizing Single-Depot Vehicle Scheduling Problem: Fixed-Interval Model and Algorithm
题名: Optimizing Single-Depot Vehicle Scheduling Problem: Fixed-Interval Model and Algorithm
其他题名: Bhattacharya,B.,Carmi,P.,Hu,Y.,&Shi,Q.(2008).Single vehicle scheduling problems on path/tree/cycle networks with release and handling times.Algorithms and Computation,5369,800–811.
正文语种: 英文
作者: JIAN ZHANG
关键词: Algorithm;Fixed Interval;SDVSP;Vehicle Scheduling
摘要: Intelligent transportation systems (ITS) play an important role in public transit. This study addresses modeling and algorithm for the optimal single-depot vehicle scheduling problem (SDVSP) in the intelligent public transit operation, which has been implemented successfully in practice. The problem is formulated as a fixed-interval scheduling model in accord with job shop scheduling theory, which aims to assign ideal jobs to machines at appropriate times to maximize production in computer science or industrial engineering. This model allows transportation engineers to make use of those out-of-the-box theories and solution methods already developed for fixed-interval scheduling problems. In this article, the SDVSP with multiple vehicle types is established as a non-preemptive online multiprocessor-task fixed-interval scheduling model. As conventional solution methods for solving fixed interval scheduling problems are no longer available for the proposed model, this article develops the algorithm based on the FIFO (first in, first out) rule to find the optimal vehicle scheduling solution, and the optimal criterion is proved via competitive analysis. A case study is carried out to evaluate the proposed methodology by using field data collected from one transit system.
出版年: 2015
论文唯一标识: J-96Y2015V19N03001
doi: 10.1080/15472450.2013.836930
期刊名称: Journal of Intelligent Transportation Systems Technology Planning and Operations
拼音刊名(出版物代码): J-96
卷: 19
期: 03
页码: 215-224
检索历史
应用推荐