00931944

Component

https://doi.org/10.3141/1783-09

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

The problem considered is dynamic online truckload routing and scheduling with time windows operating in oversaturated conditions, that is, when the demand for service exceeds the system's average capacity. The relationship between computation time and the solution quality, measured by system efficiency and response time, is discussed. A dynamic operation process for implementing various algorithms and procedures is described, with the aim of fully utilizing computational resources without wasting available time between successive demand requests. In addition, particularly when demand arrival rates result in oversaturated system conditions, application of intelligent acceptance and filtering decision procedures that consider system status and demand characteristics can result in significant operational benefits. Simulation experiments conducted to evaluate the relative performance of the proposed approaches confirm the existence of significant improvement potential in terms of both system efficiency and response time over previous approaches.

This paper appears in Transportation Research Record No. 1783, Transportation Network Modeling 2002.

English

p. 66-71

2002

Transportation Research Record

0309077079

Figures (7) ; References (13) ; Tables (3)

Decision support systems; Intelligent control systems; Reaction time; Routing; Scheduling; Simulation; Time windows; Traffic oversaturation; Truck traffic

Computation time; Dynamic routing; System efficiency

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

TRIS, TRB, ATRI

Oct 2 2002 12:00AM

• ADAPTIVE SPEED ESTIMATION USING TRANSFER FUNCTION MODELS FOR REAL-TIME DYNAMIC TRAFFIC ASSIGNMENT OPERATION
• ANALYTICAL DYNAMIC TRAFFIC ASSIGNMENT MODEL WITH PROBABILISTIC TRAVEL TIMES AND PERCEPTIONS
• BEST ROUTING POLICY PROBLEM IN STOCHASTIC TIME-DEPENDENT NETWORKS
• COMBINED MODEL FOR TIME-DEPENDENT TRIP DISTRIBUTION AND TRAFFIC ASSIGNMENT
• DESIGN AND OPERATIONAL CONCEPTS OF HIGH-COVERAGE POINT-TO-POINT TRANSIT SYSTEM
• DETERMINING CRITICAL ARCS FOR COLLECTING REAL-TIME TRAVEL INFORMATION
• DYNAMIC PROCEDURE FOR SHORT-TERM PREDICTION OF TRAFFIC CONDITIONS
• EMERGENCE OF PRIVATE ADVANCED TRAVELER INFORMATION SYSTEM PROVIDERS AND THEIR EFFECT ON TRAFFIC NETWORK PERFORMANCE
• HEURISTIC ALGORITHMS FOR SOLVING HAZARDOUS MATERIALS LOGISTICAL PROBLEMS
• HYBRID REAL-TIME DYNAMIC TRAFFIC ASSIGNMENT APPROACH FOR ROBUST NETWORK PERFORMANCE
• IDENTIFYING MULTIPLE REASONABLE ALTERNATIVE ROUTES: EFFICIENT VECTOR LABELING APPROACH
• INTERNODAL DELAY ISSUES IN LONG-RANGE, ADAPTIVE TRAFFIC FORECASTS
• LINK- AND PATH-BASED TRAFFIC ASSIGNMENT ALGORITHMS: COMPUTATIONAL AND STATISTICAL STUDY
• MODELING COMPETITIVE TRANSIT AND ROAD TRAFFIC INFORMATION SERVICES WITH HETEROGENEOUS ENDOGENOUS DEMAND
• MULTICLASS CONTINUOUS-TIME EQUILIBRIUM MODEL FOR DEPARTURE TIME CHOICE ON SINGLE-BOTTLENECK NETWORK
• OPTIMAL IMPROVEMENT SCHEME FOR NETWORK RELIABILITY
• SCHEDULE-BASED PATH-FINDING ALGORITHMS FOR TRANSIT TRIP-PLANNING SYSTEMS
• SNOW EMERGENCY VEHICLE ROUTING WITH ROUTE CONTINUITY CONSTRAINTS
• TRAVEL TIME MINIMIZATION VERSUS RESERVE CAPACITY MAXIMIZATION IN THE NETWORK DESIGN PROBLEM
• TRAVEL TIME RELIABILITY WITH RISK-SENSITIVE TRAVELERS
• UNCOUPLED METHOD FOR EQUILIBRIUM-BASED LINEAR PATH FLOW ESTIMATOR FOR ORIGIN-DESTINATION TRIP MATRICES
• VALUE OF DIFFERENT CATEGORIES OF INFORMATION IN ESTIMATING FREIGHT ORIGIN-DESTINATION TABLES