Академический Документы
Профессиональный Документы
Культура Документы
Keywords:
Hub location; Hub covering problem; Network
design; Capacity constraint.
I.
INTRODUCTION
204
MATEMATICAL FORMULATION
205
Country = [1 7 3 7 3 3 7 1 9 9]
Initial countries
The initialization process begins with creating the initial
countries. The size of the countries is predefined. For the
hub covering problem with single allocation under capacity
constraints, the number of hubs in the network is undefined.
After that hubs located in the network, the remaining spokes
should be allocated to a located hubs. For the initial
population of countries, spokes are allocated to their nearest
hub, based on cost (radius) values. Also all hubs should
cover some nodes that not exceeded from their capacity.
Design of each network that satisfies all constraints is
challenging.
C. Function evaluation
The evaluation function is an operation to evaluate how
good the network configuration of each individual is,
making the comparison between different solutions possible.
The evaluation function consists of calculating the value of
the objective function of the network represented by each
country.
D.
Imperialism
For producing the initial imperialist, we consider some
In which,
is the cost of nth emperor, and
is the
normalized cost for nth emperor. If we have the normalized
cost, we can compute the proportional power for each
emperor for allocating the colonies to emperor as fallow:
In which,
is the number of colonies that nth
emperor has. After allocating the colonies to emperors the
imperialism competition will be started. Each emperor tries
to develop its colonies. In next section we present three
methods for developing or assimilating colonies.
206
E. Assimilation methods
1) Near building policy
In this approach we assimilate colonies with emperors.
For this work we determine the hub of emperor and use the
half of them for locating hubs in some colonies. Those
colonies which select to assimilation are limited. We choose
some colonies randomly. After hub selection for colonies we
allocate remained nodes to located hubs. Finally colonies
will be assimilated. In this process, if one colony will find
better cost then the position of emperor and best assimilated
colony will be changed. For example if the array matrix of
emperor is Emp= [1 2 7 6 6 7 2 2 9 10] therefore the hub
location is [1 2 6 7 9 10]. Next we select half of hub location
matrix randomly. For example: [6 9 10]. Then for each
colony that has chosen we locate nodes 6, 9, and 10 as hubs.
Finally we allocate remained nodes to this hub set.
2) Association policy
In this method each emperor combines its feature with
colony. This approach is similar to cross over in genetic
algorithm. We can say our solution algorithm is hybrid of
Imperialist competitive algorithm and genetic algorithm.
Because of this contribution our solution algorithm solves
the problem in lower time. After each association the
country will passed from filtering step in program to
guarantee that the country will have a valid structure at the
end of the process. For example if emperor is Emp= [1 2 7 6
6 7 2 2 9 10] and the colony is Col=[2 2 3 4 7 3 7 8 8 2].
Then we chose the association point randomly. For example
if association point is 6 then we combine [1 2 7 6 6 7] with
[7 8 8 2]. Therefore the colony will be changed to [1 2 7 6 6
7 7 8 8 2].
3) Revolution policy
In our algorithm mutation consists of creating the new
solution. It likes the population production as mentioned
above. This step is for releasing from local search in solution
space. In some imperialism some of colonies will be
revolted. In our algorithm we have revolution rate that is
closed to 0.1. For example if the imperialism has 20
populations, then just two of their colonies will be revolted.
F. Cost of each imperialism
To compute the cost or fitness function for any
imperialism we act as follow:
IV.
10
11
12
15
20
0.75
0.75
0.75
0.75
0.75
COMPUTATIONAL RESULTS
Parameter
Computational Result
The
OFV
with
LINGO
The OFV
with
heuristic
Number
of hubs
Gap
(%)
0.95
0.95
0.95
0.95
0.95
1434.8
1878.9
2537.45
3850.65
7442.3
1434.8
1878.9
2562.3
3850.65
7469.6
4
5
5
8
13
0
0
0.96
0
0.36
207
CONCLUSION
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
[22]
208