in this paper, we study the network location problem for two congestible facilities, considering impatient customers. we suppose that when a customer arrives his/her corresponding facility and faces a queue with the size more than a predetermined threshold, the customer decides not to join the queue but to go to the closest facility to current facility. in the second facility, if the queue size...

A discrete location problem is formulated for the design of a postal service network. The cost objective of this problem includes a nonlinear concave component. A parametric integer programming algorithm is developed to find an approximate solution to the problem. The algorithm reduces the problem into a sequence of p-median problems and deals with the nonlinear cost by a node-replacement schem...

Mobile IP is a solution for mobility on the global Internet. However, it does not extend well to highly mobile users. Mobile IP regional registration is proposed to reduce the number of location updates to the home network, and reduce the signaling delay. This paper introduces an optimal regional location management mechanism for Mobile IP that results in the minimum signaling cost. A novel dis...

in this paper, we study wsn design, as a multi-objective optimization problem using ga technique. we study the effects of ga parameters including population size, selection and crossover method and mutation probability on the design. choosing suitable parameters is a trade-off between different network criteria and characteristics. type of deployment, effect of network size, radio communication...

— We treat a discrete uncapacitated facility location problem where the installation cost per facility is a gênerai nonlinear function of the number of established facilities. Assuming a convexity proper ty, Mirchandani and Jagannathan developed a heur is tic solution procedure for this problem. Hère, we show how to modify their algorithm in order to get and prove exact solutions and, at the sa...

The objective of this paper is to identify the most promising sets of closest assignment constraints in the literature of Discrete Location Theory, helping the authors in the field to model their problems when clients must be assigned to the closest plant inside an Integer Programming formulation. In particular, constraints leading to weak Linear Programming relaxations should be avoided if no ...