Location-Allocation Problems
TL;DR: The calculational aspects of solving certain classes of location-allocation problems are presented in this article, where exact extremal equations and a heuristic method are presented for solving these problems, and directions for further investigation are also indicated because of the need for methods to shorten the total amount of calculation involved.
Abstract: The calculational aspects of solving certain classes of location-allocation problems are presented. Both exact extremal equations and a heuristic method are presented for solving these problems. Directions for further investigation are also indicated because of the need for methods to shorten the total amount of calculation involved.
Citations
More filters
TL;DR: In this article, a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS), is presented, which can easily be implemented using any local search algorithm as a subroutine.
1,824 citations
Book•
29 Apr 2003
TL;DR: This book provides a self-contained, comprehensive and up-to-date presentation of uncertain programming theory, including numerous modeling ideas, hybrid intelligent algorithms, and applications in system reliability design, project scheduling problem, vehicle routing problem, facility location problem, and machine scheduling problem.
Abstract: Real-life decisions are usually made in the state of uncertainty such as randomness and fuzziness. How do we model optimization problems in uncertain environments? How do we solve these models? In order to answer these questions, this book provides a self-contained, comprehensive and up-to-date presentation of uncertain programming theory, including numerous modeling ideas, hybrid intelligent algorithms, and applications in system reliability design, project scheduling problem, vehicle routing problem, facility location problem, and machine scheduling problem. Researchers, practitioners and students in operations research, management science, information science, system science, and engineering will find this work a stimulating and useful reference.
1,352 citations
TL;DR: In this article, the generalized vertex median of a weighted graph may be found by complete enumeration or by some heuristic method, and a method that seems to perform well in comparison with others found in the literature is proposed.
Abstract: The generalized vertex median of a weighted graph may be found by complete enumeration or by some heuristic method. This paper investigates alternatives and proposes a method that seems to perform well in comparison with others found in the literature.
802 citations
TL;DR: In this article, the authors present integer programming formulations for four types of discrete hub location problems: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.
760 citations
References
More filters
Book•
01 Jan 1929
TL;DR: The Theory of the Location of Industries as discussed by the authors is a well-known theory in economic geography, and it has been applied in many areas of the world, e.g., agriculture.
Abstract: (1931). Theory of the Location of Industries. Economic Geography: Vol. 7, No. 1, pp. 106-106.
1,326 citations