Author
George O. Wesolowsky
Bio: George O. Wesolowsky is an academic researcher from McMaster University. The author has contributed to research in topics: Facility location problem & 1-center problem. The author has an hindex of 32, co-authored 92 publications receiving 3246 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, a dynamic or multi-period location-allocation formulation is developed from the static problem of locating G facilities among M possible sites to serve N demand points, and a dynamic model provides a tool for analyzing tradeoffs among present values of static distribution costs in each period and costs of relocating facilities.
Abstract: A dynamic or multiperiod location-allocation formulation is developed from the static problem of locating G facilities among M possible sites to serve N demand points This dynamic model provides a tool for analyzing tradeoffs among present values of static distribution costs in each period and costs of relocating facilities The objective is to specify the plan for facility locations and relocations and for attendant allocations of demands which minimize these costs Two methods of solution are presented First, a mixed-integer programming approach is used to solve sample problems From computational results reported for structurally-similar problems, it seems that efficient general purpose codes for this method would be capable of solving problems with at least 5 periods, 5 potential sites, and 15 demand points The second method, dynamic programming, is capable of increasing the size of problems that are computationally feasible The dynamic programming approach is quite attractive when the relative va
205 citations
TL;DR: An algorithm is developed to optimize the sequence of locations in order to meet changes in costs, volumes and locations of destinations to extend the static single facility location problem to a model that permits location changes within a planning horizon of r periods.
Abstract: This paper extends the static single facility location problem to a model that permits location changes within a planning horizon of r periods. An algorithm is developed to optimize the sequence of locations in order to meet changes in costs, volumes and locations of destinations.
157 citations
TL;DR: In this paper, a network of potential links is given and each link can be either constructed or not at a given cost, and each constructed link can also be constructed either as a one-way or two-way link.
Abstract: In this paper we introduce new network design problems. A network of potential links is given. Each link can be either constructed or not at a given cost. Also, each constructed link can be constructed either as a one-way or two-way link. The objective is to minimize the total construction and transportation costs. Two different transportation costs are considered: (i) traffic is generated between any pair of nodes and the transportation cost is the total cost for the users and (ii) demand for service is generated at each node and a facility is to be located on a node to satisfy the demand. The transportation cost in this case is the total cost for a round trip from the facility to each node and back. We will consider two options in regard to the links between nodes. They can either be two-way only, or mixed, with both two-way and one-way (in either direction) allowed. When these options are combined with the two objective functions, four basic problems are created. These problems are solved by a descent algorithm, simulated annealing, tabu search, and a genetic algorithm. Extensive computational results are presented.
143 citations
TL;DR: The problem is analyzed and a branch and bound procedure is proposed for its solution, which can be converted to the Weber problem by imposing a special structure on its cost function.
Abstract: In this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004
99 citations
Cited by
More filters
2,730 citations
TL;DR: In this paper, a literature overview on typical decision problems in design and control of manual order-picking processes is given, focusing on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning.
1,603 citations
TL;DR: This review reports on literature which explicitly addresses the strategic nature of facility location problems by considering either stochastic or dynamic problem characteristics, with applications ranging across numerous industries.
1,321 citations
29 Sep 2014
TL;DR: In this article, the authors present a concise review of developments on various continuous multivariate distributions and present some basic definitions and notations, and present several important continuous multi-dimensional distributions and their significant properties and characteristics.
Abstract: In this article, we present a concise review of developments on various continuous multivariate distributions. We first present some basic definitions and notations. Then, we present several important continuous multivariate distributions and list their significant properties and characteristics.
Keywords:
generating function;
moments;
conditional distribution;
truncated distribution;
regression;
bivariate normal;
multivariate normal;
multivariate exponential;
multivariate gamma;
dirichlet;
inverted dirichlet;
liouville;
multivariate logistic;
multivariate pareto;
multivariate extreme value;
multivariate t;
wishart translated systems;
multivariate exponential families
1,106 citations