ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01842.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTThe maximal covering location problem is based on locatingpfacilities in such a manner that coverage is maximized within set distance or time standards. This problem has been extended in a number of different ways where the main theme still involves locating a fixed number of facilities. In many applications site costs are not equal; this should cast doubt on the use of a constraint that fixes the number of facilities at a given number as compared to an approach that minimizes site costs and maximizes coverage. This paper addresses the use of site costs in a maximal covering location problem and presents several approaches to solutions, along with computational results. Theoretical linkages to other location models are also presented.

ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01843.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTA probabilistic fire‐protection siting model is described that places capacitated stations, engine companies, and truck companies in such a way that the population or calls covered by an engineanda truck with a joint reliability of at least α is maximized. Probabilistic constraints are developed and numerical equivalents are found for the probability requirement for proximate server presence. The multiple co‐location of servers at stations and the use of stations with a limited capacity are also investigated. Structures are utilized that preserve the integer properties when the model is solved by linear programming relaxa

ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01844.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTDracunculiasis (Guinea Worm Disease) is a parasitic disease that is endemic to 18 African and 2 Asian countries. It has a marked potential for eradication through a combination of water supply management, health education, and controlled medical intervention. These intervention methods require the development of water wells and establishment of schools. Each has a different cost, a different success rate for eradication of the disease, and a different distance that people are willing and able to travel in order to utilize the facility.In this paper a weighted maximal covering model is developed to determine the best locations, given a limited budget, for the different types of facilities used to fight the disease. The model is developed and demonstrated using data from a single province within one country, the Zou Province of Benin.

ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01845.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTThis paper investigates the optimality properties of interdependent spatial markets in a situation of price‐location competition. A framework is developed where interdependences on the demand side of the economy are fully accounted for. It is assumed that goods supplied in the economy are not independent in terms of consumption. In addition, consumers can capture economies of scope in travel by shopping for several goods on one trip. Two goods are available in addition to a composite product. The problem involves two non‐cooperative firms that exhibit a Nash behavior in selling their single product to a population uniformly distributed around a circumference. The level of interdependence between markets is expressed by the transportation rate, and by two other parameters indicating the relations of complementarity/substitutability among goods. A numerical analysis of comparative statics is conducted to examine the role of these parameters on firms’ optimal location and price configura

ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01846.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTA hierarchical mathematical programming approach is combined with sensitivity analysis (of variational inequalities) to formulate a facility‐location model for a firm competing on a discrete network. It is assumed that the locating firm will act as the leader firm in an industry characterized by Stackelberg leader‐follower(s) oligopolistic competition. The otherncompetitors in this industry are assumed to act as Cournot firms that each operate under the Coumoi assumption of zero conjectural variation with respect to theirn–1 Cournot competitors. It is further assumed that thenCournot firms will react to the location/production/shipping activities of the Stackelberg firm. Therefore, when the Stackelberg firm makes its location, production, and shipping decisions it takes into account the reaction of thenCournot firms to its (the Stackelberg firm's) integrated location and distribution decisions. Specifically, a Cournot reaction function is developed and imbedded in the Stackelberg firm's profit‐maximizing objective function to project the anticipated reaction of the Cournot firms to the Stackelberg firm's location d

ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01847.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTIn thep‐hub location model, it is usual to ignore the fixed costs of opening facilities. In contrast, the simple plant location problem includes fixed facility costs and thereby makes thenumberof facilities one of the decision variables. This paper introduces fixed facility costs into a hub location model, thereby making the number of hubs a decision variable. As an initial effort toward solving the hub model with fixed costs, a two‐step procedure is devised.Step 1involves an estimate of a good upper bound on the solution, using heuristics.Step 2involves the computation of a tight lower bound on the solution; as a by‐product, an improvement of the best solution from Step 1 may be found. Computational results are discussed for sample pro

ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01848.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTThe Teitz and Bart (1968) vertex substitution heuristic is more robust than competing algorithms and yields solutions with properties that are necessary, but not sufficient, for a global optimum solution. All documented implementations of this algorithm, however, use a naive spatial search procedure, whereas a more informed spatial search procedure, requiring considerably less computation to solve any given problem, is possible. An algorithm incorporating this new search procedure, called the global/regional interchange algorithm, is described. As problem size increases, proportionally larger reductions in processing costs occur.

ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01849.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTRosing has recently demonstrated a new method for obtaining optimal solutions to the (Generalized) Multi‐Weber Problem and proved the optimally of the results. The method develops all convex hulls and then covers the destinations with disjoint convex hulls. This paper seeks to improve implementation of the algorithm to make such solutions economically attractive. Four areas are considered: sharper decision rules to eliminate unnecessary searching, bit pattern matching as a method of recording a history and eliminating duplication, vector intrinsic functions to speed up comparisons, and profiling a program to maximize operating efficiency. Computational experience is also presente

ISSN:1056-8190    

DOI:10.1111/j.1435-5597.1992.tb01850.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY