About: Very large-scale neighborhood search

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Very large-scale neighborhood search Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Rule105846932, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FVery_large-scale_neighborhood_search

In mathematical optimization, neighborhood search is a technique that tries to find good or near-optimal solutions to a combinatorial optimisation problem by repeatedly transforming a current solution into a different solution in the neighborhood of the current solution. The neighborhood of a solution is a set of similar solutions obtained by relatively simple modifications to the original solution. For a very large-scale neighborhood search, the neighborhood is large and possibly exponentially sized.

Attributes	Values
rdf:type	topical concept yago:WikicatOptimizationAlgorithmsAndMethods yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Heuristic105847956 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:WikicatHeuristics yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label	Recherche locale à grand voisinage (fr) Very large-scale neighborhood search (en)
rdfs:comment	En optimisation, une méthode de recherche locale à grand voisinage est un algorithme de recherche locale dont la définition de voisinage est potentiellement de taille exponentielle. (fr) In mathematical optimization, neighborhood search is a technique that tries to find good or near-optimal solutions to a combinatorial optimisation problem by repeatedly transforming a current solution into a different solution in the neighborhood of the current solution. The neighborhood of a solution is a set of similar solutions obtained by relatively simple modifications to the original solution. For a very large-scale neighborhood search, the neighborhood is large and possibly exponentially sized. (en)
dcterms:subject	Optimization algorithms and methods
Wikipage page ID	21706433 (xsd:integer)
Wikipage revision ID	985856772 (xsd:integer)
Link from a Wikipage to another Wikipage	Mathematical optimization Neighbourhood (mathematics) Simulated Annealing Tabu search Optimization algorithms and methods Local search (optimization)
Link from a Wikipage to an external page	http://jorlin.scripts.mit.edu/docs/publications/79-very%20large%20scale%20neighb.pdf
sameAs	Very large-scale neighborhood search Very large-scale neighborhood search Very large-scale neighborhood search Very large-scale neighborhood search Very large-scale neighborhood search
dbp:wikiPageUsesTemplate	dbt:Citation dbt:One_source dbt:Refbegin dbt:Refend dbt:Math-stub
has abstract	En optimisation, une méthode de recherche locale à grand voisinage est un algorithme de recherche locale dont la définition de voisinage est potentiellement de taille exponentielle. (fr) In mathematical optimization, neighborhood search is a technique that tries to find good or near-optimal solutions to a combinatorial optimisation problem by repeatedly transforming a current solution into a different solution in the neighborhood of the current solution. The neighborhood of a solution is a set of similar solutions obtained by relatively simple modifications to the original solution. For a very large-scale neighborhood search, the neighborhood is large and possibly exponentially sized. The resulting algorithms can outperform algorithms using small neighborhoods because the local improvements are larger. If neighborhood searched is limited to just one or a very small number of changes from the current solution, then it can be difficult to escape from local minima, even with additional meta-heuristic techniques such as Simulated Annealing or Tabu search. In large neighborhood search techniques, the possible changes from one solution to its neighbor may allow tens or hundreds of values to change, and this means that the size of the neighborhood may itself be sufficient to allow the search process to avoid or escape local minima, though additional meta-heuristic techniques can still improve performance. (en)
gold:hypernym	Technique
prov:wasDerivedFrom	wikipedia-en:Very_large-scale_neighborhood_search?oldid=985856772&ns=0
page length (characters) of wiki page	1961 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Very_large-scale_neighborhood_search
is Link from a Wikipage to another Wikipage of	Constraint satisfaction problem List of RNA structure prediction software Capacitated minimum spanning tree
is foaf:primaryTopic of	wikipedia-en:Very_large-scale_neighborhood_search

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software