scientific article; zbMATH DE number 1062113
From MaRDI portal
Publication:4354785
This book presents in a precise, complete and simple way the essentials about the tabu search heuristic. After a clear introduction to the background principles of the tabu search heuristic, four chapters are reserved for the analyse and classification of the possible variants of the memory structures (short and long term memory), which are the fundamental components of the heuristic. Other important aspects to be considered when implementing a tabu search are discussed and described (frequency, quality, influence and recency aspects). A more technical chapter is dedicated on tabu search techniques for integer programming. In particular, it explains, with simple examples, how a tabu search heuristic can be used to guide the resolution of mixed integer linear problems, improving the pivoting process for finding the optimal solution. Another important chapter, even if a little bit more philosophical, explains the relation between simulated annealing, genetic algorithms and tabu search heuristics. Finally, a quite complete references list of possible applications is given, from parallel computing to financial analysis. In conclusion, ``Tabu search is not only a book on the tabu heuristics, which should rise interest for mathematically mature audience who intend to implement such an heuristic, but also a complete analyse and clever approach of a new family of heuristic which should be one of the most promising heuristics in the future. Course work in operations research science and computer science are sufficient background.
Cited in
(only showing first 100 items - show all)- A ring-mesh topology design problem for optical transport networks
- A route set construction algorithm for the transit network design problem
- Analysis of new variable selection methods for discriminant analysis
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
- A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
- A survey on metaheuristics for stochastic combinatorial optimization
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- The single-finger keyboard layout problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- A robust and efficient algorithm for planar competitive location problems
- Combined location-routing problems -- a neural network approach
- Optimal location with equitable loads
- The multiple server center location problem
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- MILP approach to pattern generation in logical analysis of data
- A tabu search approach for the minimum sum-of-squares clustering problem
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
- A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points
- GRASP and path relinking for the max-min diversity problem
- A solution method for a car fleet management problem with maintenance constraints
- AEGIS---attribute experimentation guiding improvement searches
- A cross entropy based algorithm for reliability problems
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- Solving a comprehensive model for multiobjective project portfolio selection
- A search space ``cartography for guiding graph coloring heuristics
- Solving a manpower scheduling problem for airline catering using metaheuristics
- A variable selection method based on Tabu search for logistic regression models
- Heuristic algorithms for the multi-depot ring-star problem
- Feasibility pump 2.0
- Solving a minimum-power covering problem with overlap constraint for cellular network design
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- The traveling salesman problem: An overview of exact and approximate algorithms
- Stochastic vehicle routing
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- Tabu search when noise is present: An illustration in the context of cause and effect analysis
- An efficient tabu search procedure for the p-median problem
- Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems
- Optimization by ghost image processes in neural networks
- Tabu search performance on the symmetric travelling salesman problem
- Applying tabu search with influential diversification to multiprocessor scheduling
- Genetic algorithms and tabu search: Hybrids for optimization
- Graph domination, tabu search and the football pool problem
- General purpose heuristics for integer programming. I
- Using tabu search for solving a dynamic multi-terminal truck dispatching problem
- Resource-constrained project scheduling: A critical activity reordering heuristic
- Neighborhood search heuristics for the uncapacitated facility location problem
- Nurse rostering problems -- a bibliographic survey.
- A tabu search algorithm for self-healing ring network design.
- Upper and lower bounds for the single source capacitated location problem.
- Variable neighborhood tabu search and its application to the median cycle problem.
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Local search for shift design.
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- GRASP and path relinking for the matrix bandwidth minimization.
- GRASP for set packing problems.
- Global optimization and multi knapsack: a percolation algorithm.
- Locating service facilities whose reliability is distance dependent.
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- Using penalty function and tabu search to solve cell formation problems with fixed cell cost.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
- The theory of elementary landscapes
- A hybrid genetic algorithm for the open shop scheduling problem
- Tabu search for DNA sequencing with false negatives and false positives
- Service network design in freight transportation
- Heuristics for cardinality constrained portfolio optimization
- Linearity in the traveling salesman problem
- Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
- Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
- Digital data networks design using genetic algorithms
- Recent developments and trends in global optimization
- Evolution and state-of-the-art in integer programming
- Combinatorial optimization: current successes and directions for the future
- Real-time multiserver and multichannel systems with shortage of maintenance crews.
- Design and implementation of a course scheduling system using Tabu Search
- Optimal reference subset selection for nearest neighbor classification by tabu search
- Tabu search and finite convergence
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- Heuristic solutions to multi-depot location-routing problems
- Real-time system with homogeneous servers and nonidentical channels in steady-state
- A note on global optimization in adaptive control, econometrics and macroeconomics.
- Probabilistic satisfiability with imprecise probabilities
- Determining buffer location and size in production lines using tabu search
- Search strategies for the feeder bus network design problem
- A tabu search heuristic procedure for the fixed charge transportation problem
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Solution of large weighted equicut problems
- A tabu search algorithm for the bipartite drawing problem
- Global optimization for artificial neural networks: A tabu search application
- Proposals for chunking and tabu search
- Solving zero-one mixed integer programming problems using tabu search
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- Heuristic search to the capacitated clustering problem
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- Cost optimization of a repairable M/G/1 queue with a randomized policy and single vacation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354785)
