Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem

Computers and Operations Research

Volumn 39, Issue 2, 2012, Pages 225-237

  Akyüz, M Hakan ^a   Öncan, Temel ^a   Altnel, I Kuban ^b  

^a GALATASARAY UNIVERSITY   (Turkey)

^b BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Heuristics; Location allocation; Multi commodity transportation problem

Indexed keywords

ALLOCATION PROBLEMS; APPROXIMATE SOLUTION; CAPACITY CONSTRAINTS; COMPUTATIONAL RESULTS; DISCRETE APPROXIMATION; EFFICIENT STRATEGY; HEURISTICS; LOCATION-ALLOCATION; MULTI-COMMODITY; NONCONVEX OPTIMIZATION PROBLEM; TRANSPORTATION COST; TRANSPORTATION PROBLEM; WEBER PROBLEM;

CUSTOMER SATISFACTION; TRANSPORTATION;

SALES;

EID: 79958180098     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.03.015     Document Type: Article

References (43)

1. M.H. Akyüz, T. Öncan, and K. Altnel The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals IIE Trans 42 12 2010 825 841
2. M.H. Akyüz, T. Öncan, and K Altnel Efficient lower and upper bounds for the multi-commodity capacitated multi-facility Weber problem with rectilinear distances S. Voss, J. Pahl, S. Schwarse, Logistik management - systeme methoden integration 2009 Springer-Verlag Berlin, Heidelberg 229 245
3. Akyüz MH, Öncan T, Altnel K. The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals. In: Ao SI, Castillo O, Douglas C, Dagan Feng D, Lee J-A, editors. Proceedings of the international multiconference of engineers and computer scientists, IMECS 2009, vol. II, Hong Kong, March 1820, 2009. Lecture notes in engineering and computer science.
4. Al-Loughani L. Algorithmic approaches for solving the Euclidean distance locationallocation problems. PhD thesis, Virginia Polytechnic Institute and State University, USA; 1997.
5. E. Alpaydin, K. Altnel, and N. Aras Parametric distance functions vs. nonparametric neural networks for estimating road travel distances Eur J Oper Res 93 2 1996 230 243 (Pubitemid 126389280)
6. K. Altnel, N. Aras, and B.J. Oommen Fast efficient and accurate solutions to the Hamiltonian path problem using neural approaches Comput Oper Res 27 5 2000 461 494 (Pubitemid 30174870)
7. N. Aras,.K. Altnel, and M. Orbay New heuristic methods for the capacitated multi-facility Weber problem Nav Res Log 54 1 2007 21 32 (Pubitemid 46191312)
8. N. Aras, M. Orbay, and.K. Altnel Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem J Oper Res Soc 59 1 2008 64 79 (Pubitemid 350261774)
9. M.S. Bazaraa, J.J. Jarvis, and H.D. Sherali Linear programming and network flows 4th ed. 2010 Wiley New York
10. M.L. Brandeau, and S.S. Chiu Sequential location and allocation: worst case performance and statistical estimation Location Sci 1 4 1993 289 298 (Pubitemid 24390379)
11. p distances Oper Res 41 6 1993 1153 1163
12. J. Brimberg, R. Chen, and D. Chen Accelerating convergence in the FermatWeber location problem Oper Res 22 1998 151 157 (Pubitemid 128676373)
13. p norm: some empirical results J Transp Geogr 15 1 2007 62 72 (Pubitemid 44896959)
14. L. Cooper Heuristic methods for locationallocation problems SIAM Rev 6 1 1964 37 53
15. L. Cooper The transportation-location problem Oper Res 20 1 1972 94 108
16. U. Derigs Using confidence limits for the global optimum in combinatorial optimization Oper Res 33 5 1985 1024 1049 (Pubitemid 15589838)
17. R.A. Fisher, and L.H.C. Tippett Limiting forms of the frequency distribution of the largest or smallest member of a sample Proceedings of the Cambridge Philosophical Society 24 1928 180 190
18. p distance minisum location model in continuous space Location Sci 2 1994 111 117
19. M.D.H. Gamal, and S. Salhi A cellular heuristic for the multi-source Weber problem Comput Oper Res 30 2003 1609 1624 (Pubitemid 36704975)
20. B.L. Golden A statistical approach to the TSP Networks 7 3 1977 209 225
21. B.L. Golden Point estimation of a global optimum for large combinatorial problems Commun Stat. Simul. C 7 4 1978 361 367
22. B.L. Golden, and F.B. Alt Interval estimation of a global optimum for large combinatorial problems Nav Res Log Q 26 1 1979 69 77
23. P. Hansen, N. Mladenović, and É. Taillard Heuristic solution of the multisource Weber problem as a p-median problem Oper Res Lett 22 23 1998 55 62 (Pubitemid 128458158)
24. P. Hansen, J. Perreur, and F. Thisse Location theory, dominance and convexity: some further results Oper Res 28 5 1980 1241 1250 (Pubitemid 11450957)
25. M. Held, P. Wolfe, and H.P. Crowder Validation of subgradient optimization Math Program 6 1974 62 88
26. H. Idrissi, P. Loridan, and C. Michelot Approximation of solutions for location problems J Optim Theory Appl 56 1988 127 143
27. D. Klingman, A. Napier, and J. Stutz NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost flow problems Manage Sci 20 1974 814 821
28. P.P. Korovkin Inequalities 1986 Mir Publishers USSR
29. M. Luis, S. Salhi, and G. Nagy Region-rejection based heuristics for the capacitated multi-source Weber problem Comput Oper Res 36 2009 2007 2017
30. S. Martello, and P. Toth Knapsack problems: algorithms and computer implementations 1990 Wiley New York
31. Selim S. Biconvex programming and deterministic and stochastic location allocation problems. PhD dissertation, Georgia Institute of Technology, USA; 1979.
32. H.D. Sherali, and W.P. Adams A reformulation-linearization technique for solving discrete and continuous nonconvex problems 1999 Kluwer Academic Publishers Netherlands
33. p distance multifacility locationallocation problem Oper Res 50 3 2002 433 448
34. H.D. Sherali, and F.L. Nordai NP-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands Math Oper Res 13 1 1988 32 49
35. H.D. Sherali, S. Ramachandran, and S.I. Kim A localization and reformulation discrete programming approach for the rectilinear distance locationallocation problems Discrete Appl Math 49 13 1994 357 378
36. H.D. Sherali, and C.H. Tunçbilek A squared-Euclidean distance locationallocation problem Nav Res Log 39 4 1992 447 469
37. J.F. Thisse, J.E. Ward, and R.E. Wendell Some properties of location problems with block and round norms Oper Res 32 6 1984 1309 1327 (Pubitemid 15457471)
38. J.E. Ward, and R.E. Wendell A new norm for measuring distance which yields linear location problems Oper Res 28 3 1980 836 844
39. J.E. Ward, and R.E. Wendell Using block norms for location modeling Oper Res 33 5 1985 1074 1090
40. E. Weiszfeld Sur le point lequel la somme des distances de n points donné est minimum Tohoku Math J 43 1937 355 386
41. R.E. Wendell, and A.P. Hurter Location theory, dominance and convexity Oper Res 21 1 1973 314 320
42. A.D. Wilson, R.E. King, and J.R. Wilson Case study on statistically estimating the minimum makespan for flow line scheduling problems Eur J Oper Res 155 2 2004 439 454
43. Witzgall C. Optimal location of central facility: mathematical models and concepts. National Bureau of Standards, Report no. 8388; 1964.