A conceptual modeling of meme complexes in stochastic search

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 42, Issue 5, 2012, Pages 612-625

  Chen, Xianshun ^a   Ong, Yew Soon ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Adaptive memetic algorithms; meme cooperation; memeplex; memetic algorithm (MA); search neighborhood structure; vehicle routing problems (VRPs)

Indexed keywords

MEME COOPERATION; MEMEPLEX; MEMETIC ALGORITHMS; NEIGHBORHOOD STRUCTURE; VEHICLE ROUTING PROBLEMS;

DATA MINING; GENES; NETWORK ROUTING; ROUTING ALGORITHMS; STOCHASTIC SYSTEMS;

EVOLUTIONARY ALGORITHMS;

EID: 84865442620     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2012.2188832     Document Type: Article

References (78)

1. Y. S. Ong, M. H. Lim, and X. Chen, "Memetic computation-Past, present and future," Comput. Intell. Mag., vol. 5, no. 2, pp. 24-36, 2010.
2. X. Chen, S. Ong, M. H Lim, and K. C. Tan, "A multi-facet survey on memetic computation," IEEE Trans. Evol. Comput., vol. 15, no. 5, pp. 591-607, Oct. 2011.
3. A. Lynch, "Thought contagion as abstract evolution," J. Ideas, vol. 2, no. 1, pp. 3-10, 1991.
4. D. C. Dennett, Consciousness explained. Boston, MA: Little, Brown, 1991.
5. J. Delius, "Of mind memes and brain bugs, a natural history of culture," in The Nature of Culture. Bochum, Germany: Bochum Publications, 1989, pp. 26-79.
6. E. O. Wilson, Consilience : The Unity of Knowledge. Boston, MA: Little, Brown, 1998.
7. R. Brodie, Virus of the Mind: The New Science of the Meme. Seattle, WA: Integral Press, 1996.
8. W. Durham, Coevolution: Genes, Culture, and Human Diversity. Stanford, CA: Stanford Univ. Press, 1991.
9. P. Moscato, "On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms," California Inst. Technol., Pasadena, Tech. Rep. Caltech Concurrent Computation Program, Rep. 826, 1989.
10. J. Tang, M. H. Lim, and Y. S. Ong, "Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems," Soft Comput., vol. 11, no. 9, pp. 873-888, 2007. (Pubitemid 46637827)
11. M. H. Lim, Y. Yuan, and S. Omatu, "Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems," Comput. Optim. Appl., vol. 23, no. 1, pp. 47-64, 2002. (Pubitemid 35166998)
12. Y. S. Ong and A. J. Keane, "Meta-lamarckian learning in memetic algorithms," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 99-110, Apr. 2004.
13. Y. S. Ong, M. H. Lim, N. Zhu, and K.W.Wong, "Classification of adaptive memetic algorithms: A comparative study," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 36, no. 1, pp. 141-152, Feb. 2006. (Pubitemid 43174148)
14. Q. H. Nguyen, Y. S. Ong, and M. H. Lim, "A probabilistic memetic framework," IEEE Trans. Evol. Comput., vol. 13, no. 3, pp. 604-623, Jun. 2009.
15. V. Tirronen, F. Neri, T.Kärkkäinen,K.Majava, and T. Rossi, "An enhanced memetic differential evolution in filter design for defect detection in paper production," Evol. Comput., vol. 16, no. 4, pp. 529-555, 2008.
16. M. H. Lim, O. Cao, J. H. Li, and W. L. Ng, "Evolvable hardware using context switchable fuzzy inference processor," in Comput. Digital Tech., 2004, vol. 151, no. 4, pp. 301-311.
17. Z. Zhu, S. Jia, and Z. Ji, "Towards a memetic feature selection paradigm," Comput. Intell. Mag., vol. 5, no. 2, pp. 41-53, 2010.
18. P. Foldesi and J. Botzheim, "Modeling of loss aversion in solving fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm," Memetic Comput., vol. 2, no. 4, pp. 259-271, 2010.
19. O. Kramer, "Iterated local search with powell' method: A memetic algorithm for continuous global optimization," Memet. Comput., vol. 2, no. 1, pp. 69-83, 2010.
20. W. Jakob. (2010). A general cost-benefit-based adaptation framework for multimeme algorithms. Memet. Comput. [Online]. 2(3), pp. 201-218. Available:http://dx.doi.org/10.1007/s12293-010-0040-9
21. A. S. S. M. B. Ullah, R. Sarker, and C. Lokan, "Handling equality constraints with agent-based memetic algorithms," Memet. Comput., vol. 3, no. 1, pp. 51-72, 2011.
22. F. Neri and E. Mininno, "Memetic compact differential evolution for cartesian robot control," Comput. Intell. Mag., vol. 5, no. 2, pp. 54-65, 2010.
23. J. R. Gonzlez, A. D. Masegosa, and I. J. Garcla, "A cooperative strategy for solving dynamic optimization problems," Memet. Comput., vol. 3, no. 1, pp. 3-14, 2011.
24. P. Novoa-Hernndez, C. C. Corona, and D. A. Pelta, "Efficient multiswarm PSO algorithms for dynamic environments," Memet. Comput., vol. 3, no. 3, pp. 163-174, 2011.
25. C. K. Goh, Y. S. Ong, and K. C. Tan, Multi-Objective Memetic Algorithm. (ser. Book Series on Studies in Computational Intelligence, vol. 171).New York: Springer-Verlag, 2009.
26. J. Y. Chia, C. K. Goh, K. C. Tan, and V. A. Shim, "Memetic informed evolutionary optimization via data mining," Memet. Comput., vol. 3, no. 2, pp. 73-87, 2011.
27. L. T. Bui, J. Liu, A. Bender, M. Barlow, S. Wesolkowski, and H. A. Abbass, "Dmea: A direction-based multiobjective evolutionary algorithm," Memet. Comput., vol. 3, no. 4, pp. 271-285, 2011.
28. G. Acampora, V. Loia, and M. Gaeta, "Exploring e-learning knowledge through ontological memetic agents," Comput. Intell. Mag., vol. 5, no. 2, pp. 66-77, 2010.
29. A. F. T. Winfield and M. D. Erbas, "On embodied memetic evolution and the emergence of behavioural traditions in robots," Memet. Comput., vol. 3, no. 4, pp. 261-270, 2011.
30. F. Liang, Y. S. Ong, A. Tan, and X. Chen, "Towards human-like social multi-agents with memetic automaton," in Proc. IEEE Cong. Evol. Comput., 2011, pp. 1092-1099.
31. B. H. Gwee and M. H. Lim, "Ga with heuristic-based decoder for IC floorplanning," Integrat., VLSI J., vol. 28, no. 2, pp. 157-172, 1999. (Pubitemid 30519319)
32. Y. Wang, T. H. Cheng, and M. H. Lim, "A tabu search algorithm for static routing andwavelength assignment problem," IEEE Commun. Lett., vol. 9, no. 9, pp. 841-843, Sep. 2005. (Pubitemid 41644240)
33. R. Meuth, E. Saad, D. Wunsch, and J. Vian, "Memetic mission management," Comput. Intell. Mag., vol. 5, no. 2, pp. 32-40, 2010.
34. A. Caponio, G. L. Cascella, F. Neri, N. Salvatore, and M. Sumner, "A fast adaptive memetic algorithm for online and offline control design of PMSM drives," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 28-41, Feb. 2007. (Pubitemid 46358477)
35. N. Krasnogor, B. P. Blackburne, E. K. Burke, and J. D. Hirst, "Multimeme algorithms for protein structure prediction," in Proceedings of the Parallel Problem Solving from Nature VII. Lecture Notes in Computer Science. New York: Springer-Verlag, 2002, pp. 769-778.
36. W. Jakob, "A cost-benefit-based adaptation scheme for multimeme algorithms," in Proc. Parallel Process. Appl. Math., 2007, pp. 509-519.
37. N. Krasnogor, "Self-generatingmetaheuristics in bioinformatics: The protein structure comparison case," in Genetic Programming and Evolvable Machines. Norwell, MA: Kluwer, 2004, pp. 181-201. (Pubitemid 38497848)
38. F. Neri, V. Tirronen, T. Karkkainen, and T. Rossi, "Fitness diversity based adaptation inmultimeme algorithms:Acomparative study," in Proc. IEEE Congr. Evol. Comput., 2008, pp. 2374-2381. (Pubitemid 351371695)
39. Q. H. Nguyen, Y. S. Ong, and M. H. Lim, "Non-genetic transmission of memes by diffusion," in Proc. Genetic Evol. Comput. Conf., 2008, pp. 1017-1024.
40. W. Jakob, "Towards an adaptive multimeme algorithm for parameter optimisation suiting the engineers' needs," in Proc. Int. Conf. Parallel Problem Solv. Nature, 2006, pp. 132-141. (Pubitemid 44609389)
41. R. Dawkins, The Selfish Gene. Oxford, U.K.: Clarendon, 1989.
42. H. Situngkir. (2004). On selfish memes: Culture as complex adaptive system. [Online]. Available:http://cogprints.org/3471
43. S. J. Blackmore, The Meme Machine. New York: Oxford Univ. Press, 1999.
44. G. H. Lewes, Problems of Life and Mind, vol. 2. London, U.K.: Kegan Paul, Trench, Turbner, 1875.
45. D. Blitz, Emergent Evolution: Qualitative Novelty and the levels of reality. Norwell, MA: Kluwer, 1992.
46. J. Goldstein, "Emergence as a construct: History and issues," Emergence, vol. 1, no. 1, pp. 49-72, 1999.
47. V. Robu, H. Halpin, and H. Shepherd. (2009, Sep.). Emergence of consensus and shared vocabularies in collaborative tagging systems. ACM Trans. Web (TWEB) [Online]. 3(4), pp. 1-34. Available: Http://eprints.ecs.soton.ac.uk/18192
48. G. Kendall and E. Soubeiga, "Choice function and random hyperheuristics," in Proceedings of the fourth Asia-Pacific Conference on Simulated Evolution And Learning, SEAL. New York: Springer-Verlag, 2002, pp. 667-671.
49. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
50. J. F. Bard and L. Huang, "A branch and cut algorithm for the VRP with satellite facilities," IIE Trans., vol. 30, no. 9, pp. 821-834, Sep. 1998. (Pubitemid 128728645)
51. P. Toth and D. Vigo, "Exact solution of the vehicle routing problem," in Fleet Management and Logistic. Norwell, MA:Kluwer, 1998, pp. 1-31.
52. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997. (Pubitemid 127771019)
53. M. Gendreau, G. Laporte, and J. Y. Potvin, Local Search in Combinatorial Optimization. Princeton, NJ: Princeton Univ. Press, 2003.
54. S. R. Thangiah, "Vehicle routing with time windows using genetic algorithms," Slippery Rock Univ., Slipper Rock, PA, Tech. Rep., 1993.
55. J. Y. Potvin, D. Dube, and C. Robillard, "Hybrid approach to vehicle routing using neural networks and genetic algorithms," Appl. Intell., vol. 6, no. 3, pp. 241-252, 1996. (Pubitemid 126708303)
56. K. Zhu, "A new genetic algorithm for VRPTW," presented at the Int. Conf. Artif. Intell., Las Vegas, NV, 2000.
57. S. J. Louis, X. Yin, and Z. Y. Yuan, "Multiple vehicle routing with time windows using genetic algorithms," in Proc. IEEE Congr. Evol. Comput., 1999, pp. 1804-1808.
58. N. Christofides, A. Mingozzi, and P. Toth, "The vehicle routing problem," in Combinatorial Optimization, N. Christofides, A.Mingozzi, P. Toth, and C. Sandi, Eds., Wiley, Chichester, 1979, pp. 315-338.
59. I. H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem," Ann. Oper. Res., vol. 41, no. 4, pp. 421-451, Dec. 1993.
60. A. S. Alfa, S. S.Heragu, andM. Chen, "A 3-opt based simulated annealing algorithm for vehicle routing problem," Comput. Oper. Res., vol. 21, pp. 635-639, 1991.
61. M. Gendreau, A. Hertz, and G. Laporte, "A tabu search heuristic for the vehicle routing problem," Manage. Sci., vol. 40, no. 10, pp. 1276-1290, 1994.
62. F. B. Pereira, J. Tavares, P. Machado, and E. Costa, "GVR: A new genetic representation for the vehicle routing problem," in Irish Conference on Artificial Intelligence and Cognitive Science. New York: Springer-Verlag, 2002, pp. 95-102.
63. C. Prins. (2004, Oct.). A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Operat. Res. [Online]. 31(12), pp. 1985-2002. Available:http://dx.doi.org/10.1016/S0305-0548(03)00158-8 (Pubitemid 38728564)
64. M. Kubiak, "Systematic construction of recombination operators for the vehicle routing problem," Found. Comput. Decis. Sci., vol. 29, pp. 205-226, 2004. (Pubitemid 39038951)
65. J. Berger andM.Barkaoui, "Ahybrid genetic algorithm for the capacitated vehicle routing problem," in Genetic and Evolutionary Computation Conference, vol. 2723/2003. Berlin/Heidelberg, Germany: Springer-Verlag, 2003, pp. 646-656.
66. X. Chen, Y. S. Ong, and M. H. Lim, "Cooperating memes for vehicle routing problems," Int. J. Innovat. Comput., Inf. Control, vol. 7, no. 11, pp. 1-10, 2011.
67. B. D. Diaz. (2009). "VRP benchmarks,"WorldWideWeb electronic publication, [Online]. Available:http://neo.lcc.uma.es/radi-aeb/WebVRP
68. P. Augerat, J. M. Belenguer, E. Benavent, A. Corber, D. Naddef, and G. Rinaldi, "Computational results with a branch and cut code for the capacitated vehicle routing problem," Univ. Joseph Fourier, Grenoble, France, Res. Rep. 949-M, 1995.
69. N. Christofides and S. Eilon, "An algorithm for the vehicle dispatching problem," Operat. Res. Q., vol. 20, pp. 309-318, 1969.
70. B. L. Golden, E. A. Wasil, J. P. Kelly, and I. M. Chao, "The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results," Fleet Manage. Logist., pp. 33-56, 1998.
71. N. Krasnogor, "Self generating metaheuristics in bioinformatics: The proteins structure comparison case," Genet. Programm. Evolv. Mach., vol. 5, no. 2, pp. 181-201, 2004. (Pubitemid 38497848)
72. X. Chen and Y. S. Ong. (2012). A Conceptual Modeling of Meme Complexes in Stochastic Search: Detailed Statistical Results. [Online]. Available: Http://www.c2i.ntu.edu.sg/Courses/papers/report/RPTCAMA-12-11.pdf
73. J. F. Cordeau, M. Gendreau, and G. Laporte, "A tabu search heuristic for the periodic and multi-depot vehicle routing problems," Networks, vol. 30, pp. 105-119, 1994. (Pubitemid 127360996)
74. P. Toth and D. Vigo, "The granular tabu search and its application to the VRP," INFORMS J. Comput., vol. 13, no. 4, pp. 333-346, 1998.
75. C. Rego and C. Rouchairol, "A parallel tabu search algorithm using ejection chains for the vehicle routing problem," in Metaheuristics: Theory and Applications. Boston, MA: Kluwer, 1996, pp. 661-675.
76. C. D. Tarantilis and C. T. Kiranoudis, "Boneroute: An adaptive memorybasedmethod for effective fleet management," Ann. Operat.Res., vol. 115, no. 1-4, pp. 227-241, 2002. (Pubitemid 37132216)
77. J. Xu and J. Kelly, "A network flow-based tabu search for the vehicle routing problem," Transp. Sci., vol. 30, pp. 379-393, 1996. (Pubitemid 126604567)
78. P.Wark and J. Holt, "A repeated matching heuristic for the vehicle routing problem," J. Operat. Res. Soc., vol. 45, pp. 1156-1167, 1994.