Goal-programming model of the stochastic vehicle-routing problem

Thesis/Dissertation · Wed Jan 01 04:00:00 EST 1986

OSTI ID:5909284

Zare-Mehrjerdi, Y

This research proposes a Goal Programming (GP) model of the Stochastic Vehicle Routing Problem (SVRP). The SVRP examined considers the multiple-vehicle, single-depot-node routing problem in which customer demand and travel and unload times are random variables having known distribution functions. The problem formulation of the SVRP is divided into two major stages which are referred to as Route Construction Stage (RCS) and Route Improvement Stage (RIS). The RCS of the SVRP is required in order to partition a set of stations into feasible sets of routes, one for each vehicle, using an appropriate heuristic approach. The RIS of the problem is required in order to sequence the stations on each vehicle route to meet the customer's and decision maker's requirements by applying a GP method. Two problems discuss the GP formulation of the RIS, which is used for improving the arrangement of stations on each vehicle route based on the customer's and decision maker's criteria. The formulation of the RCS of the problem is divided into two sections according to the type of criteria that is to be minimized. A substantial improvement in the results of the SVRP can be obtained by integrating the customer's and decision maker's requirements with the SVRP in order to determine the final arrangement of stations for each vehicle route.

• Research Organization: Oklahoma State Univ., Stillwater (USA)
• OSTI ID: 5909284
• Country of Publication: United States
• Language: English

Related Subjects

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION
320203* -- Energy Conservation
Consumption
& Utilization-- Transportation-- Land & Roadway
CONTROL
DECISION MAKING
DEMAND FACTORS
EFFICIENCY
ROUTING
STOCHASTIC PROCESSES
TRAFFIC CONTROL
TRANSPORTATION SECTOR
TRAVEL
VEHICLES