Competition and Regulation in Network Industries · 2006 · 71 citations · 15 references
BusinessEconomicsMathematicsAuction TheoryTransportationTransportation EngineeringAuction DesignCombinatorial AuctionsCombinatorial OptimizationInteger ProgrammingTransportation ModelsTransportation ProblemsAuction AlgorithmsCombinatorial Auction DesignInteger Programming For AllocationRailway SchedulingRailway SimulationRailway StationsSlot AuctionsWinner Determination Problem
We present an approach to implement an auction of railway slots. Railway network, train driving characteristics, and safety requirements are described by a simplified, but still complex macroscopic model. In this environment, slots are modelled as combinations of scheduled track segments. The auction design builds on the iterative combinatorial auction. However, combinatorial bids are restricted to some types of slot bundles that realize positive synergies between slots. We present a bidding language that allows bidding for these slot bundles. An integer programming approach is proposed to solve the winner determination problem of our auction. Computational results for auction simulations in the Hannover-Fulda-Kassel area of the German railway network give evidence that auction approaches can induce a more efficient use of railway capacity.
15
Journal of transport economics and policy
Transportation Research · 1970 · 1.9K citations
Railway Timetabling Using Lagrangian Relaxation
Ulf Brännlund, P. O. Lindberg, Andreas Nöu et al. · Transportation Science · 1998 · 304 citations
The First Use of a Combined-Value Auction for Transportation Services
John O. Ledyard, Mark A. Olson, David Porter et al. · INFORMS Journal on Applied Analytics · 2002 · 247 citations
David C. Parkes · 1999 · 218 citations · Full text