![](bg8.png)
and a HSS algorithm. All algorithms were applied to
TAP by the same authors.
HPBIL presents better results for TAP. The
experimental results show that the proposed
algorithm is an effective and competitive approach
in composing satisfactory results with respect to
solution quality and execution time for TAP.
Moreover, in terms of standard deviation, the
algorithm also proved to be more stable and robust
than the other algorithms.
For future work we suggest the implementation
of Evolutionary Swarm Intelligence algorithms. The
combination of EAs and SI algorithms can unify the
fast speed of EAs for global solutions and good
precision of SI algorithms for good solutions by the
feedback information.
REFERENCES
Abuali, F., Schoenefeld, D., Wainwright, R., 1994.
Terminal assignment in a Communications Network
Using Genetic Algorithms. In Proc. of the 22nd
Annual ACM Computer Science Conference, pp. 74–
81. ACM Press.
Baluja, S., 1994. Population-based incremental learning:
A method for integrating genetic search based
function optimization and competitive learning.
Technical report CMU-CS-95-163, School of
Computer Science, Carnegie Mellon University,
Pittsburgh, PA, USA.
Baluja, S., 1996. Genetic Algorithms and Explicit Search
Statistics. In Advances in Neural Information
Processing Systems, pp. 319-325. MIT Press.
Baluja, S., 1997. Prototyping Intelligent Vehicle Modules
Using Evolutionary Algorithms. In Evolutionary
Algorithms in Engineering Applications, pp. 24 1-257.
Springer-Verlag.
Baluja, S., Caruana, R.. 1995. Removing the genetics form
the standard genetic algorithm. In Proceeding of the
International Conference on Machine Learning, pp.
38-46.
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-
Rodríguez, M., Gómez-Pulido, J., 2008a. Tabu Search
vs Hybrid Genetic Algorithm to solve the terminal
assignment problem. In IADIS International
Conference Applied Computing, pp. 404–409. IADIS
Press.
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-
Rodríguez, M., Gómez-Pulido, J., 2008b. Solving the
Terminal Assignment Problem Using a Local Search
Genetic Algorithm. In International Symposium on
Distributed Computing and Artificial Intelligence, pp.
225-234. Springer.
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-
Rodríguez, M., Gómez-Pulido, J., 2009a. A Hybrid
Differential Evolution Algorithm for solving the
Terminal assignment problem. In International
Symposium on Distributed Computing and Artificial
Intelligence 2009, pp. 178–185. Springer.
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-
Rodríguez, M., Gómez-Pulido, J., 2009b. A Hybrid
Ant Colony Optimization Algorithm for Solving the
Terminal Assignment Problem. In International
Conference on Evolutionary Computation, 2009, pp.
144-151. Springer.
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-
Rodríguez, M., Gómez-Pulido, J., 2010a A Hybrid
Differential Evolution Algorithm with a Multiple
Strategy for Solving the Terminal Assignment
Problem. In 6th Hellenic Conference on Artificial
Intelligence 2010, pp. 303-308. Springer.
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-
Rodríguez, M., Gómez-Pulido, J., 2010b. A Hybrid
Scatter Search Algorithm to assign terminals to
concentrators. In Proc. of the 2010 IEEE Congress on
Evolutionary Computation, pp. 1-8. IEEE Computer
Society. Los Alamitos, CA, USA.
He, Z., Wei, C., Jin, B., Pei, W., Yang, L., 1999. A new
population-based incremental learning method for the
traveling salesman problem. In Proc. of the 1999
Congress on Evolutionary Computation, vol. 2, pp.
1152-1156. IEEE.
Khuri, S., Chiu, T., 1997. Heuristic Algorithms for the
Terminal Assignment Problem. In Proc. of the ACM
Symposium on Applied Computing, pp. 247–251.
ACM Press.
Salcedo-Sanz, S., Yao, X., 2004. A hybrid Hopfield
network-genetic algorithm approach for the terminal
assignment problem. IEEE Transaction On Systems,
Man and Cyb
ernetics, 2343–2353.
Xu, Y., Salcedo-Sanz, S., Yao, X. 2004 Non-standard cost
terminal assignment problems using tabu search
approach. In IEEE Conference in Evolutionary
Computation, vol. 2, pp. 2302–2306.
Yao, X., Wang, F., Padmanabhan, K., Salcedo-Sanz, S.,
2005. Hybrid evolutionary approaches to terminal
assignment in communications networks. In Recent
Advances in Memetic Algorithms and related search
technologies, vol. 166, pp. 129–159. Springer, Berlin.
HYBRID POPULATION-BASED INCREMENTAL LEARNING TO ASSIGN TERMINALS TO CONCENTRATORS
189