Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem

Operations Research

Volumn 48, Issue 3, 2000, Pages 444-460

  Brimberg, J ^a   Hansen, P ^a   Mladenovic N ^a   Taillard, E D ^a  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; DECISION THEORY; HEURISTIC METHODS; INDUSTRIAL PLANTS; OPERATIONS RESEARCH; RESOURCE ALLOCATION;

TOTAL TRANSPORTATION COST; UNCAPACITATED MULTISOURCE WEBER PROBLEM;

OPTIMIZATION;

EID: 0034179704     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.3.444.12431     Document Type: Article

References (57)

1. Local optima avoidance in depot location
2. Identification of transshipment center locations
3. A new adaptive multi-start technique for combinatorial global optimizations
4. p norm location-allocation problems
5. Accelerating convergence in the Fermat-Weber location problem
6. p distances
7. Solving the continuous location-allocation problem with Tabu search
8. A variable neighbourhood algorithm for solving the continuous location-allocation problem
9. Degeneracy in the multi-source Weber problem
10. Non-linear optimization as a sequence of least p-th optimization with finite values of p
11. Solution of minisum and minimax location-allocation problems with Euclidean distances
12. Solution of the multisource Weber and conditional Weber problems by d.-c. programming
13. Location-allocation problems
14. Heuristic methods for location-allocation problems
15. Solutions of generalized locational equilibrium models
16. The planar two-center and two-median problems
17. A note on the Weber location problem
18. Solving a large scale districting problem: A case report
19. p distance minisum location model in continuous space
20. The Traveling Salesman Problem with backhauls
21. Tabu search. Part I
22. Tabu search. Part II
23. Tabu search
24. A comparison of two dual-based procedures for solving the p-Median problem
25. Algorithms for the maximum satisfiability problem
26. An introduction to variable neighborhood search
27. Heuristic solution of the multisource Weber problem as a p-Median problem
28. A column generation algorithm for the multisource Weber problem
29. Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
30. Extensions du problème de Weber
31. Exact and approximate solutions to the multisource Weber problem
32. A note on Fermat's problem
33. Properties and solution methods for large location-allocation problems
34. A computational procedure for the exact solution of location-allocation problems with rectangular distances
35. On the complexity of some common geometric location problems
36. Stabilization dans le cadre de la génération de colonnes
37. A variable neighbourhood algorithm-A new metaheuristic for combinatorial optimization
38. A descent-ascent technique for solving the multisource Weber problem
39. Variable neighbourhood search
40. Heuristic cluster algorithm for multiple facility location-allocation problem. RAIRO
41. An efficient method for the multi-depot location-allocation problem
42. TWAIN-Exact solutions to the two source location-allocation problem
43. MULTI-Exact solutions to the M-center location-allocation problem
44. An efficient algorithm for solving the two center location-allocation problem
45. TSLIB-A traveling salesman library
46. An efficient Tabu search procedure for the p-median problem
47. Computational comparison of two algorithms for the Euclidean single facility location problem
48. An optimal method for solving the (generalized) multi-Weber problem
49. Location-allocation systems: A review
50. A flexible user oriented location-allocation algorithm
51. Heuristic methods for estimating the generalized vertex median of a weighted graph
52. A fast algorithm for the greedy-interchange for large-scale clustering and median location problems