In the field of automatic programming (AP), the solution of a problem is a program, which is usually represented by an AP-tree. A tree is built using functional and terminal nodes. For solving AP problems, we propose a new neighborhood structure that adapts the classical “elementary tree transformation” (ETT) into this specific AP-tree. The ETT is the process of removing an edge and adding another one to obtain a new feasible tree. Experimental comparison with reduced VNP, i.e., with VNP without local search, genetic programming, and artificial bee colony programming shows clearly advantages of the new proposed BVNP method, in terms of speed of convergence and computational stability.

在自动编程（AP）领域，问题的解决方案是程序，通常由AP树表示。使用功能和终端节点构建树。为了解决AP问题，我们提出了一种新的邻域结构，该结构将经典的“基本树变换”（ETT）适配到此特定的AP树中。ETT是删除边缘并添加另一个边缘以获得新的可行树的过程。使用减少的VNP进行的实验比较，即不使用局部搜索的VNP，遗传编程和人工蜂群编程，在收敛速度和计算稳定性方面，清楚地表明了新提出的BVNP方法的优势。