 |
    |
VLR: A Memory-Based Optimization Heuristic
Hansang Yun, Myoung Hoon Ha, and Robert Ian McKay
School of Computer Science and Engineering, Seoul National University, Seoul, 151-744, Republic of KoreaAbstract. We suggest a novel memory-based metaheuristic optimization algorithm, VLR, which uses a list of already-visited areas to more effectively search for an optimal solution. We chose the Max-cut problem to test its optimization performance, comparing it with state-of-the-art methods.VLRdominates the previous best-performing heuristics.We also undertake preliminary analysis of the algorithm’s parameter space, noting that a larger memory improves performance. VLR was designed as a general-purpose optimization algorithm, so its performance on other problems will be investigated in future.
Keywords: Optimization, Metaheuristics, Max-cut problem, memory
LNCS 8672, p. 151 ff.
lncs@springer.com
© Springer International Publishing Switzerland 2014