- Email: [email protected]
Location on a one-way rectilinear grid
Abstracts
in location analysis
283
of genetic algorithms for this problem is found to produce better mappings than other existing algorithms. However, the execution times of this class of algorithms are far from being competitive when compared to some of the local search heuristics. In this paper, we show that the primary advantage of genetic algorithms, viz. the generalized search operators, enables easy combinations of these global search algorithms with local search heuristics to provide an efficient hybrid algorithm for the mapping problem without compromising the solution quality. The hybrid genetic mapping heuristic performs well both in terms of the quality of the mappings produced and the time taken to obtain them.
Location on a one-way rectilinear grid
Zvi Drezner and George 0. Wesolowsky Journal of the Operational Research Society
Vol. 46, 1996, pp. 735-746 This paper considers two basic location problems - the Weber problem and the minimax problem on a regular grid of alternating one-way routes or streets. Both the facility to be located and the demand points are restricted to any point on the network. The one-way restriction is often used for efficiency in traffic flow, but complicates the distances in the system.
A multiobjective approach to design franchise outlet networks John R. Current and James E. Storbeck Journal of Operational Research Society
Vol. 45, 1994, pp. 71-81 The economic goals and the resulting locational objectives of a franchiser and its individual franchisees are frequently in conflict. For example, one goal of the franchiser is to maximize system-wide market coverage, while the corresponding goal of the franchisee is to maximize his or her individual market share. Consequently, the optimal facility siting scheme from one perspective may be suboptimal from the other. That is, the facility siting scheme which maximizes system-wide coverage will not necessarily maximize the market share of the individual franchises which make up the system. In this paper we introduce a multiobjective integer programming model to design franchise networks. The model selects franchise locations and identifies individual franchise market areas. Constraints in the formulation guarantee that all franchise locations are assigned at least a minimal threshold market area with sufficient demand to ensure economic survival. An underlying assumption of the model is that a rationing mechanism exists to assign demand to various franchise locations. Consequently, the model is most appropriate for service delivery franchises in which the franchiser can define and enforce exclusive franchise territories for the various franchise outlets. The purpose of this model is to generate alternative siting configurations which demonstrate the inherent trade-offs between the objectives of the franchiser and the individual franchises. Given these various location alternatives, it is expected that the franchiser will then evaluate them in terms of other criteria such as the likelihood of the individual franchisee’s success, pricing strategies for the various sites, total costs, total profit, and the effects of the response of competitors. Consequently, the proposed model should be viewed as an aid for one aspect of the decision process, i.e. the generation of alternative courses of action.
Is linear programming necessary for single facility location with maximin of rectilinear distance?
Gautam M. Appa and Ioannis Giannikos Journal of Operational Research Society
Vol. 45, 1994, pp. 97-107 This paper discusses the problem of locating a single obnoxious or undesirable facility so as to maximize its rectilinear distance from a given set of existing facilities. An outline of published linear
in location analysis
283
of genetic algorithms for this problem is found to produce better mappings than other existing algorithms. However, the execution times of this class of algorithms are far from being competitive when compared to some of the local search heuristics. In this paper, we show that the primary advantage of genetic algorithms, viz. the generalized search operators, enables easy combinations of these global search algorithms with local search heuristics to provide an efficient hybrid algorithm for the mapping problem without compromising the solution quality. The hybrid genetic mapping heuristic performs well both in terms of the quality of the mappings produced and the time taken to obtain them.
Location on a one-way rectilinear grid
Zvi Drezner and George 0. Wesolowsky Journal of the Operational Research Society
Vol. 46, 1996, pp. 735-746 This paper considers two basic location problems - the Weber problem and the minimax problem on a regular grid of alternating one-way routes or streets. Both the facility to be located and the demand points are restricted to any point on the network. The one-way restriction is often used for efficiency in traffic flow, but complicates the distances in the system.
A multiobjective approach to design franchise outlet networks John R. Current and James E. Storbeck Journal of Operational Research Society
Vol. 45, 1994, pp. 71-81 The economic goals and the resulting locational objectives of a franchiser and its individual franchisees are frequently in conflict. For example, one goal of the franchiser is to maximize system-wide market coverage, while the corresponding goal of the franchisee is to maximize his or her individual market share. Consequently, the optimal facility siting scheme from one perspective may be suboptimal from the other. That is, the facility siting scheme which maximizes system-wide coverage will not necessarily maximize the market share of the individual franchises which make up the system. In this paper we introduce a multiobjective integer programming model to design franchise networks. The model selects franchise locations and identifies individual franchise market areas. Constraints in the formulation guarantee that all franchise locations are assigned at least a minimal threshold market area with sufficient demand to ensure economic survival. An underlying assumption of the model is that a rationing mechanism exists to assign demand to various franchise locations. Consequently, the model is most appropriate for service delivery franchises in which the franchiser can define and enforce exclusive franchise territories for the various franchise outlets. The purpose of this model is to generate alternative siting configurations which demonstrate the inherent trade-offs between the objectives of the franchiser and the individual franchises. Given these various location alternatives, it is expected that the franchiser will then evaluate them in terms of other criteria such as the likelihood of the individual franchisee’s success, pricing strategies for the various sites, total costs, total profit, and the effects of the response of competitors. Consequently, the proposed model should be viewed as an aid for one aspect of the decision process, i.e. the generation of alternative courses of action.
Is linear programming necessary for single facility location with maximin of rectilinear distance?
Gautam M. Appa and Ioannis Giannikos Journal of Operational Research Society
Vol. 45, 1994, pp. 97-107 This paper discusses the problem of locating a single obnoxious or undesirable facility so as to maximize its rectilinear distance from a given set of existing facilities. An outline of published linear