DIAL-A-RIDE

被引：0
|
作者：
RICHARDS, B
机构：
来源：
ARCHITECTURAL DESIGN | 1975年 / 45卷 / 12期
关键词：
D O I：
暂无
中图分类号：
TU [建筑科学];
学科分类号：
0813 ;
摘要：
引用
收藏
页码：777 / 778
页数：2
相关论文
共 50 条
  • [31] The rail-road Dial-a-Ride problem
    Jodeau, Jean
    Absi, Nabil
    Chevrier, Remy
    Feillet, Dominique
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 318 (02) : 486 - 499
  • [32] WAITING STRATEGIES FOR THE DYNAMIC DIAL-A-RIDE PROBLEM
    Yuen, C. W.
    Wong, K. I.
    Han, Anthony F.
    [J]. TRANSPORTATION SYSTEMS: ENGINEERING & MANAGEMENT, 2007, : 277 - 277
  • [33] The dial-a-ride problem in a public transit system
    Uchimura, K
    Saitoh, T
    Takahashi, H
    [J]. ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1999, 82 (07): : 30 - 38
  • [34] Typology and literature review for dial-a-ride problems
    Molenbruch, Yves
    Braekers, Kris
    Caris, An
    [J]. ANNALS OF OPERATIONS RESEARCH, 2017, 259 (1-2) : 295 - 325
  • [35] A Hyperheuristic for the Dial-a-Ride Problem with Time Windows
    Urra, Enrique
    Cubillos, Claudio
    Cabrera-Paniagua, Daniel
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [36] Variable neighborhood search for the dial-a-ride problem
    Parragh, Sophie N.
    Doerner, Karl F.
    Hartl, Richard F.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (06) : 1129 - 1138
  • [37] Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
    Firat, Murat
    Woeginger, Gerhard J.
    [J]. OPERATIONS RESEARCH LETTERS, 2011, 39 (01) : 32 - 35
  • [38] Typology and literature review for dial-a-ride problems
    Yves Molenbruch
    Kris Braekers
    An Caris
    [J]. Annals of Operations Research, 2017, 259 : 295 - 325
  • [39] A Hard Dial-a-Ride Problem that is Easy on Average
    Amin Coja-Oghlan
    Sven O. Krumke
    Till Nierhoff
    [J]. Journal of Scheduling, 2005, 8 : 197 - 210
  • [40] Hardness of preemptive Finite Capacity Dial-a-Ride
    Gortz, Inge Li
    [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 200 - 211
12345