Un Algoritmo Genético H´ıbrido Paralelo para Instancias Complejas ...

seguir incrementando el tamaño de nuestro grid, y
modificando el algoritmo para hacerlo más eficiente.
En este segundo aspecto creemos que debemos centrarnos
en desarrollar nuevos métodos de búsqueda
local más eficientes que el utilizado en este trabajo,
ya que es el paso más costoso computacionalmente
del ciclo reproductor del algoritmo.
Agradecimientos
Este trabajo ha sido subvencionado por MEC y
FEDER bajo el contrato TIN2005-08818-C04-01 (el
proyecto OPLINK: http://oplink.lcc.uma.es).
Referencias
[1] G.B. Dantzing and R.H. Ramster, “The truck dispatching
problem,” Management Science, vol. 6, pp. 80–91,
1959.
[2] J.K. Lenstra and A.H.G. Rinnooy Kan, “Complexity of
vehicle routing and scheduling problems,” Networks, vol.
11, pp. 221–227, 1981.
[3] P. Toth and D. Vigo, The Vehicle Routing Problem,
Monographs on Discrete Mathematics and Applications.
SIAM, Philadelphia, 2001.
[4] B.L. Golden, E.A. Wasil, J.P. Kelly, and I-M. Chao, Fleet
Management and Logistics, chapter The Impact of Metaheuristics
on Solving the Vehicle Routing Problem: algorithms,
problem sets, and computational results, pp.
33–56, Kluwer, Boston, 1998.
[5] J.F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and
J.S. Sormany, New Heuristics for the Vehicle Routing
Problem, Kluwer Academic Publishers, 2004, to appear.
[6] E. Alba and M. Tomassini, “Parallelism and evolutionary
algorithms,” IEEE Transactions on Evolutionary
Computation, vol. 6, no. 5, pp. 443–462, October 2002.
[7] E. Cantú-Paz, Efficient and Accurate Parallel Genetic
Algorithms, vol. 1 of Book Series on Genetic Algorithms
and Evolutionary Computation, Kluwer Academic Publishers,
2nd edition, 2000.
[8] E. Alba and B. Dorronsoro, Engineering Evolutionary
Intelligent Systems, chapter 13, A Hybrid Cellular Genetic
Algorithm for the Capacitated Vehicle Routing Problem,
Studies in Computational Intelligence. Springer-
Verlag, 2007.
[9] “ProActive official web site,” http://wwwsop.inria.fr/oasis/proactive/.
[10] F. Li, B. Golden, and E. Wasil, “Very large-scale vehicle
routing: New test problems, algorithms, and results,”
Computers & Operations Research, vol. 32, pp. 1165–
1179, 2005.
[11] E. Alba, Análisis y Diseño de Algoritmos Genéticos Paralelos
Distribuidos, Ph.D. thesis, Universidad de Málaga,
Málaga, Febrero 1999.
[12] F.B. Pereira, J. Tavares, P. Machado, and E. Costa,
“GVR: a new representation for the vehicle routing problem,”
in 13th Irish Conference Proceedings on Artificial
Intelligence and Cognitive Science (AICS), M. O’Neill
et al., Ed., Ireland, 2002, pp. 95–102, Springer-Verlag.
[13] E. Alba and B. Dorronsoro, “Solving the vehicle routing
problem by using cellular genetic algorithms,” in Evolutionary
Computation in Combinatorial Optimization
– EvoCOP 2004, Jens Gottlieb and Günther R. Raidl,
Eds., Coimbra, Portugal, 5-7 April 2004, vol. 3004 of
LNCS, pp. 11–20, Springer Verlag.
[14] E. Alba and B. Dorronsoro, “Computing nine new bestso-far
solutions for capacitated VRP with a cellular genetic
algorithm,” Information Processing Letters, vol.
98, no. 6, pp. 225–230, June 2006.
[15] N. Christofides, A. Mingozzi, and P. Toth, Combinatorial
Optimization, chapter The Vehicle Routing Problem, pp.
315–338, John Wiley, 1979.
[16] I.H. Osman, “Metastrategy simulated annealing and tabu
search algorithms for the vehicle routing problems,”
Annals of Operations Research, vol. 41, pp. 421–451,
1993.
[17] G.A. Croes, “A method for solving traveling salesman
problems,” Operations Research, vol. 6, pp. 791–812,
1958.