The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

Mathematical and Computer Modelling

Volumn 41, Issue 8-9, 2005, Pages 1035-1053

  Chan, Yupo ^a   Baker, S F ^b  

^a University of Arkansas   (United States)

^b UNITED STATES AIR FORCE ACADEMY   (United States)

Author keywords

Clarke Wright heuristic; Combined facility location and routing; Minimum K tree; Minimum spanning forest; Multiple service frequency; Multiple traveling salesmen; Split delivery

Indexed keywords

CONTROL SYSTEM ANALYSIS; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

AERIAL NETWORKS; DELIVERY-LOGISTICS PROBLEMS; MULTIPLE TRAVELING SALESMAN FACILITY-LOCATION PROBLEM (MDMTSFLP); SERVICE-FREQUENCY REQUIREMENTS;

TRAVELING SALESMAN PROBLEM;

EID: 23744462309     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2003.08.011     Document Type: Article

References (39)

1. C. Barnhart, and R.R. Schneur Air network design for express shipment service 44 6 1996 852 863
2. A. Bruns Restructuring of Swiss parcel delivery services OR Spektrum 22 2 2000 285 302
3. R.W. Hall Pickup and delivery systems for overnight carriers Transportation Research 30A 3 1996 173 187
4. N.R. Achutan, L. Caccetta, and S. Hill A new sub-tour elimination constraint for the vehicle routing problem European Journal of Operational Research 91 1996 573 586
5. R.V. Kulkarni, and P.R. Bhave Integer programming formulations of vehicle routing problems European Journal of Operational Research 20 1985 58 67
6. G.R. Brodie, and C.D. Waters Integer linear programming formulation for vehicle routing problems European Journal of Operational Research 34 1988 403 404
7. M. Dror, and P. Trudeau Savings by split delivery routing Transportation Science 23 1989 141 145
8. C.-C. Lee, M. Epelman, C.C. White, and Y.A. Bozer A Shortest Path Approach to the Multiple-Vehicle Routing Problem 2001 Department of Industrial and Operations Engineering, University of Michigan New York
9. B.L. Golden, G. Laporte, and E.D. Taillard An adaptive memory heuristic for a class of vehicle routing problems with minmax objective Computers & Operations Research 24 5 1997 445 452
10. D.J. Bertsimas Traveling salesman facility location problems Transportation Science 23 3 1989 184 191
11. G. Laporte An exact algorithm for solving a capacitated location-routing problem Annals of Operations Research 6 1986 293 310
12. G. Laporte The vehicle routing problem: An overview of exact and approximate algorithms European Journal of Operational Research 59 1992 345 358
13. D. Kim, C. Barnhart, K. Ware, and G. Reinhardt Multimodal express package delivery: A service network design application Transportation Science 33 4 1999 391 407
14. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
15. E.J. Beltrami, and L.D. Bodin Networks and vehicle routing for municipal waste collection F.T. Boesch Large-Scale Networks: Theory and Design 1976 IEEE Press Ann Arbor, MI
16. B.L. Golden Implementing vehicle routing algorithms Networks 7 1977 113 148
17. D. Naddef A remark on 'integer linear programming formulation for a vehicle routing problem' by N.R. Achutan and L. Caccetta, or how to use the Clarke and Wright savings to write such integer linear programming formulations European Journal of Operational Research 75 1994 238 241
18. M.M. Syslo Discrete Optimization Algorithms with PASCAL Programming 1983 Prentice Hall New York
19. M. Held, and R.M. Karp The traveling-salesman problem and minimum spanning trees: Part II Mathematical Programming 1 1971 6 25
20. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1988 Wiley-Interscience Englewood Cliffs, NJ
21. M.L. Fisher Optimal solution of vehicle routing problems using minimum K-trees Operations Research 42 1994 626 642
22. M.L. Fisher A polynomial algorithm for the degree-constrained minimum K-tree problem Operations Research 42 1994 775 779
23. N.R. Achutan, and L. Caccetta Integer linear programming formulation for a vehicle routing problem European Journal of Operational Research 52 1991 86 89
24. M. Derochers, and G. Laport Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints Operations Research Letters 10 1991 27 36
25. E. Baker An exact algorithm for the time-constrained traveling salesman problem Operations Research 31 5 1983 938 945
26. F. Glover, and D. Klingman Note on admissible exchanges in spanning trees Advances in Management Studies 3.2 1984 101 104
27. Y. Chan, W.B. Carter, and M. Burnes A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands Computers & Operations Research 28 2001 803 826
28. C. Mandl Applied Network Optimization 1979 Academic Press New York
29. D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis Approximate algorithms for the traveling salesman problem Proc. 15th Ann. IEEE Symp. on Switching and Automata Theory 1974 33 42
30. B. Gillett, and L. Miller A heuristic algorithm for the vehicle dispatch problem Operations Research 22 1974 340 349
31. M.L. Fisher, and R. Jaikumar A generalized assignment heuristic for vehicle routing Networks 11 1981 109 124
32. R. Fourer, D.M. Gay, and B.W. Kernighan AMPL: A Modeling Language for Mathematical Programming 1993 Scientific Press New York
33. T.-H. Wu, C. Low, and J.-W. Bai Heuristic solutions to multi-depot location-routing problems Computers & Operations Research 29 2002 1393 1415
34. Y. Chan, and D. Merrill A probabilistic multiple-traveling-salesman- facility-location problem: asymptotic analysis using space-filling curve heuristic Military Operations Research 3 2 1997 37 53
35. J. Bramel, and D. Simchi-Levi The Logic of Logistics 1997 Springer-Verlag
36. L.M.A. Chan, and D. Simchi-Levi Probabilistic analyses and practical algorithms for multi-echelon distribution systems 1994 Department of Industrial Engineering and Operations Research, Columbia University New York
37. L.M.A. Chan, A. Federgruen, and D. Simchi-Levi Probabilistic analyses and practical algorithms for inventory routing models Operations Research 46 1 1998 96 106
38. M. Gendreau, G. Laporte, and G. Potvin Vehicle Routing: Modern Heuristics 1997 Wiley New York
39. S. Anily, and A. Federgruen Structured partitioning problems Operations Research 39 1991 130 149