Name
Abstract | ||
|---|---|---|
We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can be made. Our solution method embeds a branch-and-cut scheme within a Monte Carlo sampling-based procedure. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1287/trsc.37.1.69.12820 | Transportation Science |
Keywords | Field | DocType |
stochastic vehicle,alternative objective function,solution method,random travel times,simpler model,monte carlo sampling-based procedure,optimal objective function value,stochastic vehicle routing,branch-and-cut scheme,random travel,service time,algorithms,stochastic processes,monte carlo method,vehicle routing,networks | Mathematical optimization,Monte Carlo method,Vehicle routing problem,Computer simulation,Road traffic,Stochastic process,Travelling salesman problem,Stochastic modelling,Fleet management,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
37 | 1 | 0041-1655 |
Citations | PageRank | References |
89 | 2.84 | 22 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Astrid S. Kenyon | 1 | 92 | 6.09 |
| David P. Morton | 2 | 562 | 50.03 |