This paper presents a new variant of the capacitated multi-source Weber problem that introduces fixed costs for opening facilities. Three types of fixed costs are considered and experimented upon. A guided constructive heuristic scheme based on the concept of restricted regions and a greedy randomized adaptive search procedure (GRASP) are proposed. The four known data sets in the literature, typically used for the uncapacitated multi-source Weber problem, are adapted by adding capacities and facility fixed costs and used as a platform to assess the performance of our proposed approaches. Computational results are provided and some research avenues highlighted
The capacitated multi-facility Weber problem is concerned with locating m facilities in the plane, a...
This is the author accepted manuscript. The final version is available from Elsevier via the DOI in ...
The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to min...
This paper presents a new variant of the capacitated multi-source Weber problem that introduces fixe...
The capacitated multi-source Weber problem entails finding both the locations of capacitated facilit...
A new type of constructive and adaptive heuristics is put forward to generate initial solutions for ...
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. Th...
This work considers the capacitated multi-facility Weber problem, which is concerned with locating m...
The main purpose of any facility location is to select the optimal places that satisfy project's goa...
The Multi-commodity Capacitated Multi-facility Weber Problem is concerned with locating I capacitate...
For solving the well-known multi-source Weber problem (MWP), each iteration of the heuristic alterna...
The continuous single-source capacitated multi-facility Weber problem (SSCMFWP) where setup cost of ...
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. Th...
Location-allocation problem (LAP) has attracted much attention in facility location field. The LAP i...
We present a branch-and-price algorithm for the exact solution of the multi-source Weber problem, a ...
The capacitated multi-facility Weber problem is concerned with locating m facilities in the plane, a...
This is the author accepted manuscript. The final version is available from Elsevier via the DOI in ...
The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to min...
This paper presents a new variant of the capacitated multi-source Weber problem that introduces fixe...
The capacitated multi-source Weber problem entails finding both the locations of capacitated facilit...
A new type of constructive and adaptive heuristics is put forward to generate initial solutions for ...
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. Th...
This work considers the capacitated multi-facility Weber problem, which is concerned with locating m...
The main purpose of any facility location is to select the optimal places that satisfy project's goa...
The Multi-commodity Capacitated Multi-facility Weber Problem is concerned with locating I capacitate...
For solving the well-known multi-source Weber problem (MWP), each iteration of the heuristic alterna...
The continuous single-source capacitated multi-facility Weber problem (SSCMFWP) where setup cost of ...
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. Th...
Location-allocation problem (LAP) has attracted much attention in facility location field. The LAP i...
We present a branch-and-price algorithm for the exact solution of the multi-source Weber problem, a ...
The capacitated multi-facility Weber problem is concerned with locating m facilities in the plane, a...
This is the author accepted manuscript. The final version is available from Elsevier via the DOI in ...
The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to min...