Adopting gene expression programming to generate extension strategies for incompatible problem

摘要

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.