Abstract
Exploring solving strategies for incompatible problem is a challenging task. Although extension strategy generating method (ESGM) can address incompatible problem by expanding reasoning and extension transformations, the solving process often suffers a combination explosion of computational cost. In order to overcome this shortcoming, a new approach to performing extension transformations based on gene expression programming (GEP) is proposed. The method is able to establish superior operations of extension transformations heuristically and iteratively, which avoids the combination explosion effectively. In order to make GEP adapt to such applying requirement, chromosome architecture, decoding mode, individual selection and convergence criteria are restudied. The proposed method is illustrated with the application of ESGM to a self-guided touring route design problem. Numerical results verify that the proposed method helps provide extension strategies efficiently and has a huge potential for more complex incompatible problem solving.
Similar content being viewed by others
References
Luger GF (2003) Artificial intelligence—structures and strategies for complex problem solving. China Machine Press, Beijing
Carneiro D, Novais P, Neves J (2013) Using genetic algorithms to create solutions for conflict resolution. Neurocomputing 109(SI):13–23
Chen DB, Zhao CX, Zhang HF (2011) An improved cooperative particle swarm optimization and its application. Neural Comput Appl 20:171–182
Kotliarov EV, Petrushina TI (2014) Hybrid neural network for classification problem solving [J]. Cent Eur J Comput Sci 4(2):86–94
Xu YT, Wang LS, Zhong P (2012) A rough margin-based m-twin support vector machine. Neural Comput Appl 21:1307–1317
Yan AJ, Shao HS, Wang P (2015) A soft-sensing method of dissolved oxygen concentration by group genetic case-based reasoning with integrating group decision making. Neurocomputing 169(2):422–429
Du Y, Liang F, Sun Y (2012) Integrating spatial relations into case-based reasoning to solve geographic problems. Knowl Based Syst 33:111–123
Dymova L, Sevastjanov P (2014) A new approach to the rule-base evidential reasoning in the intuitionistic fuzzy setting. Knowl Based Syst 61:109–117
Lee GH (2008) Rule-based and case-based reasoning approach for internal audit of bank. Knowl Based Syst 21(2):140–147
Li LX, Li HW (2006) Primary research on methods and techniques of extension strategy generating. Math Pract Theory 36(1):190–193
Yang CY, Cai W (2013) Extenics: theory, method and application. Science Press, Beijing
Zhao YW, Su N (2010) Extension design. Science Press, Beijing
Ferreira C (2001) Gene expression programming in problem solving. In: 6th Online World Conference on Soft Computing in Industrial Applications
Azamathulla HM, Ahmad Z, Ghani AA (2013) An expert system for predicting Manning’s roughness coefficient in open channels by using gene expression programming. Neural Comput Appl 23:1343–1349
Azamathulla HM (2013) Gene-expression programming to predict friction factor for Southern Italian rivers. Neural Comput Appl 23:1421–1426
Zhang K, Sun S (2013) Web music emotion recognition based on higher effective gene expression programming. Neurocomputing 105(1):100–106
Karakasis VK, Stafylopatis A (2008) Efficient evolution of accurate classification rules using a combination of gene expression programming and clonal selection. IEEE Trans Evol Comput 12(6):662–678
Zuo J, Tang CJ, Li C (2004) Time series prediction based on gene expression programming. In: 5th International Conference on Web-Age Information Management, vol 3129. Dalian, China, pp 55–64
Zhang YQ, Pu YF, Zhang HS (2013) Using gene expression programming to infer gene regulatory networks from time-series data. Comput Biol Chem 47:198–206
Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
Tang L, Wang H, Li GY, Xu FX (2013) Adaptive heuristic search algorithm for discrete variable based multi-objective optimization. Struct Multi discip Optim 48:821–836
Acknowledgments
This paper is sponsored by National Natural Science Foundation Project (61503085); National Natural Science Foundation Project (61273306); Science and Technology Planning Project of Guangdong Province (2012B061000012); and “Strengthening school by innovation” Project from Department of Education of Guangdong Province (261555116).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tang, L., Yang, C. & Li, W. Adopting gene expression programming to generate extension strategies for incompatible problem. Neural Comput & Applic 28, 2649–2664 (2017). https://doi.org/10.1007/s00521-016-2211-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-016-2211-1