Variable Neighborhood Programming as a Tool of Machine Learning

Nenad Mladenovic (), Bassem Jarboui (), Souhir Elleuch (), Rustam Mussabayev () and Olga Rusetskaya ()
Additional contact information
Nenad Mladenovic: Khalifa University
Bassem Jarboui: Higher Colleges of Technology
Souhir Elleuch: Qassim University
Rustam Mussabayev: Institute of Information and Computational Technologies
Olga Rusetskaya: Saint Petersburg State University of Economics

A chapter in Black Box Optimization, Machine Learning, and No-Free Lunch Theorems, 2021, pp 221-271 from Springer

Abstract: Abstract Automatic programming is an efficient technique that has contributed to an important development in the artificial intelligence and machine learning fields. In this chapter, we introduce the technique called Variable Neighborhood Programming (VNP) that was inspired by the principle of the Variable Neighborhood Search (VNS) algorithm. VNP starts from a single solution presented by a program, and the search for a good quality global solution (program) continues by exploring different neighborhoods. The goal of our algorithm is to generate a good representative program adequate to a selected problem. VNP takes the advantages of the systematic change of neighborhood structures randomly or within a local search algorithm to diversify or intensify search through the solution space. To show its efficiency and usefulness, the VNP method is applied first for solving the symbolic regression problem (VNP-SRP) and tested and compared on usual test instances from the literature. In addition, the VNP-SRP method is tested in finding formulas for life expectancy as a function of some health care economic factors in 18 Russian districts. Finally, the VNP is implemented on prediction and classification problems and tested on real-life maintenance railway problems from the US railway system.

Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-66515-9_9

Ordering information: This item can be ordered from
http://www.springer.com/9783030665159

DOI: 10.1007/978-3-030-66515-9_9

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().