A hard dial-a-ride problem that is easy on average

被引：4
|
作者：
Coja-Oghlan, A
Krumke, SO [1 ]
Nierhoff, T
机构：
[1] Univ Kaiserslautern, Dept Math, D-67653 Kaiserslautern, Germany
[2] Humboldt Univ, Inst Informat, D-10099 Berlin, Germany
来源：
JOURNAL OF SCHEDULING | 2005年 / 8卷 / 03期
关键词：
average-case analysis; NP-hard; approximation algorithm;
D O I：
10.1007/s10951-005-6811-3
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In the dial-a-ride-problem (DARP) objects have to be moved between given sources and destinations in a transportation network by means of a server. The goal is to find the shortest transportation for the server. We study the DSRP when the underlying transportation network forms a caterpillar. This special case is strongly NP-hard in the worst case. We prove that in a probabilistic setting there exists a polynomial time algorithm that finds an optimal solution with high probability. Moreover, with high probability the optimality of the solution found can be certified efficiently. In addition, we examine the complexity of the DARP in a semirandom setting and in the unweighted case.
引用
收藏
页码：197 / 210
页数：14
相关论文
共 50 条
  • [1] 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
  • [2] The dial-a-ride problem with fairness
    Miyaoka, Makoto
    Sukegawa, Noriyoshi
    Asano, Takao
    [J]. JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2018, 12 (03):
  • [3] The Dial-A-Ride Problem with Transfers
    Masson, Renaud
    Lehuede, Fabien
    Peton, Olivier
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 12 - 23
  • [4] The Integrated Dial-a-Ride Problem
    Häll C.H.
    Andersson H.
    Lundgren J.T.
    Värbrand P.
    [J]. Public Transport, 2009, 1 (1) : 39 - 54
  • [5] A Matheuristic for the Dial-a-Ride Problem
    Calvo, Roberto Wolfler
    Touati-Moungla, Nora
    [J]. NETWORK OPTIMIZATION, 2011, 6701 : 450 - 463
  • [6] The finite capacity dial-a-ride problem
    Charikar, M
    Raghavachari, B
    [J]. 39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 458 - 467
  • [7] The dial-a-ride problem: models and algorithms
    Jean-François Cordeau
    Gilbert Laporte
    [J]. Annals of Operations Research, 2007, 153 : 29 - 46
  • [8] The dial-a-ride problem: models and algorithms
    Cordeau, Jean-Francois
    Laporte, Gilbert
    [J]. ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) : 29 - 46
  • [9] STRATEGIES FOR THE DYNAMIC DIAL-A-RIDE PROBLEM
    Wong, K. I.
    [J]. TRANSPORTATION AND THE ECONOMY, 2005, : 551 - 559
  • [10] The electric autonomous dial-a-ride problem
    Bongiovanni, Claudia
    Kaspi, Mor
    Geroliminis, Nikolas
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 122 : 436 - 456
12345