NP-Hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands
Mathematics of Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Modern heuristic techniques for combinatorial problems
Discrete Applied Mathematics - Special volume: viewpoints on optimization
A projection method for lp norm location-allocation problems
Mathematical Programming: Series A and B
Algorithmic approaches for solving the euclidean distance location and location-allocation problems
Algorithmic approaches for solving the euclidean distance location and location-allocation problems
Region-rejection based heuristics for the capacitated multi-source Weber problem
Computers and Operations Research
Computers and Operations Research
Single-Source Capacitated Multi-Facility Weber Problem-An iterative two phase heuristic algorithm
Computers and Operations Research
Heuristic solution of the multisource Weber problem as a p-median problem
Operations Research Letters
| Hi-index | 0.00 |
The Single Source Capacitated Multi-facility Weber Problem (SSCMWP) is concerned with locating I capacitated facilities in the plane to satisfy the demand of J customers with the minimum total transportation cost of a single commodity such that each customer satisfies all its demand from exactly one facility. The SSCMWP is a non-convex optimization problem and difficult to solve. In the SSCMWP, customer locations, customer demands and facility capacities are known a priori. The transportation costs are proportional to the distance between customers and facilities. We consider both the Euclidean and rectilinear distance cases of the SSCMWP. We first present an Alternate Location and Allocation type heuristic and its extension by embedding a Very Large Scale Neighborhood search procedure. Then we apply a Discrete Approximation approach and propose both lower and upper bounding procedures for the SSCWMP using a Lagrangean Relaxation scheme. The proposed heuristics are compared with the solution approaches from the literature. According to extensive computational experiments on standard and randomly generated test sets, we can say that they yield promising performance.