Solving the unconstrained optimization problem by a variable neighborhood search
From MaRDI portal
Publication:864633
DOI10.1016/j.jmaa.2006.06.025zbMath1275.90095OpenAlexW2024108781MaRDI QIDQ864633
Publication date: 12 February 2007
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2006.06.025
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes ⋮ Fitting censored quantile regression by variable neighborhood search ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Variable neighborhood search: basics and variants ⋮ Gaussian variable neighborhood search for continuous optimization ⋮ Variable neighbourhood search: methods and applications ⋮ Heuristic methods for the optimal statistic median problem ⋮ Variable neighbourhood search: Methods and applications ⋮ Two effective hybrid metaheuristic algorithms for minimization of multimodal functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimizations and tabu search based on memory
- Variable neighborhood search for the maximum clique
- Global optimization and stochastic differential equations
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- A global optimization algorithm using adaptive random search
- Global optimization and simulated annealing
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Variable neighborhood search
- A variable neighborhood search for graph coloring.
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Sequential search and its application to vehicle-routing problems
- Ant colony optimization for finding the global minimum
- Variable neighborhood search for the linear ordering problem
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Stochastic Methods for Global Optimization
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Stochastic global optimization methods part II: Multi level methods
- A controlled random search procedure for global optimisation
- A Simplex Method for Function Minimization
- Variable neighborhood search: Principles and applications
