Variable Neighborhood Decomposition Search
Journal of Heuristics
Capacitated facility location problem with general setup cost
Computers and Operations Research
A hybrid algorithm for capacitated plant location problem
Expert Systems with Applications: An International Journal
The multi-depot capacitated location-routing problem with fuzzy travel times
Expert Systems with Applications: An International Journal
Survey: Covering problems in facility location: A review
Computers and Industrial Engineering
A tabu search heuristic procedure for the capacitated facility location problem
Journal of Heuristics
A new heuristic for solving the p-median problem in the plane
Computers and Operations Research
| Hi-index | 12.05 |
Facility location problems with the objective to minimize the sum of the setup cost and transportation cost are studied in this paper. The setup and transportation costs are considered as a function of the number of opened facilities. Three methods are introduced to solve the problem. The facility location model with bounds for the number of opened facility is constructed in this work. The relationship between setup cost and transportation cost is studied and used to build these methods based on greedy algorithm, p-median algorithm and p-center algorithm. The performance of the constructed methods is tested using 100 random data sets. In addition, the networks representing the road transportation system of Chiang Mai city and 5 provinces in Northern Thailand are illustrated and tested using all presented methods. Simulation results show that the method developed from greedy algorithm is suitable for solving problems when the setup cost is higher than transportation cost while the opposite cases are more efficiently solved with the method developed by the p-median problem.