OPTIMIZATION BY ANT COLONY

METHOD
 Optimization By Ant Colony Method

CHAPTER NO.1
Introduction
The first ant colony optimization (ACO) called ant system was inspired through
studying of the behaviour of ants in 1991 by Macro Dorigo and co-workers. An ant colony is
highly organized, in which one interacting with others through pheromone in perfect
harmony. Optimization problems can be solved through simulating ants behaviours. Since
the first ant system algorithm was proposed, there is a lot of development in ACO. In ant
colony system algorithm, local pheromone is used for ants to search optimum result.
However, high magnitude of computing is its deficiency and sometimes it is inefficient.
Thomas Sttzle etal. Introduced MAX-MIN Ant System (MMAS) in 2000. It is one of the
best algorithms of ACO. It limits total pheromone in every trip or sub-union to avoid local
convergence. However, the limitation of pheromone slows down convergence rate in MMAS.
In optimization algorithm, it is well known that when local optimum solution is
searched out or ants arrive at stagnating state, algorithm may be no longer searching the
global best optimum value. According to our limited knowledge, only Jun Ouyang et al
proposed an improved ant colony system algorithm for multi-colony ant systems. In their
algorithms, when ants arrived at local optimum solution, pheromone will be decreased in
order to make algorithm escaping from the local optimum solution. When ants arrived at
local optimum solution, or at stagnating state, it would not converge at the global best
optimum solution. In this paper, a modified algorithm, multi-colony ant system based on a
pheromone arithmetic crossover and a repulsive operator, is proposed to avoid such
stagnating state. In this algorithm, firstly several colonies of ant system are created, and then
they perform iterating and updating their pheromone arrays respective lyuntil one ant colony
system reaches its local optimum solution. Every ant colony system owns its pheromone
array and parameters and records its local optimum solution. Furthermore, once an ant colony
system arrives at its local optimum solution, it updates its local optimum solution and sends
this solution to global best-found centre. Thirdly, when an old ant colony system is chosen
according to elimination rules, it will be destroyed and reinitialized through application of the
pheromone arithmetic crossover and the repulsive operator based on several global best-so-
far optimum solutions. The whole algorithm implements iterations until global best optimum
solution is searched out. The following sections will introduce some concepts and rules of
this multi-colony ant system. This paper is organized as follows. Section II briefly explains
the basic ACO algorithm and its main variant MMAS we use as a basis for multi-colony ant

2
 Optimization By Ant Colony Method

algorithm. In Section III we Ant Colony Optimization - Methods and Applications describe
detailed how to use both the pheromone crossover and the repulsive operator to reinitialize a
stagnated colony in our multi-colony ant algorithm. A parallel asynchronous algorithm
process is also presented. Experimental results from the multi-colony ant algorithm are
presented in Section IV along with a comparative performance analysis involving other
existing approaches. Finally, Section V provides some concluding remarks. Optimization
problems are of high importance both for the industrial world as well as for the scientific
world.
Examples of practical optimization problems include train scheduling, time tabling,
shape optimization, telecommunication network design, or problems from computational
biology. The research community has simplified many of these problems in order to obtain
scientific test cases such as the well-known travelling salesman problem (TSP) .The TSP
models the situation of a travelling salesman who is required to pass through a number of
cities. The goal of the travelling salesman is to traverse these cities (visiting each city exactly
once) so that the total travelling distance is minimal. Another example is the problem of
protein folding, which is one of the most challenging problems in computational biology,
molecular biology, biochemistry and physics. It consists of finding the functional shape or
conformation of a protein in two- or three-dimensional space, for example, under simplified
lattice models such as the hydrophobic-polar model. The TSP and the protein folding
problem under lattice models belong to an important class of optimization problems known
as combinatorial optimization (CO).According to Papadimitriou and CO problem is an
optimization problem in which are given a finite set of objects S (also called the search space)
and an objective function f:S !R+ that assigns a positive cost value to each of the objects .

3
 Optimization By Ant Colony Method

