A Solution Approach from an Analytic Model to Heuristic Algorithm for Special Case of Vehicle Routing Problem with Stochastic Demands
We define a special case for the vehicle routing problem with stochastic demands (SC-VRPSD) where customer demands are normally distributed. We propose a new linear model for computing the expected length of a tour in SC-VRPSD. The proposed model is based on the integration of the “Traveling Salesma...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2008-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2008/571414 |
| Summary: | We define a special case for the vehicle routing problem with stochastic
demands (SC-VRPSD) where customer demands are normally distributed. We propose a new
linear model for computing the expected length of a tour in SC-VRPSD. The proposed model
is based on the integration of the “Traveling Salesman Problem” (TSP) and the Assignment Problem. For large-scale problems, we also use an Iterated Local Search (ILS) algorithm in order to reach an effective solution. |
|---|---|
| ISSN: | 1024-123X 1563-5147 |