| Summary: | 碩士 === 國防管理學院 === 資源管理研究所 === 88 === This paper examines a generation of the vehicle routing problem(VRP) in which stochastic demand is considered. A stochastic vehicle routing problem(SVRP) differs from the well known VRP in that the actual customer demand is uncertain when the vehicle routes are designed.
The design of most general distribution systems usually involves assigning permanent customer routes.In reality,a percentage of customers may not require a delivery in a particular day.
In this paper,two alternative ways are proposed to deal with zero demand customers:(1) fixed routes altenative;(2) semi-fixed routes alternative.By applying the classical Clarke and Wright savings algorithm,a fixed set of routes are generated.By dropping zero demand locations from the fixed routes,a set of semi-fixed routes are generated.
The purpose of this paper is to propose a solution methodology to handle the vehicle routing problem with uncertain demands. There are mainly two goals : (1) Compare the two alternative ways , we will see their advantages and disadvantages ; (2) By implementing an experiment , to show the sensitivity of the proposed solution methodology to various realistic routing situations , and to observe the situation of route failure and the decisions distribution of the two alternatives.
|
|---|
