Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
On the conditional p-median problem
Computers and Operations Research
A Bionomic Approach to the Capacitated p-Median Problem
Journal of Heuristics
Optimizing Army Base Realignment and Closure
Interfaces
Computers and Operations Research
Optimizing the size and locations of facilities in competitive multi-site service systems
Computers and Operations Research
Computers and Operations Research
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics
Transportation Science
Survey: Facility location dynamics: An overview of classifications and applications
Computers and Industrial Engineering
Hi-index | 0.01 |
In this paper, we study a budget constrained location problem in which we simultaneously consider opening some new facilities and closing some existing facilities. Motivations for this problem stem from applications where, due to a change in the distribution of customer demand, the existing facility system no longer provides adequate service. The objective is to minimize the total weighted travel distance for customers subject to a constraint on the budget for opening and/or closing facilities and a constraint on the total number of open facilities desired. For this problem, we develop a mathematical programming model and examine its theoretical properties. We then develop three heuristic algorithms (greedy interchange, tabu search and Lagrangian relaxation approximation) for this NP-hard problem. Computational testing of these algorithms includes an analysis of the sensitivity of the solution to the budget and the desired number of facilities. The intended application in this testing is that of locating/relocating bank branches in a large-size town such as in our data set from Amherst, New York. We also discuss the situation where operating costs are part of the objective function.