作者: Hansang Yun , Myoung Hoon Ha , Robert Ian McKay
DOI: 10.1007/978-3-319-10762-2_15
关键词:
摘要: We suggest a novel memory-based metaheuristic optimization algorithm, VLR, which uses list of already-visited areas to more effectively search for an optimal solution. chose the Max-cut problem test its performance, comparing it with state-of-the-art methods.VLRdominates previous best-performing heuristics.We also undertake preliminary analysis algorithm’s parameter space, noting that larger memory improves performance. VLR was designed as general-purpose so performance on other problems will be investigated in future.