• Jul 03, 2017 News!Good News! Since 2017, IJMLC has been indexed by Scopus!
  • Aug 15, 2017 News![CFP] 2017 the annual meeting of IJMLC Editorial Board, ACMLC 2017, will be held in Singapore, December 8-10, 2017.   [Click]
  • Sep 09, 2017 News!Vol.7, No.4 has been published with online version.   [Click]
Search
General Information
Editor-in-chief
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2014 Vol.4(3): 263-270 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2014.V4.422

Recursive Variable Neighborhood Search

Mohammad R. Raeesi N. and Ziad Kobti
Abstract—Variable Neighborhood Search (VNS) is one of the most recent metaheuristics to solve optimization problems. A new variant of VNS is introduced in this article called Recursive VNS (R-VNS). The proposed R-VNS incorporates recursive methods in order to improve both the exploration and exploitation capability of the basic VNS. The experiments show that the proposed R-VNS outperforms the basic VNS by offering better solutions as well as higher convergence rate. The case study considers classical Job Shop Scheduling Problem in order to evaluate both proposed methods.

Index Terms—Job shop scheduling problem, recursive programing, variable neighborhood search.

M. R. Raeesi N. and Z. Kobti are with School of Computer Science, University of Windsor, Windsor, ON N9B 3P4 (e-mail: raeesim@uwindsor.ca, kobti@uwindsor.ca).

[PDF]

Cite: Mohammad R. Raeesi N. and Ziad Kobti, "Recursive Variable Neighborhood Search," International Journal of Machine Learning and Computing vol.4, no. 3, pp. 263-270, 2014.

Copyright © 2008-2015. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net