Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimizations comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97).

I: Tabu Search.- 1 Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem.- 2 Metaheuristic for the Vehicle Routing Problem with Time Windows.- 3 New Heuristic Algorithms for the Crew Scheduling Problem.- 4 Enhanced Continuous Tabu Search: An Algorithm for Optimizing Multiminima Functions.- 5 Local Search in Constraint Programming: Experiments with Tabu Search on the Vehicle Routing Problem.- 6 Tabu Search for Graph Coloring, T-colorings and Set T-colorings.- 7 Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs.- 8 Actuator Selection for the Control of Multi-Frequency Noise in Aircraft Interiors.- 9 Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem.- 10 Candidate List and Exploration Strategies for Solving 0/1 MIP Problems using a Pivot Neighborhood.- 11 Global and Local Moves in Tabu Search: A Real-Life Mail Collecting Application.- 12 Flow Line Scheduling by Tabu Search.- II: Combined and Hybrid Approaches.- 13 Using Lower Bounds in Minimum Span Frequency Assignment.- 14 A Hybrid Heuristic for Multiobjective Knapsack Problems.- 15 Hybrid Genetic Tabu Search for a Cyclic Scheduling Problem.- III: Genetic and Evolutionary Algorithms.- 16 Adaptive Genetic Algorithms: A Methodology for Dynamic Autoconfiguration of Genetic Search Algorithms.- 17 The Lavish Ordering Genetic Algorithm.- 18 Fitness Landscapes and Performance of Meta-Heuristics.- 19 A Network-Based Adaptive Evolutionary Algorithm for Constraint Satisfaction Problems.- IV: Ant Systems.- 20 Applying the Ant System to the Vehicle Routing Problem.- 21 Cooperative Intelligent Search Using Adaptive Memory Techniques.- 22 The Max-Min Ant System and Local Search for Combinatorial Optimization Problems.- V: Parallel Approaches.- 23 Towards an Evolutionary Method — Cooperating Multi-Thread Parallel Tabu Search Hybrid.- 24 Parallel Tabu Search for Large Optimization Problems.- 25 Sequential and Parallel Local Search Algorithms for Job Shop Scheduling.- 26 An Experimental Study of Systemic Behavior of Cooperative Search Algorithms.- VI: Further Meta-Heuristics.- 27 A Hopfield-Tank Neural Network Model for the Generalized Traveling Salesman Problem.- 28 Generalized Cybernetic Optimization: Solving Continuous Variable Problems.- 29 Solving the Progressive Party Problem by Local Search.- 30 An Introduction to Variable Neighborhood Search.- 31 A Variable Depth Search Algorithm for the Generalized Assignment Problem.- 32 Guided Local Search for the Vehicle Routing Problem with Time Windows.- 33 Memory Adaptive Reasoning & Greedy Assignment Techniques for the Capacitated Minimum Spanning Tree Problem.- 34 A Chunking Based Selection Strategy for Integrating Meta-Heuristics with Branch and Bound.

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