00983311

Component

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

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

A real-world vehicle routing and scheduling problem in which a set of known customers is served by a number of vehicles with known capacity is considered. The demand for each customer is stochastic and needs to be served within a given time window. Strict adherence to the time window constraints for customers who practice the just-in-time concept of inventory management is requisite. One or several factors of vehicle routing and scheduling problems are stochastic. This has a major impact on how the problem is both formulated and solved. A three-index model that is a mixed-integer stochastic program with recourse is proposed. A meta-heuristic algorithm for solving this problem is developed. Computation of the objective function of this model is computationally expensive. The proxies to evaluate the moves in tabu search are embedded in this heuristic algorithm. The heuristic was tested with Solomon's 100-customer Euclidean vehicle routing problems with time windows but with the customer demands and vehicle capacity excluded. The test results revealed that problem difficulty was relevant not only to the number of customers but also to the average filling coefficients. A routing schedule with a lower value of the average filling coefficient is made to serve a scattering flock of customers.

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

00983301

English

p. 79-87

2004

Transportation Research Record

0309094755

Figures (5) ; References (23) ; Tables (1)

Algorithms; Heuristic methods; Mixed integer programming; Routing; Scheduling; Stochastic processes; Tabu search; Time windows; Travel demand; Vehicle capacity

Data and Information Technology; Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Dec 14 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
• COMPETITIVE PERFORMANCE ASSESSMENT OF DYNAMIC VEHICLE ROUTING TECHNOLOGIES USING SEQUENTIAL AUCTIONS
• 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