The vehicle rescheduling problem: Model and algorithms

Jing Quan Li, Pitu Mirchandani, Denis Borenstein

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

When a vehicle on a scheduled trip breaks down, one or more vehicles need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning vehicles in real-time to this cut trip as well as to other scheduled trips with given starting and ending times, is referred to as the vehicle rescheduling problem (VRSP). This paper considers modeling, algorithmic, and computational aspects of the single-depot VRSP. The paper formulates a model for this problem and develops several fast algorithms to solve it, including parallel synchronous auction algorithms. The concept of the common feasible network (CFN) is introduced to find a good set of initial "prices" for speeding up the auction algorithm. Computational experiments on randomly generated problems are described. Computational results show that, for small problems, all of the developed algorithms demonstrate very good computational performances. For large problems, parallel CFN-based auction algorithms provide the optimal solution with much smaller computation times.

Original languageEnglish (US)
Pages (from-to)211-219
Number of pages9
JournalNetworks
Volume50
Issue number3
DOIs
StatePublished - Oct 2007
Externally publishedYes

Fingerprint

Costs
Experiments

Keywords

  • Auction algorithm
  • Parallel processing
  • Rescheduling
  • Vehicle scheduling

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

The vehicle rescheduling problem : Model and algorithms. / Li, Jing Quan; Mirchandani, Pitu; Borenstein, Denis.

In: Networks, Vol. 50, No. 3, 10.2007, p. 211-219.

Research output: Contribution to journalArticle

Li, Jing Quan ; Mirchandani, Pitu ; Borenstein, Denis. / The vehicle rescheduling problem : Model and algorithms. In: Networks. 2007 ; Vol. 50, No. 3. pp. 211-219.
@article{2f984bf015274da1a5da4a7de287e382,
title = "The vehicle rescheduling problem: Model and algorithms",
abstract = "When a vehicle on a scheduled trip breaks down, one or more vehicles need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning vehicles in real-time to this cut trip as well as to other scheduled trips with given starting and ending times, is referred to as the vehicle rescheduling problem (VRSP). This paper considers modeling, algorithmic, and computational aspects of the single-depot VRSP. The paper formulates a model for this problem and develops several fast algorithms to solve it, including parallel synchronous auction algorithms. The concept of the common feasible network (CFN) is introduced to find a good set of initial {"}prices{"} for speeding up the auction algorithm. Computational experiments on randomly generated problems are described. Computational results show that, for small problems, all of the developed algorithms demonstrate very good computational performances. For large problems, parallel CFN-based auction algorithms provide the optimal solution with much smaller computation times.",
keywords = "Auction algorithm, Parallel processing, Rescheduling, Vehicle scheduling",
author = "Li, {Jing Quan} and Pitu Mirchandani and Denis Borenstein",
year = "2007",
month = "10",
doi = "10.1002/net.20199",
language = "English (US)",
volume = "50",
pages = "211--219",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

T1 - The vehicle rescheduling problem

T2 - Model and algorithms

AU - Li, Jing Quan

AU - Mirchandani, Pitu

AU - Borenstein, Denis

PY - 2007/10

Y1 - 2007/10

N2 - When a vehicle on a scheduled trip breaks down, one or more vehicles need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning vehicles in real-time to this cut trip as well as to other scheduled trips with given starting and ending times, is referred to as the vehicle rescheduling problem (VRSP). This paper considers modeling, algorithmic, and computational aspects of the single-depot VRSP. The paper formulates a model for this problem and develops several fast algorithms to solve it, including parallel synchronous auction algorithms. The concept of the common feasible network (CFN) is introduced to find a good set of initial "prices" for speeding up the auction algorithm. Computational experiments on randomly generated problems are described. Computational results show that, for small problems, all of the developed algorithms demonstrate very good computational performances. For large problems, parallel CFN-based auction algorithms provide the optimal solution with much smaller computation times.

AB - When a vehicle on a scheduled trip breaks down, one or more vehicles need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning vehicles in real-time to this cut trip as well as to other scheduled trips with given starting and ending times, is referred to as the vehicle rescheduling problem (VRSP). This paper considers modeling, algorithmic, and computational aspects of the single-depot VRSP. The paper formulates a model for this problem and develops several fast algorithms to solve it, including parallel synchronous auction algorithms. The concept of the common feasible network (CFN) is introduced to find a good set of initial "prices" for speeding up the auction algorithm. Computational experiments on randomly generated problems are described. Computational results show that, for small problems, all of the developed algorithms demonstrate very good computational performances. For large problems, parallel CFN-based auction algorithms provide the optimal solution with much smaller computation times.

KW - Auction algorithm

KW - Parallel processing

KW - Rescheduling

KW - Vehicle scheduling

UR - http://www.scopus.com/inward/record.url?scp=34748884947&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34748884947&partnerID=8YFLogxK

U2 - 10.1002/net.20199

DO - 10.1002/net.20199

M3 - Article

AN - SCOPUS:34748884947

VL - 50

SP - 211

EP - 219

JO - Networks

JF - Networks

SN - 0028-3045

IS - 3

ER -