Authors: Elleuch, Souhir
Hansen, Pierre
Jarboui, Bassem
Mladenović, Nenad 
Title: New VNP for automatic programming
Journal: Electronic Notes in Discrete Mathematics
Volume: 58
First page: 191
Last page: 198
Issue Date: 1-Apr-2017
ISSN: 1571-0653
DOI: 10.1016/j.endm.2017.03.025
In this paper we propose a new local search method for solving automatic programming problem and we use it within recent Variable Neighborhood Programming (VNP) method. In automatic programming area the solution is a program and the most common way is to present it by a tree T with the specific structure (i.e., it has different types of nodes). New local search tries to adapt well known “elementary tree transformation” in generating neighboring trees (programs) N (T) to the incumbent tree T. Several other neighborhoods Nk (T) are used for the shaking step of the VNP. Method is implemented on some typical problems from the literature. Results are compared with the old VNP method.
Keywords: Automatic programming | local search | variable neighborhood programming
Publisher: Elsevier

Show full item record


checked on Jun 18, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.