Attraction probabilities in variable neighborhood search
From MaRDI portal
Publication:989828
DOI10.1007/s10288-009-0108-xzbMath1193.90216OpenAlexW1979173729MaRDI QIDQ989828
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
Continuous location (90B85) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics, A new heuristic for solving the \(p\)-median problem in the plane, A recipe for finding good solutions to MINLPs, Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems, Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, A variable neighborhood search based algorithm for finite-horizon Markov decision processes, New heuristic for harmonic means clustering, A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes, Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs, Variable neighborhood search: the power of change and simplicity, A multi-start variable neighborhood search for solving the single path multicommodity flow problem, Variable neighborhood search for harmonic means clustering, Fast metaheuristics for the discrete \((r|p)\)-centroid problem, Solving the capacitated clustering problem with variable neighborhood search, A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem, A new local search for continuous location problems, Candidate groups search for K-harmonic means data clustering, Minimizing Piecewise-Concave Functions Over Polyhedra, A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage, Algorithms with greedy heuristic procedures for mixture probability distribution separation, 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, A heuristic hybrid framework for vector job scheduling, Using injection points in reformulation local search for solving continuous location problems, Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times, Hitting times of local and global optima in genetic algorithms with very high selection pressure, Generating good starting solutions for the p-median problem in the plane, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Uses Software
Cites Work
- Unnamed Item
- Variable neighbourhood search: Methods and applications
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A new adaptive multi-start technique for combinatorial global optimizations
- Variable neighborhood search
- Tabu search and finite convergence
- On the convergence of generalized hill climbing algorithms
- Efficiency of Local Search with Multiple Local Optima
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search for the p-median
- Heuristic Methods for Location-Allocation Problems
- Exact and approximate solutions to the multisource weber problem
- On the convergence of tabu search
- Variable neighborhood search: Principles and applications
