Journal ArticleDOI
On the Extent to Which Certain Fixed-Charge Depot Location Problems Can be Solved by LP
TLDR
Computational results are reported to show that linear programming often produces integer solutions to uncapacitated problems as required, and it is suggested that this represents a practical solution approach.Abstract:
This paper considers a class of feasible set fixed-charge depot location problems which have been formulated as mixed-integer programmes. Computational results are reported to show that linear programming often produces integer solutions to uncapa- citated problems as required. It is suggested that this represents a practical solution approach. Computational evidence suggests this convenient property does not extend to capacitated problems. Discussion of reducing infinite set problems to such feasible set problems is included. This paper considers depot location-demand allocation problems where loca- tions are to be chosen from a finite set of candidate sites. This corresponds to the "feasible set approach", discussed by Rand.' The objective is to locate depots so that all customer demand is allocated among the depots while minimizing the sum of variable and fixed depot costs associated with satisfy- ing that demand. Demand is assumed known in each of a number of customer zones. The modelling intent is to answer the four fundamental questions listed by Rand as: How many depots should there be? Where should they be? Which customers should they serve? How big should they be? A mixed integer programming model-sometimes called the fixed-charge plant loca- tion model is used for which efficient special purpose algorithms exist (see Elshafei2 and Geoffrion and Graves3). However, it is a nontrivial task to develop the necessary computer programs. The purpose of this paper is to provide computational results which indicate that ordinary linear program- ming typically produces integer solutions to uncapacitated problems. It is suggested that this represents a practical solution approach if the problem size is not too large, but computational results show that this approach seems inappropriate for capacitated problems. Discussion of reducing certain infinite set problems to feasible set problems is presented in an Appendix.read more
Citations
More filters
Journal ArticleDOI
Location analysis: A synthesis and survey
Charles ReVelle,Horst A. Eiselt +1 more
TL;DR: The many facets of this exciting and centrally placed field of facility siting are reviewed through reference to both seminal works and current reviews.
Journal ArticleDOI
The simple plant location problem: Survey and synthesis
Jakob Krarup,Peter Pruzan +1 more
TL;DR: In this paper, the authors consider a family of discrete, deterministic, single-criterion, NP-hard problems, including set packing, set covering, and set partitioning.
Journal ArticleDOI
Simultaneous siting and routing in the disposal of hazardous wastes
TL;DR: Methods of shortest paths, a zero-one mathematical program for siting, and the weighting method of multiobjective programming are blended to show how to derive optimal solutions to the development of a model which simultaneously sites the storage facilities, assigns reactors to those facilities and chooses routes for the shipment of the spent fuel.
Journal ArticleDOI
The Plant Location Problem: New Models and Research Prospects
Charles ReVelle,Gilbert Laporte +1 more
TL;DR: New statements of the plant location problem are described with new and different objectives, with multiple products and multiple machines in which new models of production are considered, and with spatial interactions.
Journal ArticleDOI
Heuristic concentration: Two stage solution construction
K.E. Rosing,Charles ReVelle +1 more
TL;DR: In this paper, a two-stage approach to combinatorial optimization is demonstrated in the context of the p-median problem, where the first layer is a conventional heuristic and the second is a heuristic or exact procedure which draws on the concentrated solution set generated by the initial heuristic.
References
More filters
Book ChapterDOI
Multicommodity Distribution System Design by Benders Decomposition
Arthur M. Geoffrion,G. W. Graves +1 more
TL;DR: In this paper, a multicommodity capacitated single-period version of the problem is formulated as a mixed integer linear program, and a solution technique based on Benders Decomposition is developed, implemented, and successfully applied to a real problem for a major food firm with 17 commodity classes, 14 plants, 45 possible distribution center sites, and 121 customer zones.
Journal ArticleDOI
Integer Programming: Methods, Uses, Computations
TL;DR: This paper attempts to present the major methods, successful or interesting uses, and computational experience relating to integer or discrete programming problems, as well as some special purpose algorithms for use on highly structured problems.
Journal ArticleDOI
A Branch-Bound Algorithm for Plant Location
M. A. Efroymson,T. L. Ray +1 more
TL;DR: An integer-programming method for solving a special class of discrete programming problems called plant location is discussed, which has been successfully used to solve "practical" location problems with upwards of fifty plants.
Journal ArticleDOI
An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
Umit Akinc,Basheer M. Khumawala +1 more
TL;DR: In this paper, an efficient branch-and-bound solution procedure for the warehouse location problem in which limitations on the amount of goods which can be handled are also imposed is described. But the proposed method is made efficient by developing dominance, lower and upper bounding procedures and branch and node selection rules utilizing the special structure of this problem.