00983303

Component

https://doi.org/10.3141/1882-02

http://scholar.google.com...llet&publication_year=2004

Technologies for a dynamic truckload pickup-and-delivery problem in a competitive environment by use of sequential auctions are compared. In this environment, demands arrive randomly over time and are described by pickup-and-delivery locations and hard time windows. On demand arrival, carriers compete for the loads in a second-price auction. Four fleet assignment technologies with different degrees of sophistication are tested with simulations. The technologies differ in how they deal with the combinatorial and stochastic elements of the online problem. A one-step look-ahead dynamic vehicle routing technology that tries to estimate the impacts of current decisions on serving future loads (not yet arrived) is introduced. The performance of each technology is analyzed in relation to different demand characteristics.

This paper appears in Transportation Research Record No. 1882, Transportation Network Modeling 2004.

00983301

English

p. 10-18

2004

Transportation Research Record

0309094755

Figures (5) ; References (20)

Evaluation and assessment; Performance; Pickup and delivery service

Dynamic routing; Fleet assignment technologies; Sequential auctions

Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Dec 13 2004 12:00AM

• APPLYING A NETWORK PROGRAMMING ALGORITHM TO A NETWORKWIDE TRAFFIC CONTROL SCHEME: SIMULATION-BASED PERFORMANCE STUDIES
• APPROXIMATE PROCEDURES FOR PROBABILISTIC TRAVELING SALESPERSON PROBLEM
• COMBINATORIAL APPROACH FOR MULTIPLE-DESTINATION USER OPTIMAL DYNAMIC TRAFFIC ASSIGNMENT
• DYNAMIC ROUTING DECISIONS FOR COMMERCIAL VEHICLE OPERATIONS IN REAL-TIME TRAFFIC CONDITIONS
• DYNAMIC TRUCKLOAD ROUTING, SCHEDULING, AND LOAD ACCEPTANCE
• ENHANCED DYNAMIC ORIGIN-DESTINATION MATRIX UPDATING WITH LONG-TERM FLOW INFORMATION
• ESTIMATION OF TURNING MOVEMENTS AT INTERSECTIONS: JOINT TRIP DISTRIBUTION AND TRAFFIC ASSIGNMENT PROGRAM COMBINED WITH A GENETIC ALGORITHM
• FORMULATION OF ANALYTICAL TIME-VARYING INTERMODAL PERSON TRIP ASSIGNMENT MODEL
• INCORPORATING AUTOMATED VEHICLE IDENTIFICATION DATA INTO ORIGIN-DESTINATION ESTIMATION
• INTEGRATED APPROACH FOR EMERGENCY MEDICAL SERVICE LOCATION AND ASSIGNMENT PROBLEM
• METHODOLOGY FOR DETERMINING VULNERABLE LINKS IN A TRANSPORTATION NETWORK
• MINIMAL ARC PARTITIONING PROBLEM: FORMULATION AND APPLICATION IN SNOW ROUTING WITH SERVICE ROUTE CONTINUITY
• MODELING REPEATED MULTINOMIAL ROUTE CHOICES UNDER ADVANCED TRAVELER INFORMATION SYSTEM: GENERALIZED ESTIMATING EQUATIONS WITH POLYTOMOUS LOGIT FUNCTION
• MULTIDEPOT VEHICLE ROUTING WITH UNCERTAIN DEMANDS: CHANCE CONSTRAINED APPROACH
• OPTIMAL TOLLS WITH A MULTICLASS, BICRITERION TRAFFIC NETWORK EQUILIBRIUM
• PREDICTING INTERNATIONAL FREIGHT FLOWS FOR TRADE: SIMULTANEOUS MULTIMODAL, MULTICOMMODITY, NETWORK EQUILIBRIUM MODEL
• SEQUENTIAL LOGIT DYNAMIC TRAVEL DEMAND MODEL FOR HURRICANE EVACUATION
• SIMULATION MODEL FOR REAL-TIME EMERGENCY VEHICLE DISPATCHING AND ROUTING
• STOCHASTIC TRANSPORTATION NETWORK DESIGN PROBLEM WITH SPATIAL EQUITY CONSTRAINT
• TABU SEARCH ALGORITHM FOR DYNAMIC VEHICLE ROUTING PROBLEMS UNDER REAL-TIME INFORMATION
• TAXI DISPATCH SYSTEM BASED ON CURRENT DEMANDS AND REAL-TIME TRAFFIC CONDITIONS
• TRANSPORTATION NETWORK OPTIMIZATION PROBLEMS WITH STOCHASTIC USER EQUILIBRIUM CONSTRAINTS
• VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS AND STOCHASTIC DEMAND