Memetic Search with Interdomain Learning: A Realization between CVRP and CARP

IEEE Transactions on Evolutionary Computation

Volumn 19, Issue 5, 2015, Pages 644-658

  Feng, Liang ^a   Ong, Yew Soon ^a,b   Lim, Meng Hiot ^c   Tsang, Ivor W ^d  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b SINGAPORE INSTITUTE OF MANUFACTURING TECHNOLOGY   (Singapore)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^d UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Cross Domain Memes; Evolutionary Optimization; Knowledge Memes; Learning; Memetic Computing

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; KNOWLEDGE MANAGEMENT; NETWORK ROUTING;

CROSS-DOMAIN; EVOLUTIONARY OPTIMIZATIONS; KNOWLEDGE MEMES; LEARNING; MEMETIC COMPUTING;

OPTIMIZATION;

EID: 84975528453     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2014.2362558     Document Type: Article

References (50)

1. F. Neri, G. L. Cascella, N. Salvatore, G. Acciani, and D. A. Gassi, "A hierarchical evolutionary-deterministic algorithm in topological optimization of electrical grounding grids," in Proc. WSEAS Int. Conf. Dyn. Syst. Control, Stevens Point, WI, USA, 2005, pp. 2338-2345.
2. Y. P. Chen and Y. Y. Lin, "Controlling the movement of crowds in computer graphics by using the mechanism of particle swarm optimization," Appl. Soft Comput., vol. 9, no. 3, pp. 1170-1176, 2009.
3. K. Tang, Y. Mei, and X. Yao, "Memetic algorithm with extended neighborhood search for capacitated arc routing problems," IEEE Trans. Evol. Comput., vol. 13, no. 5, pp. 1151-1166, Oct. 2009.
4. K. Tang, F. Peng, G. L. Chen, and X. Yao, "Population-based algorithm portfolios with automated constituent algorithms selection," Inf. Sci., vol. 279, pp. 94-104, Sep. 2014.
5. Y. Mei, K. Tang, and X. Yao, "Decomposition-based memetic algorithm for multi-objective capacitated arc routing problems," IEEE Trans. Evol. Comput., vol. 15, no. 2, pp. 151-165, Apr. 2011.
6. Y. Mei, K. Tang, and X. Yao, "A global repair operator for capacitated arc routing problem," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 39, no. 3, pp. 723-734, Jun. 2009.
7. Y. Mei, K. Tang, and X. Yao, "A memetic algorithm for periodic capacitated arc routing problem," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 41, no. 6, pp. 1654-1667, Jul. 2011.
8. Y. C. Jin, Knowledge Incorporation in Evolutionary Computation (Studies in Fuzziness and Soft Computing). Berlin, Germany: Springer, 2010.
9. Y. S. Ong, N. Krasnogor, and H. Ishibuchi, "Special issue on memetic algorithm," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 2-5, Feb. 2007.
10. Y. S. Ong, M. H. Lim, F. Neri, and H. Ishibuchi, "Special issue on emerging trends in soft computing: Memetic algorithms," Soft Comput., vol. 13, nos. 8-9, pp. 1-2, 2009.
11. M. H. Lim, S. Gustafson, N. Krasnogor, and Y. S. Ong, "Editorial to the first issue, memetic computing," Soft Comput., vol. 1, no. 1, pp. 1-2, 2009.
12. J. E. Smith, "Co-evolving memetic algorithms: A review and progress report," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 6-17, Feb. 2007.
13. I. Paenke, Y. Jin, and J. Branke, "Balancing population- and individuallevel adaptation in changing environments," Adapt. Behav., vol. 17, no. 2, pp. 153-174, 2009.
14. G. Gutin and D. Karapetyan, "A selection of useful theoretical tools for the design and analysis of optimization heuristics," Memetic Comput., vol. 1, no. 1, pp. 25-34, 2009.
15. J. Tang, M. H. Lim, and Y. S. Ong, "Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems," Soft Comput. J., vol. 11, no. 9, pp. 873-888, 2007.
16. Z. Zhu, Y. S. Ong, and M. Dash, "Wrapper-filter feature selection algorithm using a memetic framework," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 70-76, Feb. 2007.
17. S. M. K. Hasan, R. Sarker, D. Essam, and D. Cornforth, "Memetic algorithms for solving job-shop scheduling problems," Memetic Comput., vol. 1, no. 1, pp. 69-83, 2009.
18. M. Tang and X. Yao, "A memetic algorithm for VLSI floorplanning," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 62-69, Feb. 2007.
19. P. Cunningham and B. Smyth, "Case-based reasoning in scheduling: Reusing solution components," Int. J. Prod. Res., vol. 35, no. 4, pp. 2947-2961, 1997.
20. S. J. Louis and J. McDonnell, "Learning with case-injected genetic algorithms," IEEE Trans. Evol. Comput., vol. 8, no. 4, pp. 316-328, Aug. 2004.
21. L. Feng, Y. S. Ong, I. W. Tsang, and A. H. Tan, "An evolutionary search paradigm that learns with past experiences," in Proc. IEEE World Congr. Comput. Intell. Congr. Evol. Comput., 2012, pp. 1-8.
22. R. Dawkins, The Selfish Gene. Oxford, U.K.: Oxford Univ. Press, 1976.
23. F. Neri, C. Cotta, and P. Moscato, Handbook of Memetic Algorithms (Studies in Computational Intelligence). Berlin, Germany: Springer, 2011.
24. Y. S. Ong, M. H. Lim, and X. S. Chen, "Research frontier: Memetic computation-Past, present & future," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 24-36, May 2010.
25. X. S. Chen, Y. 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.
26. 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.
27. L. Feng, Y. S. Ong, A. H. Tan, and X. S. Chen, "Towards humanlike social multi-agents with memetic automaton," in Proc. IEEE Congr. Evol. Comput., New Orleans, LA, USA, 2011, pp. 1092-1099.
28. G. Iacca, F. Neri, E. Mininno, Y. S. Ong, and M. H. Lim, "Ockham's razor in memetic computing: Three stage optimal memetic exploration," Inf. Sci., vol. 188, pp. 17-43, Apr. 2012.
29. F. Caraffini, F. Neri, G. Iacca, and A. Mol, "Parallel memetic structures," Inf. Sci., vol. 227, pp. 60-82, Apr. 2013.
30. F. Caraffini, F. Neri, and L. Picinali, "An analysis on separability for memetic computing automatic design," Inf. Sci., vol. 265, pp. 1-22, May 2014.
31. E. K. Burke et al., "Hyper-heuristics: A survey of the state of the art," J. Oper. Res. Soc., vol. 64, pp. 1695-1724, Jul. 2013.
32. E. K. Burke et al., "A classification of hyper-heuristic approaches," in Handbook of Meta-Heuristics. Norwell, MA, USA: Kluwer, 2010, pp. 449-468.
33. G. Dantzig and J. H. Ramser, "The truck dispatching problem," Manage. Sci., vol. 6, pp. 80-91, Oct. 1959.
34. B. Golden and R. Wong, "Capacitated arc routing problems," Networks, vol. 11, no. 3, pp. 305-315, 1981.
35. X. Chen and Y. S. Ong, "A conceptual modeling of meme complexes in stochastic search," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 42, no. 5, pp. 1-8, Sep. 2012.
36. Y. Mei, K. Tang, and X. Yao, "Improved memetic algorithm for capacitated arc routing problem," in Proc. IEEE Congr. Evol. Comput., Trondheim, Norway, 2009, pp. 1699-1706.
37. E. W. Dijkstra, "A note on two problems in connection with graphs," Numer. Math., vol. 1, no. 1, pp. 269-271, 1959.
38. I. Borg and P. J. F. Groenen, Modern Multidimensional Scaling: Theory and Applications. Berlin, Germany: Springer, 2005.
39. C. Wang and S. Mahadevan, "Manifold alignment without correspondence," in Proc. 21st Int. Joint Conf. Artif. Intell., San Francisco, CA, USA, pp. 1273-1278, 2009.
40. F. Neri and E. Mininno, "Memetic compact differential evolution for cartesian robot control," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 54-65, May 2010.
41. C. K. Ting and C. C. Liao, "A memetic algorithm for extending wireless sensor network lifetime," Inf. Sci., vol. 180, no. 24, pp. 4818-4833, Dec. 2010.
42. S. J. L. Pan and Q. Yang, "A survey on transfer learning," IEEE Trans. Knowl. Data Eng., vol. 22, no. 10, pp. 1345-1359, Oct. 2010.
43. A. Gretton, O. Bousquet, A. Smola, and B. Schölkopf, "Measuring statistical dependence with Hilbert-Schmidt norms," in Proc. Alg. Learn. Theory, Singapore, 2005, pp. 63-77.
44. J. Zhuang, I. Tsang, and S. C. H. Hoi, "A family of simple nonparametric kernel learning algorithms," J. Mach. Learn. Res., vol. 12, pp. 1313-1347, Apr. 2011.
45. K. M. Borgwardt et al., "Integrating structured biological data by kernel maximum mean discrepancy," in Proc. Int. Conf. Intell. Syst. Mol. Biol., Fortaleza, Brazil, 2006, pp. 49-57.
46. L. Song, A. Smola, A. Gretton, and K. M. Borgwardt, "A dependence maximization view of clustering," in Proc. 24th Int. Conf. Mach. Learn., Corvallis, OR, USA, 2007, pp. 815-822.
47. B. E. Gillett and L. R. Miller, "A heuristic algorithm for the vehicledispatch problem," Oper. Res., vol. 22, no. 2, pp. 340-349, 1974.
48. G. Clarke and J. Wright, "Scheduling of vehicles from a central depot to a number of delivery points," Oper. Res., vol. 12, no. 4, pp. 568-581, 1964.
49. B. L. Golden, J. S. DeArmon, and E. K. Baker, "Computational experiments with algorithms for a class of routing problems," Comp. Oper. Res., vol. 10, no. 1, pp. 47-59, 1983.
50. G. Ulusoy, "The fleet size and mix problem for capacitated arc routing," Eur. J. Oper. Res., vol. 22, no. 3, pp. 329-337, 1985.