Metaheuristics
Subtitle: computer decision-making
By: [edited by] Mauricio G.C. Resende, Jorge Pinho de Sousa, with assistance from Ana Viana
Series: Applied optimization -- v. 86; Applied optimization -- v. 86.; Applied optimization -- 86.
Publisher: Springer
Published: 2004
Place of publication: Boston, MA
Language: eng
Number of pages: 719
ISBN-13: 9781475741377; 9781441954039
Subjects: Computer algorithms; Mathematical optimization; Decision making; Data processing
Description: This book provides state-of-the-art material in decision-making metaheuristics, from both an algorithm and application point of view. Audience: This book is suitable for professionals and students in computer science, operations research and business, who use quantitative decision-making tools.
Notes: Includes bibliographical references.
Table of contents: title: 1 A path relinking algorithm for the generalized assignment problem; title: 2 The PROBE metaheuristic for the multiconstraint knapsack problem; title: 3 Lagrangian heuristics for the linear ordering problem; title: 4 Enhancing MA performance by using matching-based recombination; title: 5 Multi-cast ant colony system for the bus routing problem; title: 6 Study of genetic algorithms with crossover based on confidence intervals as an alternative to classical least squares estimation methods for nonlinear models; title: 7 Variable neighborhood search for nurse rostering problems; title: 8 A Potts neural network heuristic for the class/teacher timetabling problem; title: 9 Genetic algorithms for the single source capacitated location problem; title: 10 An elitist genetic algorithm for multiobjective optimization; title: 11 HSF: The iOpt's framework to sasily design metaheuristic methods; title: 12 A distance-based selection of parents in genetic algorithms; title: 13 Experimental pool design: Input, output and combination strategies for scatter search; title: 14 Evolutionary proxy tuning for expensive evaluation functions: A real-case application to petroleum reservoir optimization; title: 15 An analysis of solution properties of the graph coloring problem; title: 16 Developing classification techniques from biological databases using simulated annealing; title: 17 A new look at solving minimax problems with coevolutionary genetic algorithms; title: 18 A performance analysis of tabu search for discrete-continuous scheduling problems; title: 19 Elements for the description of fitness landscapes associated with local operators for layered drawings of directed graphs; title: 20 Training multi layer perceptron network using a genetic algorithm as a global optimizer; title: 21 Metaheuristics applied to power systems; title: 22 On the behavior of ACO algorithms: Studies on simple problems; title: 23 Variable neighborhood search for the k-cardinality tree; title: 24 Heuristics for large strip packing problems with guillotine patterns: An empirical study; title: 25 Choosing search heuristics by non-stationary reinforcement learning; title: 26 GRASP for linear integer programming; title: 27 Random start local search and tabu search for a discrete lot-sizing and scheduling problem; title: 28 New benchmark instances for the Steiner problem in graphs; title: 29 A memetic algorithm for communication network design taking into consideration an existing network; title: 30 A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy; title: 31 A GRASP-tabu search algorithm for school timetabling problems; title: 32 A local search approach for the pattern restricted one dimensional cutting stock problem; title: 33 An ant system algorithm for the mixed vehicle routing problem with backhauls.