Parallel Auction Algorithm for Bus Rescheduling
From MaRDI portal
Publication:3525429
DOI10.1007/978-3-540-73312-6_14zbMath1279.90069OpenAlexW121390442MaRDI QIDQ3525429
Denis Borenstein, Jing-Quan Li, Pitu B. Mirchandani
Publication date: 12 September 2008
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73312-6_14
Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (5)
A decision support system for the single-depot vehicle rescheduling problem ⋮ The vehicle rescheduling problem with retiming ⋮ Review of real-time vehicle schedule recovery methods in transportation services ⋮ Real-time vehicle rerouting problems with time windows ⋮ Truck schedule recovery for solid waste collection in Porto Alegre, Brazil
Cites Work
- Unnamed Item
- Unnamed Item
- A new algorithm for the quasi-assignment problem
- Improving the Hungarian assignment algorithm
- Dual coordinate step methods for linear network flow problems
- Improved vehicle scheduling in public transport through systematic changes in the time-table
- Parallel synchronous and asynchronous implementations of the auction algorithm
- Auction algorithms for network flow problems: A tutorial introduction
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- A quasi-assignment algorithm for bus scheduling
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Models and Algorithms for Single-Depot Vehicle Scheduling
This page was built for publication: Parallel Auction Algorithm for Bus Rescheduling