Results 1  10
of
696
ConstraintBased Very LargeScale Neighborhood Search
"... Very LargeScale Neighborhood (VLSN) search is the idea of using neighborhoods of exponential size to find highquality solutions to complex optimization problems efficiently. However, so far, VLSN algorithms are essentially described and implemented in terms of lowlevel implementation concepts, p ..."
Abstract
 Add to MetaCart
Very LargeScale Neighborhood (VLSN) search is the idea of using neighborhoods of exponential size to find highquality solutions to complex optimization problems efficiently. However, so far, VLSN algorithms are essentially described and implemented in terms of lowlevel implementation concepts
Toward a Generic Comet Implementation of Very LargeScale Neighborhoods
, 2008
"... We describe here preliminary results of our Comet implementation of generic abstractions for Very LargeScale Neighborhoods. These neighborhoods are used in local search. Their size is exponential but the best neighbor can be computed in polynomial time. They have proven to be very efficient on a la ..."
Abstract
 Add to MetaCart
We describe here preliminary results of our Comet implementation of generic abstractions for Very LargeScale Neighborhoods. These neighborhoods are used in local search. Their size is exponential but the best neighbor can be computed in polynomial time. They have proven to be very efficient on a
Very LargeScale Neighborhood Search for the Quadratic Assignment Problem
 DISCRETE APPLIED MATHEMATICS
, 2002
"... The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NPhard, and can be solved to optimality only for fairly small size instances ..."
Abstract

Cited by 150 (13 self)
 Add to MetaCart
computational results of our algorithms on standard benchmark instances. These investigations reveal that very largescale neighborhood search algorithms give consistently better solutions compared the popular 2exchange neighborhood algorithms considering both the solution time and solution accuracy.
Very LargeScale Neighborhood Search: Overview and Case Studies on Coloring Problems
, 2008
"... Two key issues in local search algorithms are the definition of a neighborhood and the way to examine it. In this chapter we consider techniques for examining very large neighborhoods, in particular, ways for exactly searching them. We first illustrate such techniques using three paradigmatic examp ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
examples. In the largest part of the chapter, we focus on the development and experimental study of very largescale neighborhood search algorithms for two coloring problems. The first example concerns the wellknown (vertex) graph coloring problem. Despite initial promising results on the use of very largescale
Very LargeScale Neighborhood Search Techniques in Timetabling Problems.”
 In Practice and Theory of Automated Timetabling VI, edited by Edmund Burke and Hana Rudová, 3867:24–39. Lecture Notes in Computer Science.
, 2007
"... Abstract. We describe the use of very largescale neighborhood search (VLSN) techniques in examination timetabling problems. We detail three applications of VLSN algorithms that illustrate the versatility and potential of such algorithms in timetabling. The first of these uses cyclic exchange neigh ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We describe the use of very largescale neighborhood search (VLSN) techniques in examination timetabling problems. We detail three applications of VLSN algorithms that illustrate the versatility and potential of such algorithms in timetabling. The first of these uses cyclic exchange
Local search with very largescale neighborhoods for optimal permutations in machine translation
 In Proc. of the Workshop on Computationally Hard Problems and Joint Inference
, 2006
"... We introduce a novel decoding procedure for statistical machine translation and other ordering tasks based on a family of Very LargeScale Neighborhoods, some of which have previously been applied to other NPhard permutation problems. We significantly generalize these problems by simultaneously con ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We introduce a novel decoding procedure for statistical machine translation and other ordering tasks based on a family of Very LargeScale Neighborhoods, some of which have previously been applied to other NPhard permutation problems. We significantly generalize these problems by simultaneously
Very LargeScale Neighborhood Search Algorithms for the Design of Service Overlay Networks
"... Service Overlay Networks (SONs) allow virtual operators to create and deploy valueadded Internet services with Quality of Service guarantees, while leaving the underlying network infrastructure unchanged. The deployment of a SON can be very expensive, and hence its planning requires careful decisio ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
of SONs that combines polynomial size and very largescale neighborhoods. The very largescale neighborhood of the solution given by tabu search is explored efficiently to obtain in a short time a new one that is both far from the current solution and costdecreasing. We provide numerical results
A very large scale neighborhood search algorithm for the quadratic assignment problem
 JOURNAL ON COMPUTING
, 2002
"... Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computation time. An improvement algorith ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
classes of very large scale neighborhood search (VLSN) algorithms: (1) variable depth
Very largescale neighborhoods with performance guarantees for minimizing makespan on parallel machines
 APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2007), VOLUME 2909 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2008
"... ..."
A MultiStage Very LargeScale Neighborhood Search for the Vehicle Routing Problem with Soft TimeWindows
, 2011
"... This paper considers the VRP Problem with Soft TimeWindows (VRPSTW), a challenging routing problem due to its combination of hard time windows and a lexicographic objective function minimizing the number of vehicles, the violations of the soft time windows, and the total travel distance. The paper ..."
Abstract
 Add to MetaCart
presents a multistage, variable neighborhood search algorithm for the VRPSTW, which uses the same very largescale neighborhood (VLSN) for each of its three steps with different objective functions. Experimental results indicate that the multistage VLSN algorithm improves bestknown solutions on 90
Results 1  10
of
696