Meta-heuristics have developed dramatically since their inception in the early 1980s. They have had widespread success in attacking a variety of practical and difficult combinatorial optimization problems. These families of approaches include, but are not limited to greedy random adaptive search procedures, genetic algorithms, problem-space search, neural networks, simulated annealing, tabu search, threshold algorithms, and their hybrids. They incorporate concepts based on biological evolution, intelligent problem solving, mathematical and physical sciences, nervous systems, and statistical mechanics. Since the 1980s, a great deal of effort has been invested in the field of combinatorial optimization theory in which heuristic algorithms have become an important area of research and applications. This volume is drawn from the first conference on Meta-Heuristics and contains 41 papers on the state-of-the-art in heuristic theory and applications. The book treats the following meta-heuristics and applications: Genetic Algorithms, Simulated Annealing, Tabu Search, Networks & Graphs, Scheduling and Control, TSP, and Vehicle Routing Problems. It represents research from the fields of Operations Research, Management Science, Artificial Intelligence and Computer Science.
Les mer
These families of approaches include, but are not limited to greedy random adaptive search procedures, genetic algorithms, problem-space search, neural networks, simulated annealing, tabu search, threshold algorithms, and their hybrids.
Les mer
Ch. 1 âMeta-Heuristics: An Overviewâ.- Genetic Algorithms.- Ch. 2 âA Parallel Genetic Algorithm for the Set Partitioning Problemâ.- Ch. 3 âEvolutionary Computation and Heuristicsâ.- Ch. 4 âGene Pool Recombination in Genetic Algorithmsâ.- Ch. 5 âGenetic and Local Search Algorithms as Robust and Simple Optimization Toolsâ.- Networks and Graphs.- Ch. 6 âComparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Treeâ.- Ch. 7 âAn Aggressive Search Procedure for the Bipartite Drawing Problemâ.- Ch. 8 âGuided Search for the Shortest Path on Transportation Networksâ.- Scheduling and Control.- Ch. 9 âA Metaheuristic for the Timetabling Problemâ.- Ch. 10 âComplex Sequencing Problems and Local Search Heuristicsâ.- Ch. 11 âHeuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penaltiesâ.- Ch. 12 âHeuristics for the Optimal Control of Thermal Energy Storageâ.- Ch. 13 âExploiting Block Structure to Improve Resource-Constrained Project Schedulesâ.- Ch. 14 âCombining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problemâ.- Ch. 15 âJob-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Searchâ.- Simulated Annealing.- Ch. 16 âCybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Controlâ.- Ch. 17 âA Simulated Annealing Algorithm for the Computation of Marginal Costs of Telecommunication Linksâ.- Ch. 18 âLearning to Recognize (Un) Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routingâ.- Ch. 19 âA Preliminary Investigation into the Performance of Heuristic Search Methods Applied to CompoundCombinatorial Problemsâ.- Tabu Search.- Ch. 20 âTabu Search, Combination and Integrationâ.- Ch. 21 âVector Quantization with the Reactive Tabu Searchâ.- Ch. 22 âTabu Thresholding for the Frequency Assignment Problemâ.- Ch. 23 âA New Tabu Search Approach to the 0â1 Equicut Problemâ.- Ch. 24 âSimple Tabu Thresholding and the Pallet Loading Problemâ.- Ch. 25 âCritical Event Tabu Search for Multidimensional Knapsack Problemsâ.- Ch. 26 âSolving Dynamic Stochastic Control Problems in Finance Using Tabu Search with Variable Scalingâ.- Ch. 27 âComparison of Heuristics for the 0â1 Multidimensional Knapsack Problemâ.- Ch. 28 âProbabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problemsâ.- Ch. 29 âA Star-Shaped Diversification Approach in Tabu Searchâ.- Ch. 30 âCommunication Issues in Designing Cooperative Multi-Thread Parallel Searchesâ.- Ch. 31 âA Study on Algorithms for Selecting r Best Elements from An Arrayâ.- Ch. 32 âA Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problemâ.- Ch. 33 âChunking Applied to Reactive Tabu Searchâ.- Ch. 34 âTabu Search on the Geometric Traveling Salesman Problemâ.- Traveling Salesman Problems.- Ch. 35 âMixing Different Components of Metaheuristicsâ.- Ch. 36 âA Probabilistic Analysis of Local Searchâ.- Ch. 37 âThe Clustered Traveling Salesman Problem: A Genetic Approachâ.- Vehicle Routing Problems.- Ch. 38 âA Tabu Search Based Heuristic for Arc Routing with a Capacity Constraint and Time Deadlineâ.- Ch. 39 âSupervision in the Self-Organizing Feature Map: Application to the Vehicle Routing Problemâ.- Ch. 40 âA Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle RoutingProblemâ.- Ch. 41 âFast Local Search Algorithms for the Handicapped Persons Transportation Problemâ.
Les mer
Springer Book Archives
Springer Book Archives
GPSR Compliance
The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this.
If you have any concerns about our products you can contact us on ProductSafety@springernature.com.
In case Publisher is established outside the EU, the EU authorized representative is:
Springer Nature Customer Service Center GmbH
Europaplatz 3
69115 Heidelberg, Germany
ProductSafety@springernature.com
Les mer
Produktdetaljer
ISBN
9781461285878
Publisert
2011-09-26
Utgiver
Vendor
Springer-Verlag New York Inc.
Høyde
235 mm
Bredde
155 mm
AldersnivĂĽ
Research, P, 06
SprĂĽk
Product language
Engelsk
Format
Product format
Heftet