Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
We survey three broad classes of very large-scale neighborhood search (VLSN) algorithms: (1) variable-depth methods in which large neighborhoods are searched heuristically, (2) large neighborhoods in which the neighborhoods are searched using network flow techniques or dynamic programming, and (3) large neighborhoods ...
Nov 15, 2002
Researchers have used various techniques for developing good neighborhood functions that lead to effective VLSN search algorithms. This includes multi-exchange ...
We describe the use of very large-scale neighborhood search (VLSN) techniques in examination timetabling problems. We detail three applications of VLSN ...
This paper outlines a network optimization based methodology to search the neighborhood efficiently and presents a proof of concept by applying it to the ...
Very large-scale neighborhood search : Theory , algorithms and applications ... A general paradigm to design very large-scale neighbourhood search algorithms ...
Sep 1, 2000 · This paper outlines a network optimization based methodology to search the neighborhood efficiently and presents a proof of concept.
Abstract: We propose a metaheuristic algorithm for the multi-resource generalized assignment problem (MRGAP). MRGAP is a generalization of the generalized ...
We present a Variable Neighborhood Search (VNS) approach which uses three different neighborhood types. Two of them work in complementary ways in order to ...
Feb 15, 2011 · This article concentrates on neighborhood search algorithms where the size of the neighborhood is “very large” with respect to the size of the ...
This paper concentrates on neighborhood search algorithms where the size of the neighborhood is "very large" with respect to the size of the input data and in ...