CHAPTER NO.2
Ant colony optimization
2.1 The origins of ant colony optimization
Marco Dorigo and colleagues introduced the first ACO algorithms in the early1990s .
The development of these algorithms was inspired by the observation of ant colonies. Ants
are social insects. They live in colonies and their behaviour is governed by the goal of colony
survival rather than being focused on the survival of individuals. The behaviour that provided
the inspiration for ACO is the ants foraging behaviour, and in particular, how ants can find
shortest paths between food sources and their nest. When searching for food, ants initially
explore the area surrounding their nest in a random manner. While moving, ants leave a
chemical pheromone trail on the ground. Ants can smell pheromone. When choosing their
way, they tend to choose, in probability, paths marked by strong pheromone concentrations.
As soon as an ant finds a food source, it evaluates the quantity and the quality of the food and
carries some of it back to the nest. During the return trip, the quantity of pheromone that an
ant leaves on the ground may depend on the quantity and quality of the food. The pheromone
trails will guide other ants to the food source. It has been shown in that the indirect
communication between the ants via pheromone trailsknown as stigmergy enables them to
find shortest paths between their nest and food sources.
This is explained in an idealized setting in Fig. 1.As a first step towards an algorithm
for discrete optimization we present in the following a discredited and simplified model of
the phenomenon explained in Fig. 1. After presenting the model we will outline the
differences between the model and the behaviour of real ants. Our model consists of a graph
G = (V , E), where V consists of two nodes, namely. (Representing the nest of the ants), and
ad (representing the food source). Furthermore, E consists of two links, namely e1 and e2,
between vs. and vd. To e1 we assign a length of l1, and to e2 a length of l2 such thatl2 > l1.
In other words, e1 represents the short path between vs. and vd, and e2 represents the long
path. Real ants deposit pheromone on the paths on which they move. Thus, the chemical
pheromone trails are modelled as follows. We introduce an artificial pheromone value (i for
each of the two links ei , i = 1, 2. Such a value indicates the strength
of the pheromone trail on the corresponding path. Finally, we introduce artificial ants. Each
ant behaves as follows:

4
 Optimization By Ant Colony Method

From vs. (i.e., the nest), an ant chooses with probability

Pi = (1) Starting
(i
(1 + (2
, i= 1, 2,
Between path e1 and path e2 for reaching the food source vd. Obviously, if (1 >2), the
probability of choosing e1 is higher, and vice versa. For returning from vd to vs., an ant uses
the same path as it chose to reach ad, 4 and it changes the artificial pheromone value
associated to the used edge. More in detail, having chosen edge ei an ant changes the4 Note
that this can be enforced because the setting is symmetric, i.e., the choice of a path for
moving from vs. to vd is equivalent to the choice of a path for moving from vd to vs. .The
main differences between the behaviour of the real ants and the behaviour of the artificial
ants in our model are
as follows-
(1) While real ants move in their environment in an asynchronous way, the artificial ants are
synchronized, i.e., at each iteration of the simulated system, each of the artificial ants moves
from the nest to the food source and follows the same path back.
(2) While real ants leave pheromone on the ground whenever they move, artificial ants only
deposit artificial pheromone on their way back to the nest.
(3) The foraging behaviour of real ants is based on an implicit evaluation of a solution (i.e., a
path from the nest to the food source). By implicit solution evaluation we mean the fact that
shorter paths will be completed earlier than longer ones, and therefore they will receive
pheromone reinforcement more quickly. In Contrast, the artificial ants evaluate a solution
with respect to some quality measure which is used to determine the strength of the
pheromone reinforcement that the ants perform during their return trip to the nest.

5
 Optimization By Ant Colony Method

Figure 1 Behaviour of ant in environment

6
 Optimization By Ant Colony Method

2.2 Basic ant colony optimization algorithm

The principle of ant colony system algorithm is that a special chemical trail
(pheromone) is left on the ground during their trips, which guides the other ants towards the
target solution. More pheromone is left when more ants go through the trip, which improved
the probability of others ants choosing this trip. Furthermore, this chemical trail (pheromone)
has a decreasing action over time because of evaporation of trail. In addition, the quantity left
by ants depends on the number of ants using this trail.
Fig.1 presents a decision-making process of ants choosing their trips. When ants meet
at their decision-making point A, some choose one side and some choose other side
randomly. Suppose these ants are crawling at the same speed, those choosing short side arrive
-making point B more quickly than those choosing long side. The ants choosing by chance
the short side are the first to reach the nest. The short side receives; therefore pheromone
earlier than the long one and this fact increases the probability that further ants select it rather
than the long one. As a result, the quantity of pheromone is left with higher speed in short
side than long side because more ants choose short side than long side. The number of broken
line in Fig. 1 is direct ratio to the number of ant approximately. Artificial ant colony system is
made from the principle of ant colony system for solving kinds of optimization problems.
Pheromone is the key of the decision-making of ants.

Fig. 1. A decision-making process of ants choosing their trips according to pheromone.ACO

was initially applied to the travelling salesman problem (TSP). The TSP is a classical
optimization problem, and is one of a class of NP-Problem. This article also uses the TSP as
an example application. Given a set of N towns, the TSP can be stated as the problem of
finding a minimal length closed tour that visits each town once. Each city is a decision
making point of artificial ants.
The Ant Colony Optimization (ACO) is a met heuristic inspired by the behaviour of real ants.
Ants and other insects that live in a colony, like bees, termites and wasps, can be seen as

7
 Optimization By Ant Colony Method

distributed systems, that in spite of the simplicity of each individual, present a high level of
social organization when observed together. Some examples of ant colonys capabilities
found in Dorigo etal, 1999 are: division of labour and task allocation, cemetery brood
sorting, cooperative transport and finding the shortest path between two or more locations
(often between a food source and a nest).
The first ACO algorithm developed was initially applied to the Travelling Salesman
Problem. The algorithm was based on the ant colony capability to find the shortest path
between a food source and a nest. The algorithm uses artificial ants that cooperate on finding
solutions to the problem through communication mediated by artificial pheromone trails.
While moving on the graph associated with the problem, artificial ants deposit pheromone on
the edges traversed marking a path that may be followed by other members of the colony,
which then reinforce the pheromone on that path. With this stigmergetic communication, ants
have their activities coordinated. This self-organizing behaviour results in a self-reinforcing
process that leads to the formation of a path marked by high pheromone concentration, while
paths that are less used tend to have a diminishing pheromone level due to evaporation. This
concept can be applied to any combinatorial optimization problem for which a constructive
heuristic can be defined. The process of constructing solutions can be regarded as a walk on a
construction graph where each edge of the graph represent a possible step the ant can take.
ACO algorithms are essentially constructive, as ants generate solutions by adding solution
components, corresponding to the edges chosen, to an initially empty solution until the
solution is complete.
The ants movement is guided by (is) a heuristic information ( ) that represents prior
information about the problem instance to be solved and by (ii) a pheromone trail () that
encodes a memory about the ant colony search process which is continuously updated by the
ants. In many cases is the cost of adding the component (associated with the given graph
edge) to the solution under construction. These values are used by the ants heuristic rule to
make probabilistic decisions on the next node to be visited (or next edge to be used).When all
ants have generated their solutions, the pheromone trail is updated considering the quality of
the corresponding candidate solutions: reinforcing components of good solutions(positive
feedback) and applying a certain level of pheromone evaporation in all edges. The ACO
algorithms were initially used to solve combinatorial optimization problems, inspired by the
path marking behaviour, and later applied to many other problems. Also, other ant colony
capabilities have inspired computer scientists to use ACO on different types of applications.

8
 Optimization By Ant Colony Method

Ant-colony optimization Similar to PSO, ant-colony optimization (ACO) algorithms

evolve not in their genetics but in their social behaviour. ACO was developed by Dorigo et al.
Based on the fact that ants are able to find the shortest route between their nest and a source
of food. This is done using pheromone trails, which ants deposit whenever they travel, as a
form of indirect communication. As shown in Fig. 1d, when ants leave their nest to search for
a food source, they randomly rotate around an obstacle, and initially the pheromone deposits
will be the same for the right and left directions. When the ants in the shorter direction find a
food source, they carry the food and start returning back, following their pheromone trails,
and side positing more pheromone, an ant will most likely choose the shortest path when
returning back to the nest with food as this path will have the most deposited pheromone.
For the same reason, new ants that later starts out from the nest to find food will also
choose the shortest path. Over time, this positive feedback (autocatalytic) process prompts all
ants to choose the shorter path .Implementing the ACO for a certain problem requires are
presentation of S variables for each ant, with each variable has a set of n i options with their
values , and their associated pheromone concentrations ; whereiZ1, 2,., S, and jZ1, 2,., As
such, an ant is consisted of S values that describe the path chosen by the ant as shown in Fig.
A code for the ACO is shown in Appendix E. Other researchers use a variation of this general
algorithm, incorporating a local search to improve the solution .In the ACO, the process starts
by generating m random ants (solutions). An ant k (kZ1, m) represents a solution string, with
a selected value for each variable. Each ant is then evaluated according to an objective
function.
The reason for allowing pheromone evaporation isto avoids too strong influence of the old
pheromone to avoid premature solution stagnation. In .Eq. the change in Fig. 4. Ant
representation. Elbeltagi et al. / Advanced Engineering Informatics pheromone concentration
Dtij is calculated as :
Dtij Z
Xm
kZ1
R=fitnessk if option lij is chosen by ant k
0 gets higher as the solution improves. Therefore, for minimization problems, Eq. (6) shows
the pheromones change as proportional to the inverse of the fitness. In maximization
problems, on the other hand, the fitness value itself can be directly used. Once the pheromone
is updated after an iteration, the next iteration starts by changing the ants paths (i.e.

9
 Optimization By Ant Colony Method

associated variable values) in a manner that respects pheromone concentration and also some
heuristic preference. As such, an ant k at iteration t will change the value for otherwise(where
R is a constant called the pheromone reward factor; and fitnessk is the value of the objective
function (solution performance) calculated for ant k. It is noted that the amount of pheromone
each variable according to the following probability:
Pijk; tZ
tijt_a!hij_b
P
lij
tijt_a! hij_b
Where Pij (k, t) Zprobability that option lij is chosen by ant kfor variable i at iteration t; tij (t)
Pheromone concentration associated with option lij at iteration t;hijZheuristic factor for
preferring among available options and is an indicator of how good it is for ant k to select
option lij (this heuristic factorise generated by some problem characteristics and its value is
fixed for each option lij); and a and b are exponent parameters that control the relative
importance of pheromone concentration versus the heuristic factor . Both a and b can take
values greater than zero and can be determined by trial and error. Based on the previous
discussion, the main parameters involved in ACO are: number of ants m; number of iteration
st; exponents a and b; pheromone evaporation rate.

10
 Optimization By Ant Colony Method

CHAPTER NO.3
APPLICATION OF ANTCOLONY METHODS

Water resources systems analysis is the science of developing and applying

mathematical operations research methodologies to water resources systems problems
comprised of reservoirs, rivers, watersheds, groundwater, distribution systems, and others, as
standalone or integrated systems, for single or multiobjective problems, deterministic or
stochastic. The scientific and practical challenge in dealing quantitatively with water
resources systems analysis problems is in taking into consideration from a systems
perspective, social, economic, environmental, and technical dimensions, and integrating them
into a single framework fortrading-off in time and in space competitive objectives.
Inherently, such problems involve modelling of water quantity and quality for surface water,
groundwater, water distribution systems, reservoirs, rivers, lakes, and other systems as stand
alone or combined systems. Numerous models for water resources systems analysis have
been proposed during the past four decades. A possible classification for those is into:
methods based on decomposition in which an "inner" linear/quadratic problem is solved for a
fixed low-dimension decision variables set, while that set is altered at an "outer" problem
using a gradient or a sub gradient technique (e.g., Alperovits and Shamir, ; Quandary et al. ;
Kessler and Shamir; Eiger et al., Outfield and Shamir, methods which utilize straightforward
non-linear programming formulation (e.g., Watanatada; Shamir; Karatzas and Finder,
methods based on linking a simulation program with a general nonlinear optimization code
(e.g., Ormsbee and Contractor; Lansey and Mays, and more recently, methods which employ
evolutionary techniques such asgenetic algorithms (e.g., Simpson et. al; Savic and Walters,;
Espinoza et al; Espinoza and Minsker, Cross Entropy or the shuffled frog leaping algorithm
(e.g., Eusuff and Lansey. Among the above classification ant colony optimization (ACO)
belongs to category of evolutionary techniques. Although some studies have already been
conducted (e.g., Maier etal, Ostfeld and Tubaltzev; Christodoulou and Ellens in which ant
colony optimization was utilized, the employment of ACO in water resources systems studies
is still in its infancy.

This reviews the current literature of ACO for water resources systems analysis, and
suggests future directions and challenges for using ACO for solving water resources systems
problems [parts of this Chapter are based on Outfield and Tubaltzev with permission from the
American Society of Civil Engineers (ASCE)]. Ali et al. used ant colony optimization to
accelerate convergence of the differential evolution (DE) technique. Their methodology,
entitled ant colony differential evolution (ACDE), initializes the ant population using based
learning techniques, utilizes a random localization methodology, and simulates the movement
of ants to refine the best solution found in each iteration. The ACDE was applied to different
test problems including a simplified water resources system. Abbaspour et al. Utilized ant
colony optimization for calibrating an unsaturated soil hydraulic model. The use of ant
colony replaced the traditional inverse modelling approach and was found to be successful
inovercoming previous parameterization related optimization problems. Li et al. Developed a
hybrid ant colony-simulated annealing method for groundwater parameter estimation. The

11
 Optimization By Ant Colony Method

inverse problem of parameter identification was formulated as an optimization problem.

Transmissivity and storage coefficients for a two-dimensional unsteady state groundwater
flow model were calibrated with the proposed technique.

3.1 Water distribution systems

The first to introduce ant colony optimization for water distribution systems
managementwere Maier et. al. Maier et al. applied a traditional ant colony settings for
optimizingtwo benchmark gravitational one loading conditions water distribution systems.
Zecchin etAnt Colony Optimization for Water Resources Systems Analysis Review and
Challenges. Studied parameterization of ant colony optimization for water distribution
systems and suggested guidelines for selecting them. Christodoulou and Elias proposed anent
colony optimization algorithm for efficient routing of piping networks for improving its
efficiency and resiliency. Lopez-Ibez et al. Used ant colony for optimizing the operation of
pumping in water distribution systems.

Application of ant colony optimization

12
 Optimization By Ant Colony Method

CHAPTER NO. 4

CONCLUSION
A brief description of each method is presented along with a p facilitate their
implementation. Visual Basic programs were written to implement each algorithm. Two
benchmark continuous optimization test problems were solved using all but the ACO
algorithm, and the comparative results were presented. Also presented were the comparative
results found when a discrete optimization test problem was solved using all five algorithms.
The PSO method was generally found to perform better than other algorithms in terms of
success rate and solution quality, while being second best in terms of processing time.
In this work we first gave a detailed description of the origins and the basics of ACO
algorithms. Then we outlined the general framework of the ACO and presented some of the
most successful ACO variants today. After listing some representative applications of ACO,
we summarized the existing theoretical results and outlined the latest developments
concerning the adaptation of ACO algorithms to continuous optimization. Finally, we
provided survey on a very interesting recent research direction: The hybridization of ACO
algorithms with more classical artificial intelligence and operations research methods. As
examples we presented the hybridization with beam search and with constraint programming.
The central idea behind these two approaches is the reduction of the search space that has to
be explored by ACO. This can be especially useful when large scale problem instances are
considered. Other hybridization examples are the application of ACO for solution refinement
in multilevel frameworks, and the application of ACO to auxiliary search spaces. In the
opinion of the author, this research direction offers many possibilities for valuable future
research. In this paper, five evolutionary-based search methods were presented. These
include: GA, MA, PSO, ACO, ands.
.
Future research
Ant colony optimization for water resources systems analysis is in its early stages of
exploitation as depicted from the literature review described above. Applications to optimal
reservoir operations, long term monitoring, some general water resources problems, and
water distribution systems design and operation were developed. Still, most of the water
resources systems community has not yet utilized the potential fusing ant colony
optimization, as occurred in other research disciplines such as structure engineering.
Research is thus almost completely open for developing and applying ant colony optimization

13
 Optimization By Ant Colony Method

algorithms for water resources systems problems and analysis. The challenges of using ant
colony optimization in water resources systems analysis vary with the specific theme and
objective of interest. Yet, commonly to water resources systems analysis is the inherent
probabilistic complex nature of the physical systems such round water, watersheds,
distribution systems, and others. Those yield non-linearity and on-smoothness in describing
the systems physical behaviour. As a result, almost any water resources systems model which
obviously needs to capture its physics as model constraints is highly complex. Traditional
non-linear algorithms such as gradient type algorithms are thus very much limited. As every
problem has its unique structure and trade off among its decision variables and formulations,
the challenge of developing ant colony algorithms for water resources systems analysis is
mainly in tailoring the specific problems characteristics with an ant colony formulation. This
requires the model to explore different avenues of formulations such that the resulted model
will be computationally feasible. This is a tremendous challenging task which captures most
of the innovativeness aspects of new model and application. Below are the major fields of
water resources systems analysis for which new ant colony optimization models could be
developed and applied:
Climate change: climate variability and change, adaptive management, decision
making Groundwater: parameter estimation, operation, contamination, remediation
estimation and simulation, end users; field work tracer studies, pressure tests, case studies;
contaminant and water security detection, source identification, response; network
vulnerability security assessments, network reliability, disaster response, emerging issues
network water quality real-time monitoring and model dose exposure, mixing and
dispersion, storage tanks, asset management, Maintenance, system expansion and
rehabilitation; sustainable water distribution systems design and operation, water reuse and
supply, dual distribution system Water economics: water demand household, commercial;
water supply cost of production, efficiency studies, technological change, industry studies;
valuing water services ecological services, sanitation navigation, recreation, irrigation,
industrial Water policy: trans boundary, drought, flood, navigation, recreation, irrigation,
industrial, climate, energy Watersheds and river basins: watershed management, water and
energy systems, application hydrologic predictions and forecasts, best management practices,
storm water In this paper, we have studied a multi objective buffers sizing problem using ant
colony optimization. The two objectives of our study are the maximization of the throughput
rate and the minimization of the total size of the buffers. To solve the problem, three

14
 Optimization By Ant Colony Method

multiobjective have been developed: a multi objective ant colony optimization algorithm, a
multi objective ant colony algorithm with a guided local search and a Lorenz multi objective
ant colony optimization algorithm. Computational experimental shave been realized on
different assembly lines configurations and we have compared our three methods to each
others. We have noticed that the L-MOACS performances are better than those of the
MOACS and slightly better than those of the MOACS-GLS algorithm. Regarding the
perspectives of this work, other methods based on the Pareto or the Lorenz dominance may
be tested such as genetic algorithms or particle swarm optimization algorithms. Other
hybridization techniques may also be tested in order to see the impact on the achieved
solutions. Finally, exact methods may be developed to compare the optimal solutions with
those of the applied met heuristics.

15
 Optimization By Ant Colony Method

References

1. Ahuja, A. &Pathway, A. (2005). Using ant colony optimization for loss minimization
in distribution networks, Proceedings of the 37th Annual North American Power
Symposium, pp. 470474.
2. Ares-Pena, F. J., Rodriguez-Gonzalez, J. A., Villanueva-Lopez, E. & Rengarajan, S.
R. (1999).Genetic algorithms in the design and optimization of antenna array patterns,
IEEET ransactions on Antennas and Propagation 47(3): 506510.
3. Bamford, L. D., James, J. R. & Fray, A. F. (1997). Minimisingmutual coupling in
thick sub stratemicro strip antenna arrays, Electronics Letter 33(8): 648650.
4. Bullnheimer, B., Hartl, R. & Strauss, C. (1999). A new rank based version of the ant
system a computational study, Central Eur. J. Opera. Res. Econ. 7(1).
5. Burokur, S. N., Latrach, M. & Toutain, S. (2007). Influence of split ring resonators
onthe properties of propagating structures, IET Microwaves, Antennas and
Propagation1(1): 9499.
6. Caminita, F., Costanzo, S., Di Massa, G., Guarnieri, G., Maci, S., Mauriello, G. &
Venneri, I. (2009). Reduction of patch antenna coupling by using a compact EBG
formed byshorted strips with interlocked branch-stubs, IEEE Antennas and Wireless
Propagation Letters 8: 811814.
7. Chiau, C., Chen, X. & Parini, C. (2003). A micro strip patch antenna on the embedded
multi-period EBG structure, Proceedings of 6th International Symposium on
Antennas, Propagation and EM Theory, 2003. pp. 9699.
8. Choi, S. H., Park, J. K., Kim, S. K. & Park, J. Y. (2004). A new ultra-wideband
antenna for UWB applications, Microwave and Optical Technology Letters 40: 339
401.
9. Coleman, C. M., Rothwell, E. J. & Ross, J. E. (2004). Investigation of simulated
annealing, ant-colony optimization, and genetic algorithms for self-structuring
antennas, IEEET ransactions on Antennas and Propagation 52(4): 10071014.

16