01018678

Component

https://doi.org/10.3141/1923-20

http://scholar.google.com...+Xia&publication_year=2005

In combinatorial auctions, solving the bid generation problem (BGP) for bidders is critical to achieving efficiency. However, in the recent surge of combinatorial auction research, little attention has been paid to the BGP. In this paper, the BGP faced by transportation service providers is studied. First, the bidder’s optimality criterion of a combinatorial bid is clarified, and then the focus is on the bundling method when an OR bid language is used. Through examples, bundles generated by solving the optimal truck routing problem were examined, and it was found that the resulting bid might not be optimal. This heuristic is compared with a simple nearest insertion method. The simulation result shows that whereas the former outperforms the latter in most cases, many times the latter outperforms the former by 5% to 8%.

01018662

English

pp 189-198

2005

Transportation Research Record: Journal of the Transportation Research Board

030909397X

Print

Figures (4) ; References (16) ; Tables (7)

Combinatorial analysis; Motor carriers; Procurement

Bid generation problem; Bundling; Transportation services

Highways; Motor Carriers; Planning and Forecasting; Society; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Feb 3 2006 4:05PM

• Adjustable Preference Path Strategies for Use in Multicriteria, Stochastic, and Time-Varying Transportation Networks
• Algorithm for Equilibrium Transit Assignment Problem
• Analysis of Route Choice Decisions by Long-Haul Truck Drivers
• Commodity-Based Truck Origin-Destination Matrix Estimation Using Input-Output Data and Genetic Algorithms
• Comparison of System- and User-Optimal Stochastic Dynamic Network Design Models Using Monte Carlo Bounding Techniques
• Dynamic Prediction Method with Schedule Recovery Impact for Bus Arrival Time
• Dynamic Vehicle Routing Problem with Multiple Objectives: Solution Framework and Computational Experiments
• Enhancement of Automatic Incident Detection Algorithms for Singapore’s Central Expressway
• Improved Path Flow Estimator for Origin-Destination Trip Tables
• Microsimulation of Flexible Transit System Designs in Realistic Urban Networks
• Modeling Traffic Flow Operation in Multilane and Multiclass Urban Networks
• Modeling Traffic Volatility Dynamics in an Urban Network
• Online Consistency Checking and Origin-Destination Demand Updating: Recursive Approaches with Real-Time Dynamic Traffic Assignment Operator
• Online Dispatching and Routing Model for Emergency Vehicles with Area Coverage Constraints
• Optimal Toll Design Problem in Dynamic Traffic Networks with Joint Route and Departure Time Choice
• Optimizing Location and Relocation of Response Units in Guarding Critical Facilities
• Real-Time Estimation of Origin-Destination Matrices with Partial Trajectories from Electronic Toll Collection Tag Data
• Robust Model for Estimating Freeway Dynamic Origin-Destination Matrix
• Strategies for Online Inventory Routing Problem Under Real-Time Information
• Study on Optimal Frequency Design Problem for Multimodal Network Using Probit-Based User Equilibrium Assignment
• Toll Pricing and Heterogeneous Users: Approximation Algorithms for Finding Bicriterion Time-Dependent Efficient Paths in Large-Scale Traffic Networks
• Transit Network Optimization: Minimizing Transfers and Maximizing Service Coverage with an Integrated Simulated Annealing and Tabu Search Method
• Trial-and-Error Procedure for Implementing a Road-Pricing Scheme
• Using Simulation to Test Traffic Incident Management Strategies: The Benefits of Preplanning