Research Article

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

Table 6

Case  1 (worst case) with all requests arriving at time 0.

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 i: i 1 (0) (5) 
(i = 1, 2, 3, 4)
Unit : 0 + 5 = 5  
( = 1, 2, …, 4)
2.50

2 , : ,     2Unit 1: Unit 1:
 11 (0)12 (5)21 (25)22 (30)
Unit 1:  
0 + 5 + 25 + 30 = 60 
    15   3.75
: , Unit 2:  Unit 2:  
31 (0)32 (5)41 (25)42 (30)
Unit 2:  
0 + 5 + 25 + 30 = 60

1 : (all nodes)4Unit :
( = 1, 2, 3, 4)
Unit 1: 11 (0) 12 (5) 
Unit 2: 21 (15)22 (20) 
Unit 3: 31 (15)32 (20) 
Unit 4: 41 (15)42 (20)
Unit 1: 0 + 5 
Unit :  
15 + 20 = 35  
( = 2, 3, 4)
13.755.625