Tabu search techniques. A tutorial and an application to neural networks
From MaRDI portal
Publication:1120479
DOI10.1007/BF01720782zbMath0672.90089OpenAlexW125070839MaRDI QIDQ1120479
Alain Hertz, Dominique de Werra
Publication date: 1989
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01720782
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)
Related Items
A tabu search algorithm for computing an operational timetable, A review of combinatorial problems arising in feedforward neural network design, A user's guide to tabu search, Dynamic tabu list management using the reverse elimination method, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, A tabu search experience in production scheduling, On the use of some known methods for \(T\)-colorings of graphs, A tabu search procedure for multicommodity location/allocation with balancing requirements, Solving the maximum clique problem using a tabu search approach, Tabu search applied to the general fixed charge problem, Statistical search methods for lotsizing problems, État de l'art des méthodes “d'optimisation globale”, Optimization by ghost image processes in neural networks, Applying tabu search with influential diversification to multiprocessor scheduling, Genetic algorithms and tabu search: Hybrids for optimization, FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES, Solving transportation problems with nonlinear side constraints with tabu search, Construction of exact D-optimal designs by tabu search, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Reducing ergonomic risks by job rotation scheduling, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Local search with memory: Benchmarking RTS, Scatter search and star-paths: Beyond the genetic metaphor, Heuristic solution approaches to operational forest planning problems, A tabu search approach for solving a difficult forest harvesting machine location problem, Improving local search heuristics for some scheduling problems. I, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, Tabu search for graph partitioning, A tabu thresholding algorithm for arc crossing minimization in bipartite graphs, Metaheuristics: A bibliography, Hybrid meta-heuristic algorithms for solving network design problem, Introduction to computation and learning in artificial neural networks, Heuristics from Nature for Hard Combinatorial Optimization Problems, Symbiotic Evolution to Avoid Linkage Problem, Essential particle swarm optimization queen with tabu search for MKP resolution, Finding a feasible course schedule using Tabu search, Optimizing the system of virtual paths by tabu search., Implementation of a university course and examination timetabling system, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, EPCOT: An efficient procedure for coloring optimally with Tabu Search, A simple tabu search method to solve the mixed-integer linear bilevel programming problem, Massively parallel analog tabu search using neural networks applied to simple plant location problems, Comparison of iterative improvement techniques for schedule optimization, An efficient tabu search procedure for the \(p\)-median problem, The combinatorics of timetabling, Constructing a course schedule by solving a series of assignment type problems, Some experiments with simulated annealing techniques for packing problems, Tabu search for large scale timetabling problems, A tabu search heuristic procedure for the fixed charge transportation problem, Global optimization for artificial neural networks: A tabu search application, A tabu search algorithm for assigning teachers to courses.
Cites Work
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- On the convergence of stationary distributions in simulated annealing algorithms
- The tabu search metaheuristic: How we used it
- Future paths for integer programming and links to artificial intelligence
- Neural networks and physical systems with emergent collective computational abilities.
