Attraction probabilities in variable neighborhood search
From MaRDI portal
Publication:989828
DOI10.1007/S10288-009-0108-XzbMATH Open1193.90216OpenAlexW1979173729MaRDI QIDQ989828FDOQ989828
Authors: Jack Brimberg, Pierre Hansen, Nenad Mladenović 
Publication date: 23 August 2010
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-009-0108-x
Recommendations
- Variable neighborhood search
- Variable Neighborhood Search
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search
- Variable neighbourhood search: methods and applications
- Variable neighbourhood search: Methods and applications
- Fundamentals of variable neighborhood search
- scientific article
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Continuous location (90B85)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighbourhood search: Methods and applications
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Heuristic Methods for Location-Allocation Problems
- Exact and approximate solutions to the multisource weber problem
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- A new adaptive multi-start technique for combinatorial global optimizations
- Efficiency of local search with multiple local optima
- Variable neighborhood search for the p-median
- On the convergence of generalized hill climbing algorithms
- Tabu search and finite convergence
- On the convergence of tabu search
- Analyzing the performance of local search algorithms using generalized hill climbing algorithms
Cited In (30)
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- New heuristic for harmonic means clustering
- Generating good starting solutions for the \(p\)-median problem in the plane
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- A heuristic hybrid framework for vector job scheduling
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- Variable neighborhood search for harmonic means clustering
- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
- Variable neighborhood search: the power of change and simplicity
- Algorithms with greedy heuristic procedures for mixture probability distribution separation
- A new heuristic for solving the \(p\)-median problem in the plane
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs
- Candidate groups search for K-harmonic means data clustering
- Solving the capacitated clustering problem with variable neighborhood search
- Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics
- Fat-tailed distributions for continuous variable neighborhood search
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
- A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
- A recipe for finding good solutions to MINLPs
- A local search algorithm for the single machine scheduling problem with setups and a storage
- A multi-start variable neighborhood search for solving the single path multicommodity flow problem
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- Less is more approach in optimization: a road to artificial intelligence
- Using injection points in reformulation local search for solving continuous location problems
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Hitting times of local and global optima in genetic algorithms with very high selection pressure
- A new local search for continuous location problems
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
Uses Software
This page was built for publication: Attraction probabilities in variable neighborhood search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989828)
