পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| ভেরিয়েবল নেইবারহুড সার্চ (VNS)× | Simulated annealing× | |
|---|---|---|
| ক্ষেত্র | অনুকূলকরণ | অনুকূলকরণ |
| পরিবার | Process / pipeline | Process / pipeline |
| উদ্ভবের বছর≠ | 1997 | 1983 |
| প্রবর্তক | — | — |
| ধরন≠ | Metaheuristic — neighborhood-based | Probabilistic metaheuristic / local search |
| মৌলিক উৎস≠ | Mladenović, N. & Hansen, P. (1997). Variable Neighborhood Search. Computers & Operations Research, 24(11), 1097–1100. DOI ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| অপর নাম | VNS, Değişken Komşuluk Araması (VNS), variable neighbourhood search | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| সম্পর্কিত≠ | 4 | 5 |
| সারসংক্ষেপ≠ | Variable Neighborhood Search (VNS) is a metaheuristic optimization framework introduced by Mladenović and Hansen in 1997. It escapes local optima by systematically switching among a predefined set of neighborhood structures — first perturbing the current solution (shaking) to reach a different region of the search space, then applying a local search within that region, and finally accepting the new solution only if it improves the incumbent. The method is flexible enough to handle combinatorial problems (routing, scheduling, graph problems) as well as continuous optimization, making it one of the most widely used neighborhood-based metaheuristics in operations research. | Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems. |
| ScholarGateডেটাসেট ↗ |
|
|