A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
From MaRDI portal
Publication:1303783
DOI10.1023/A:1008761113491zbMath0970.90053OpenAlexW1508581875MaRDI QIDQ1303783
Publication date: 14 October 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008761113491
global optimizationsimulated annealingrelative performancecontrolled random searchinteger and mixed integer programming problems
Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (19)
A modified real coded genetic algorithm for constrained optimization ⋮ A new crossover operator for real coded genetic algorithms ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ An auxiliary function method for global minimization in integer programming ⋮ Shrinking hypersphere based trajectory of particles in PSO ⋮ A hybrid discrete grey wolf optimizer to solve weapon target assignment problems ⋮ Identifying a global optimizer with filled function for nonlinear integer programming ⋮ A new selection operator for genetic algorithms that balances between premature convergence and population diversity ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Discrete filled function method for discrete global optimization ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems ⋮ A new mutation operator for real coded genetic algorithms ⋮ An efficient imperialist competitive algorithm for solving the QFD decision problem ⋮ Quadratic approximation based hybrid genetic algorithm for function optimization ⋮ Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming ⋮ A real coded genetic algorithm for solving integer and mixed integer optimization problems ⋮ An improved partial enumeration algorithm for integer programming problems ⋮ Reference direction interactive method for solving multiobjective fuzzy programming problems ⋮ An interactive satisficing method for solving multiobjective mixed fuzzy-stochastic programming problems
This page was built for publication: A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
