Name
Abstract | ||
|---|---|---|
The primary purpose of this paper is to validate a clustering procedure used to construct contiguous vehicle routing zones (VRZs) in metropolitan regions. Given a set of customers with random demand for pickups and deliveries over the day, the goal of the design problem is to cluster the customers into zones that can be serviced by a single vehicle. Monte Carlo simulation is used to determine the feasibility of the zones with respect to package count and tour time. For each replication, a separate probabilistic traveling salesman problem (TSP) is solved for each zone. For the case where deliveries must precede pickups, a heuristic approach to the TSP is developed and evaluated, also using Monte Carlo simulation. In the testing, performance is measured by overall travel costs and the probability of constraint violations. Gaps in tour length, tour time and tour cost are the measure used when comparing exact and heuristic TSP solutions. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ejor.2010.01.045 | European Journal of Operational Research |
Keywords | Field | DocType |
Vehicle routing zones,Monte Carlo simulation,Traveling salesman problem,Clustering analysis,Pickup and delivery operations | Probabilistic traveling salesman problem,Mathematical optimization,Monte Carlo method,Vehicle routing problem,Heuristic,Reverse logistics,Random demand,Travelling salesman problem,Cluster analysis,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
206 | 1 | 0377-2217 |
Citations | PageRank | References |
7 | 0.50 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan F. Bard | 1 | 1428 | 144.29 |
| Ahmad I. Jarrah | 2 | 55 | 4.47 |
| Jing Zan | 3 | 7 | 0.50 |