Evolutionary Computation in Combinatorial Optimization
Springer Berlin (Verlag)
978-3-540-33178-0 (ISBN)
Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem.- The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling.- Evolving the Structure of the Particle Swarm Optimization Algorithms.- A Tabu Search Algorithm for Optimization of Gas Distribution Networks.- Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm.- Parametrized GRASP Heuristics for Three-Index Assignment.- A Memetic Algorithm with Bucket Elimination for the Still Life Problem.- Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA.- Particle Swarm for the Traveling Salesman Problem.- Hierarchical Cellular Genetic Algorithm.- Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation.- Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach.- A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems.- New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm.- Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems.- A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem.- The Core Concept for the Multidimensional Knapsack Problem.- Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines.- A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem.- A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems.- Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning.- A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems.- An Efficient Hybrid Search Algorithm for Various Optimization Problems.- A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament.
Erscheint lt. Verlag | 24.3.2006 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XII, 296 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 980 g |
Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
Informatik ► Theorie / Studium ► Algorithmen | |
Mathematik / Informatik ► Mathematik | |
Schlagworte | algorithm • Algorithm analysis and problem complexity • algorithms • ant colony optimization • combinatorial optimization • Constraint Satisfaction Problems • evolutionary algorithm • evolutionary algorithms • evolutionary computation • Genetic algorithms • Heuristics • Memetic Algorithms • Metaheuristic • Metaheuristics • Multi-Criterion Optimization • Optimization • scatter search • Scheduling • Simulated annealing • Variable |
ISBN-10 | 3-540-33178-6 / 3540331786 |
ISBN-13 | 978-3-540-33178-0 / 9783540331780 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich