To optimize the operation of automated vehicles and ride-hailing, we introduce a tradable permit system with a dynamic scheduling auction on a recursively structured network and apply the Vickley-Clarke-Groves (VCG) mechanism as a method to determine the allocation pattern of permits. Our proposed system is characterized by its flexibility in responding to changes in demand and road conditions, making it more user-friendly than conventional methods. However, the scheduling problem determining the permit allocation pattern is classified as NP-hard. Moreover, due to the dynamics, the load for recalculation is high. For such problems, we propose a complete enumeration method based on zero suppressed binary decision diagrams (ZDD), in which the alternatives are structured, and show its high performance against recalculation by comparing it with a linear relaxation method.
Sequential optimization for spatiotemporal edge auctions based on complete enumeration using ZDD
08.10.2022
606208 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Competitive Performance Assessment of Dynamic Vehicle Routing Technologies Using Sequential Auctions
Transportation Research Record | 2004
|Competitive Performance Assessment of Dynamic Vehicle Routing Technologies Using Sequential Auctions
Online Contents | 2004
|Quantifying Opportunity Costs in Sequential Transportation Auctions for Truckload Acquisition
Transportation Research Record | 2006
|Quantifying Opportunity Costs in Sequential Transportation Auctions for Truckload Acquisition
Online Contents | 2006
|Quantifying Opportunity Costs in Sequential Transportation Auctions for Truckload Acquisition
Transportation Research Record | 2006
|