Parallel auction algorithm for bus rescheduling

Jing Quan Li, Pitu Mirchandani, Denis Borenstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

When a bus on a scheduled trip breaks down, one or more buses need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning buses 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 bus rescheduling problem (BRP). This paper considers modeling, algorithmic, and computational aspects of the single-depot BRP. The paper develops the sequential and parallel auction algorithm to solve the BRP. Computational results show that our approach solves the problem quickly.

Original languageEnglish (US)
Title of host publicationLecture Notes in Economics and Mathematical Systems
Pages281-299
Number of pages19
Volume600
DOIs
StatePublished - 2008
Externally publishedYes

Publication series

NameLecture Notes in Economics and Mathematical Systems
Volume600
ISSN (Print)00758442

Fingerprint

Rescheduling
Auctions
Breakdown
Computational Results
Customers
Bus
Real-time
Costs
Modeling

ASJC Scopus subject areas

  • Mathematics (miscellaneous)
  • Economics, Econometrics and Finance (miscellaneous)

Cite this

Li, J. Q., Mirchandani, P., & Borenstein, D. (2008). Parallel auction algorithm for bus rescheduling. In Lecture Notes in Economics and Mathematical Systems (Vol. 600, pp. 281-299). (Lecture Notes in Economics and Mathematical Systems; Vol. 600). https://doi.org/10.1007/978-3-540-73312-6_14

Parallel auction algorithm for bus rescheduling. / Li, Jing Quan; Mirchandani, Pitu; Borenstein, Denis.

Lecture Notes in Economics and Mathematical Systems. Vol. 600 2008. p. 281-299 (Lecture Notes in Economics and Mathematical Systems; Vol. 600).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, JQ, Mirchandani, P & Borenstein, D 2008, Parallel auction algorithm for bus rescheduling. in Lecture Notes in Economics and Mathematical Systems. vol. 600, Lecture Notes in Economics and Mathematical Systems, vol. 600, pp. 281-299. https://doi.org/10.1007/978-3-540-73312-6_14
Li JQ, Mirchandani P, Borenstein D. Parallel auction algorithm for bus rescheduling. In Lecture Notes in Economics and Mathematical Systems. Vol. 600. 2008. p. 281-299. (Lecture Notes in Economics and Mathematical Systems). https://doi.org/10.1007/978-3-540-73312-6_14
Li, Jing Quan ; Mirchandani, Pitu ; Borenstein, Denis. / Parallel auction algorithm for bus rescheduling. Lecture Notes in Economics and Mathematical Systems. Vol. 600 2008. pp. 281-299 (Lecture Notes in Economics and Mathematical Systems).
@inproceedings{6fc046a4d2bc4f0886688c84184e63d0,
title = "Parallel auction algorithm for bus rescheduling",
abstract = "When a bus on a scheduled trip breaks down, one or more buses need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning buses 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 bus rescheduling problem (BRP). This paper considers modeling, algorithmic, and computational aspects of the single-depot BRP. The paper develops the sequential and parallel auction algorithm to solve the BRP. Computational results show that our approach solves the problem quickly.",
author = "Li, {Jing Quan} and Pitu Mirchandani and Denis Borenstein",
year = "2008",
doi = "10.1007/978-3-540-73312-6_14",
language = "English (US)",
isbn = "9783540733119",
volume = "600",
series = "Lecture Notes in Economics and Mathematical Systems",
pages = "281--299",
booktitle = "Lecture Notes in Economics and Mathematical Systems",

}

TY - GEN

T1 - Parallel auction algorithm for bus rescheduling

AU - Li, Jing Quan

AU - Mirchandani, Pitu

AU - Borenstein, Denis

PY - 2008

Y1 - 2008

N2 - When a bus on a scheduled trip breaks down, one or more buses need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning buses 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 bus rescheduling problem (BRP). This paper considers modeling, algorithmic, and computational aspects of the single-depot BRP. The paper develops the sequential and parallel auction algorithm to solve the BRP. Computational results show that our approach solves the problem quickly.

AB - When a bus on a scheduled trip breaks down, one or more buses need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning buses 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 bus rescheduling problem (BRP). This paper considers modeling, algorithmic, and computational aspects of the single-depot BRP. The paper develops the sequential and parallel auction algorithm to solve the BRP. Computational results show that our approach solves the problem quickly.

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

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

U2 - 10.1007/978-3-540-73312-6_14

DO - 10.1007/978-3-540-73312-6_14

M3 - Conference contribution

AN - SCOPUS:53749093237

SN - 9783540733119

VL - 600

T3 - Lecture Notes in Economics and Mathematical Systems

SP - 281

EP - 299

BT - Lecture Notes in Economics and Mathematical Systems

ER -