Metraipolis › archive › dc_575171e391da
Very large-scale neighborhood search — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Very_large-scale_neighborhood_search
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T14:32:37.145Z
- SHA-256 of the archived text
3e899b20f93baed42eb8462acef89ec653d6710372d3f51b7626ba75cfd7ddd0- Stable URL of this page
https://metraipolis.com/documento/dc_575171e391da
How to cite
Very large-scale neighborhood search — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Very_large-scale_neighborhood_search (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_575171e391da (Metraipolis archive dc_575171e391da, sha256 3e899b20f93baed42eb8462acef89ec653d6710372d3f51b7626ba75cfd7ddd0)
BibTeX
@misc{dc575171e391da,
title = {Very large-scale neighborhood search — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Very_large-scale_neighborhood_search},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_575171e391da; sha256 3e899b20f93baed42eb8462acef89ec653d6710372d3f51b7626ba75cfd7ddd0},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Very_large-scale_neighborhood_search. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»). Fonte: Wikipedia in inglese, voce «Very large-scale neighborhood search» — https://en.wikipedia.org/wiki/Very_large-scale_neighborhood_search Wikidata Q3421943 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3421943 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Very_large-scale_neighborhood_search?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1261692452, consultata il 2026-10-07T14:08:59.808Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 2a2074e48efdeb92152dcd8276a6a653ba2de8d530018f386dcbffa8b9d6b998