In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be redu...

  In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical mod...

Received Feb 14, 2017 Revised May 30, 2017 Accepted Aug 11, 2017 Ambulance location is one of the critical factors that determine the efficiency of emergency medical services delivery. Maximal Covering Location Problem is one of the widely used ambulance location models. However, its coverage function is considered unrealistic because of its ability to abruptly change from fully covered to unco...

The distribution or delivery process is one factor that affect customer satisfaction as the goal of supply chain. In order for chain to be competitive in competition, time an important manage, so it could provide high service level value. One affects center location. A strategic location would facilitate and speed up process. This research discusses model determining made at right amount by ana...

A practical mechanism for a file-backup system concept is proposed. In this paper, it is demonstrated that a highly secure file backup mechanism can be achieved by combining technologies that implement the following: spatial random scrambling of file data, subsequent random fragmentation of the file, the duplication and encryption of each file fragment using a stream cipher code in each encrypt...

in this paper, an efficient fault-tolerant routing algorithm for mobile ad-hoc networks (manets) is presented. the proposed algorithm increases the network fault-tolerance using natural redundancy of ad-hoc networks. this algorithm is carried out in two stages; 1) the selection of backup nodes 2) the selection of backup route(s). in the first stage, the proposed algorithm chooses nodes with the...