Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
From MaRDI portal
Publication:1327232
DOI10.1016/0166-218X(94)90211-9zbMath0799.90109OpenAlexW2142517503MaRDI QIDQ1327232
Publication date: 27 November 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)90211-9
Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05) Sensitivity, stability, parametric optimization (90C31) Genetics and population dynamics (92D99)
Related Items
Hybrid evolutionary search for the minimum sum coloring problem of graphs, Integrating and accelerating tabu search, simulated annealing, and genetic algorithms, Genetic algorithms and tabu search: Hybrids for optimization, Finding local optima of high-dimensional functions using direct search methods, An effective heuristic algorithm for the partial shop scheduling problem, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, Genetic and hybrid algorithms for graph coloring, Metaheuristics: A bibliography, Scatter search for chemical and bio-process optimization, A scatter search-based heuristic to locate capacitated transshipment points, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, Dealing with repetitions in sequencing by hybridization, A model for designing callable bonds and its solution using tabu search, “MOSS-II” Tabu/Scatter Search for Nonlinear Multiobjective Optimization, Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search., Heuristics from Nature for Hard Combinatorial Optimization Problems, Multi-objective meta-heuristics for the traveling salesman problem with profits, Infeasible/feasible search trajectories and directional rounding in integer programming, A survey on optimization metaheuristics, Adaptive memory in multistart heuristics for multicommodity network design, Hybrid scatter tabu search for unconstrained global optimization, Heuristic algorithms for the maximum diversity problem, An evolutionary method for complex-process optimization, Cooperative parallel SAT local search with path relinking, Scatter search --- wellsprings and challenges, Principles of scatter search, ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization, Scatter search with path relinking for phylogenetic inference, A path relinking approach with ejection chains for the generalized assignment problem, Experimental testing of advanced scatter search designs for global optimization of multimodal functions, A hybrid metaheuristic method for the maximum diversity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Layering strategies for creating exploitable structure in linear and integer programs
- The tabu search metaheuristic: How we used it
- Future paths for integer programming and links to artificial intelligence
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- An Improved Successive Linear Programming Algorithm
- A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Mathematical Programming
