Prof. Nenad Mladenović
Dr. Nenad Mladenovic, a member of the European academy of sciences (Academia Europea), and currently a full professor at Khalifa University, Abu Dhabi, UAE. He leads or participates in several international research projects in the United Kingdom, France, China, Russia, Kazakhstan, and Serbia. He has taught in several countries, including France, the United Kingdom, Canada, Belgium, Serbia, and the UAE. Dr. Mladenovic is a highly cited researcher and has more than 22,000 citations according to Google scholar. His paper on the VNS metaheuristi with P. Hansen was selected among the 30 most influential published in EJOR in the 30-year history of EJOR and ranked as 8th most cited in 40 years of EJOR.
Introduction to Variable Neighborhood Search metaheuristic
Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems whose basic idea is a systematic change of neighborhood structures both within a descent phase to find a local optimum and in a perturbation phase to get out of the corresponding valley. I will present the basic schemes of VNS and some of its extensions: Reduced VNS; VN Descent; General VNS; Skewed VNS; VN Decomposition Search. I will also present some families of applications in which VNS has proven to be very successful, such as: exact solution of large scale location problems by primal-dual VNS; generation of solutions to large mixed integer linear programs, by hybridization of VNS and local branching; generation of solutions to very large mixed integer programs using VNS decomposition and exact solvers, etc.