The P-Center Problem under Uncertainty

Authors

  • Hassan Shavandi Dept. of Industrial Engineering, Sharif University of Technology, Tehran, Iran
  • Majid Taghavi Dept. of Industrial Engineering, Sharif University of Technology, Tehran, Iran
Abstract:

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming model. Furthermore, we develop a tabu search algorithm for solving the problem. Finally we use design of experiments (DOE) to adjust the parameters of tabu search algorithm. The numerical results of algorithm are presented accordingly.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Uncapacitated phub center problem under uncertainty

Hubs are facilities to collect arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this paper, an uncapacitated phub center problem in case of single allocation and also multiple allocation will be introduced in which travel times or transportation costs are considered as fuzzy parameters. Then, by proposing new methods, the presented problem is con...

full text

Solving the P/NP Problem under Intrinsic Uncertainty

Heisenberg’s uncertainty principle states that it is not possible to compute both the position and momentum of an electron with absolute certainty. However, this computational limitation, which is central to quantum mechanics, has no counterpart in theoretical computer science. Here, I will show that we can distinguish between the complexity classes P and NP when we consider intrinsic uncertain...

full text

The knapsack problem under uncertainty

In this paper we consider the Knapsack Problem under Uncertainty (KPu). Given a container, the knapsack, characterized by a maximum weight that can be accommodated into and a set of items with given weight and random profit, KPu aims to define the subset of items that can be accommodated into the knapsack such that the sum of the weights of the loaded items does not exceed the knapsack maximum ...

full text

Classical Center Location Problem Under Uncertain Environment

This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for find...

full text

Unweighted p-center problem on extended stars

An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 6  issue 1

pages  48- 57

publication date 2012-04-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023