找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Computer-Aided Transit Scheduling; Proceedings, Cambrid Nigel H. M. Wilson Conference proceedings 1999 Springer-Verlag Berlin Heidelberg 19

[復制鏈接]
樓主: 貪污
31#
發(fā)表于 2025-3-26 22:36:58 | 只看該作者
32#
發(fā)表于 2025-3-27 02:19:46 | 只看該作者
An Integrated Approach to Ex-Urban Crew and Vehicle Schedulingparticular settings such as the ex-urban mass transit, where crews are tightly dependent on vehicles’ activity or crews’ dead-headings are highly constrained. In this paper we propose an integrated approach to vehicle and crew scheduling which exploits the network structure of the problem. A heurist
33#
發(fā)表于 2025-3-27 06:08:17 | 只看該作者
Producing Train Driver Schedules Under Differing Operating Strategieshave efficient operating schedules. Manpower costs are a significant element in any transport organization, and the ability to minimize these is seen as crucial to the effective running of these companies. In addition, the need to try out different operating strategies is gaining in importance as th
34#
發(fā)表于 2025-3-27 09:40:31 | 只看該作者
Integrated Scheduling of Buses and Drivers, and franchised out to several private companies for operation. The nature of the scheduling problem is different from most of those described at previous workshops, because vehicle and driver schedules are developed simultaneously, but on a line by line basis. The present paper describes work carr
35#
發(fā)表于 2025-3-27 15:07:40 | 只看該作者
Object Oriented Bus Vehicle Scheduling — the BOOST Systemon, extensibility and reusability. The VAMPIRES algorithm, originated in the 1960s for scheduling train locomotives and later formed the basis of the BUSPLAN system within the BUSMAN package, has been updated using the object-oriented approach and used as the core scheduling algorithm in BOOST. In t
36#
發(fā)表于 2025-3-27 19:42:11 | 只看該作者
37#
發(fā)表于 2025-3-27 22:54:12 | 只看該作者
38#
發(fā)表于 2025-3-28 02:09:02 | 只看該作者
Timetable Synchronization for Buses maximize the number of simultaneous arrivals of buses at the connection nodes (transfer nodes) of the network. The data for the problem are as follows: a bus route network, including connection nodes of the bus routes; the number of bus departures for every bus route in the network, during a given
39#
發(fā)表于 2025-3-28 10:10:01 | 只看該作者
40#
發(fā)表于 2025-3-28 12:37:38 | 只看該作者
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 09:41
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
炉霍县| 县级市| 二连浩特市| 桃园市| 鹤庆县| 政和县| 虹口区| 铜山县| 肃南| 徐汇区| 托克托县| 桦南县| 嘉黎县| 莲花县| 黔南| 蒙山县| 盘山县| 六枝特区| 无锡市| 宁津县| 八宿县| 新河县| 深圳市| 乌鲁木齐县| 屏山县| 凤阳县| 亚东县| 彰武县| 万宁市| 东乡| 青岛市| 普兰县| 万盛区| 石家庄市| 连州市| 高阳县| 山丹县| 阿拉尔市| 通化县| 清远市| 西华县|