Research Article

Solving a Location, Allocation, and Capacity Planning Problem with Dynamic Demand and Response Time Service Level

Table 7

Case  2 (average case) with requests arriving at time 0 and the 30th min. in an hour.

First level decision
Number of facilities {facility nodes}
Second level decision Facility node: assigned node(s)Third level decision Minimum capacity (number of units)Service unit#Average response time per request (≤)Average travel time per request (min.)
Assigned facility nodeRoute: request# (earliest arrival time)Sum of response time (min.) to requests

4   
, , ,
:   
  ( = 1, 2, 3, 4)
4Unit :
  ( = 1, 2, 3, 4)
Unit :   (0)   (5) 
  ( = 1, 2, 3, 4)
Unit : 0 + 0 = 0 
  ( = 1, 2, …, 4)
00

2 , : ,      2Unit 1: Unit 1:  
11 (0)21   (20)22   (25)12   (50)
Unit 1:  
0 + 20 + 0 + 20 = 40
     10  7.5
: , Unit 2: Unit 2:  
31   (0)41   (20)42   (25)32   (50)
Unit 2:  
0 + 20 + 0 + 20 = 40

1 : (all nodes)3Unit :
  ( = 1, 2, 3)
Unit 1:  
11   (0)21   (20)22   (25)12   (50) 
Unit 2: 21   (15)22   (20) 
Unit 3: 31   (15)32   (20)
Unit 1:  
0 + 20 + 0 + 20 = 40 
Unit 2: 15 + 0 = 15 
Unit 3: 15 + 0 = 15
8.757.5