Validating vehicle routing zone construction using Monte Carlo simulation

European Journal of Operational Research

Volumn 206, Issue 1, 2010, Pages 73-85

  Bard, Jonathan F ^a   Jarrah, Ahmad I ^b   Zan, Jing ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

Clustering analysis; Monte Carlo simulation; Pickup and delivery operations; Traveling salesman problem; Vehicle routing zones

Indexed keywords

ANNUAL SAVINGS; CLUSTERING ANALYSIS; CLUSTERING PROCEDURE; CONSTRAINT VIOLATION; DESIGN PROBLEMS; HEURISTIC APPROACH; MONTE CARLO SIMULATION; PICKUP AND DELIVERY; PICKUP AND DELIVERY OPERATIONS; PITTSBURGH; PROBABILISTIC TRAVELING SALESMAN PROBLEM; RANDOM DEMAND; RUNTIMES; SET OF CUSTOMERS; SIMULATION RESULT; TRAVEL COSTS;

CLUSTER ANALYSIS; COMPUTER SIMULATION; COSMIC RAY DETECTORS; MONTE CARLO METHODS; PROBLEM SOLVING; VEHICLES;

TRAVELING SALESMAN PROBLEM;

EID: 77950023576     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.01.045     Document Type: Article

References (25)

1. Applegate D., Bixby R.E., Chvátal E., and Cook W. The Traveling Salesman Problem: A Computational Study (2006), Princeton University Press, Princeton, NJ
2. Bard J.F., and Jarrah A.I. Large-scale constrained clustering for rationalizing pickup and delivery operations. Transportation Research Part B 43 5 (2009) 542-561
3. Baudin M. Lean Logistics: The Nuts and Bolts of Delivering Materials and Goods (2004), Productivity Press, New York
4. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science 39 1 (2005) 104-118
5. Chao I.M., Golden B.L., and Wasil E.A. A new heuristic for the period traveling salesman problem. Computers & Operations Research 22 5 (1995) 553-565
6. Chiou Y.C., and Lan L.W. Genetic clustering algorithms. European Journal of Operational Research 135 2 (2001) 413-427
7. Daganzo C.F., and Erera A. On planning and design of logistics systems for uncertain environments. In: Speranza M.G., and Stahly P. (Eds). New Trends in Distribution Logistics. Lecture Notes in Economics and Mathematical Systems vol. 480 (1999), Springer-Verlag, Berlin
8. Drexl A., and Haase K. Fast approximation methods for sales force deployment. Management Science 45 10 (1999) 1307-1323
9. Hall R. Pickup and delivery systems for overnight carriers. Transportation Research Part A 30 3 (1996) 173-187
10. Hartigan J.A., and Wong M.A. A K-means clustering algorithm. Applied Statistics 28 1 (1979) 100-108
11. Hemmelmayr V.C., Doerner K.F., and Hartl R.F. A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research 195 3 (2009) 791-802
12. Liu Y.H. A hybrid scatter search for the probabilistic traveling salesman problem. Computers & Operations Research 34 10 (2007) 2949-2963
13. Lorena L.A.N., and Senne E.L.F. A column generation approach for the capacitated p-median problems. Computers & Operations Research 31 6 (2004) 863-876
14. Mourgaya M., and Vanderbeck F. Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research 183 3 (2007) 1028-1041
15. Negreiros M., and Palhano A. The capacitated centred clustering problem. Computers & Operations Research 33 6 (2006) 1639-1663
16. Newell G.F., and Daganzo C.F. Design of multiple-vehicle delivery tours-I: A ring-radial network. Transportation Research Part B 20 5 (1986) 345-363
17. Ouyang Y. Design of vehicle routing zones for large-scale distribution systems. Transportation Research Part B 41 10 (2007) 1079-1093
18. Ríos-Mercado R.Z., and Fernández E. A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Computers & Operations Research 36 3 (2009) 755-776
19. Ropke S., and Pisinger D. A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research 171 3 (2006) 750-775
20. Salhi S., and Nagy G. A Cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society 50 10 (1999) 1034-1042
21. Tang H., and Hooks E.M. Algorithms for a stochastic selective travelling salesperson problem. Journal of the Operational Research Society 56 4 (2005) 439-452
22. Taylor G.D., Whicker G.L., and Usher J.S. Multi-zone dispatching in truckload trucking. Transportation Research Part E 37 5 (2001) 375-390
23. Toth P., and Vigo D. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. European Journal of Operational Research 113 3 (1999) 528-543
24. Yockey R.D. SPSS Demystified: A Step-by-Step Guide to Successful Data Analysis (2007), Prentice-Hall, Upper Saddle River, NJ
25. Zan, J., 2008. Using Monte Carlo simulation to analyze and validate heuristically determined vehicle routing zones. Thesis, Graduate Program in Operations Research and Industrial Engineering, The University of Texas, Austin, TX.