↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Metaheuristics: Computer Decision-Making
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
A Path Relinking Algorithm for the Generalized Assignment Problem
Altmetric Badge
Chapter 2
The PROBE Metaheuristic and Its Application to the Multiconstraint Knapsack Problem
Altmetric Badge
Chapter 3
Lagrangian Heuristics for the Linear Ordering Problem
Altmetric Badge
Chapter 4
Enhancing the Performance of Memetic Algorithms by Using a Matching-Based Recombination Algorithm
Altmetric Badge
Chapter 5
Multi-Cast Ant Colony System for the Bus Routing Problem
Altmetric Badge
Chapter 6
Study of Genetic Algorithms with Crossover Based on Confidence Intervals as an Alternative to Classical Least Squares Estimation Methods for Nonlinear Models
Altmetric Badge
Chapter 7
Metaheuristics: Computer Decision-Making
Altmetric Badge
Chapter 8
A Potts Neural Network Heuristic for the Class/Teacher Timetabling Problem
Altmetric Badge
Chapter 9
Genetic Algorithms for the Single Source Capacitated Location Problem
Altmetric Badge
Chapter 10
An Elitist Genetic Algorithm for Multiobjective Optimization
Altmetric Badge
Chapter 11
HSF: The iOpt’s Framework to Easily Design Metaheuristic Methods
Altmetric Badge
Chapter 12
A Distance-Based Selection of Parents in Genetic Algorithms
Altmetric Badge
Chapter 13
Experimental Pool Design: Input, Output and Combination Strategies for Scatter Search
Altmetric Badge
Chapter 14
Evolutionary Proxy Tuning for Expensive Evaluation Functions: A Real-Case Application to Petroleum Reservoir Optimization
Altmetric Badge
Chapter 15
An Analysis of Solution Properties of the Graph Coloring Problem
Altmetric Badge
Chapter 16
Developing Classification Techniques from Biological Databases Using Simulated Annealing
Altmetric Badge
Chapter 17
A New Look at Solving Minimax Problems with Coevolutionary Genetic Algorithms
Altmetric Badge
Chapter 18
A Performance Analysis of Tabu Search for Discrete-Continuous Scheduling Problems
Altmetric Badge
Chapter 19
Elements for the Description of Fitness Landscapes Associated with Local Operators for Layered Drawings of Directed Graphs
Altmetric Badge
Chapter 20
Training Multi Layer Perceptron Network Using a Genetic Algorithm as a Global Optimizer
Altmetric Badge
Chapter 21
Metaheuristics Applied to Power Systems
Altmetric Badge
Chapter 22
On the Behavior of ACO Algorithms: Studies on Simple Problems
Altmetric Badge
Chapter 23
Variable Neighborhood Search for the K-Cardinality Tree
Altmetric Badge
Chapter 24
Heuristics for Large Strip Packing Problems with Guillotine Patterns: An Empirical Study
Altmetric Badge
Chapter 25
Choosing Search Heuristics by Non-Stationary Reinforcement Learning
Altmetric Badge
Chapter 26
GRASP for Linear Integer Programming
Altmetric Badge
Chapter 27
Random Start Local Search and Tabu Search for a Discrete Lot-Sizing and Scheduling Problem
Altmetric Badge
Chapter 28
New Benchmark Instances for The Steiner Problem in Graphs
Altmetric Badge
Chapter 29
A Memetic Algorithm for Communication Network Design Taking into Consideration an Existing Network
Altmetric Badge
Chapter 30
A GRASP Heuristic for the Capacitated Minimum Spanning Tree Problem Using a Memory-Based Local Search Strategy
Altmetric Badge
Chapter 31
A GRASP-Tabu Search Algorithm for Solving School Timetabling Problems
Altmetric Badge
Chapter 32
A Local Search Approach for the Pattern Restricted One Dimensional Cutting Stock Problem
Altmetric Badge
Chapter 33
An Ant System Algorithm for the Mixed Vehicle Routing Problem with Backhauls
Overall attention for this book and its chapters
Altmetric Badge
Mentioned by
syllabi
1
institution with syllabi
wikipedia
1
Wikipedia page
Citations
dimensions_citation
22
Dimensions
Readers on
mendeley
39
Mendeley
Book overview
1. A Path Relinking Algorithm for the Generalized Assignment Problem
2. The PROBE Metaheuristic and Its Application to the Multiconstraint Knapsack Problem
3. Lagrangian Heuristics for the Linear Ordering Problem
4. Enhancing the Performance of Memetic Algorithms by Using a Matching-Based Recombination Algorithm
5. Multi-Cast Ant Colony System for the Bus Routing Problem
6. Study of Genetic Algorithms with Crossover Based on Confidence Intervals as an Alternative to Classical Least Squares Estimation Methods for Nonlinear Models
7. Metaheuristics: Computer Decision-Making
8. A Potts Neural Network Heuristic for the Class/Teacher Timetabling Problem
9. Genetic Algorithms for the Single Source Capacitated Location Problem
10. An Elitist Genetic Algorithm for Multiobjective Optimization
11. HSF: The iOpt’s Framework to Easily Design Metaheuristic Methods
12. A Distance-Based Selection of Parents in Genetic Algorithms
13. Experimental Pool Design: Input, Output and Combination Strategies for Scatter Search
14. Evolutionary Proxy Tuning for Expensive Evaluation Functions: A Real-Case Application to Petroleum Reservoir Optimization
15. An Analysis of Solution Properties of the Graph Coloring Problem
16. Developing Classification Techniques from Biological Databases Using Simulated Annealing
17. A New Look at Solving Minimax Problems with Coevolutionary Genetic Algorithms
18. A Performance Analysis of Tabu Search for Discrete-Continuous Scheduling Problems
19. Elements for the Description of Fitness Landscapes Associated with Local Operators for Layered Drawings of Directed Graphs
20. Training Multi Layer Perceptron Network Using a Genetic Algorithm as a Global Optimizer
21. Metaheuristics Applied to Power Systems
22. On the Behavior of ACO Algorithms: Studies on Simple Problems
23. Variable Neighborhood Search for the K-Cardinality Tree
24. Heuristics for Large Strip Packing Problems with Guillotine Patterns: An Empirical Study
25. Choosing Search Heuristics by Non-Stationary Reinforcement Learning
26. GRASP for Linear Integer Programming
27. Random Start Local Search and Tabu Search for a Discrete Lot-Sizing and Scheduling Problem
28. New Benchmark Instances for The Steiner Problem in Graphs
29. A Memetic Algorithm for Communication Network Design Taking into Consideration an Existing Network
30. A GRASP Heuristic for the Capacitated Minimum Spanning Tree Problem Using a Memory-Based Local Search Strategy
31. A GRASP-Tabu Search Algorithm for Solving School Timetabling Problems
32. A Local Search Approach for the Pattern Restricted One Dimensional Cutting Stock Problem
33. An Ant System Algorithm for the Mixed Vehicle Routing Problem with Backhauls
Summary
Syllabi
Wikipedia
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
2
syllabi from
1
institutions on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
Unknown
2
Economics, Business, Engineering, Biology, History, Law