Essays and Surveys in Metaheuristics [electronic resource] /

Finding exact solutions to many combinatorial optimization problems in busi­ ness, engineering, and science still poses a real challenge, despite the impact of recent advances in mathematical programming and computer technology. New fields of applications, such as computational biology, electronic commerce, and supply chain management, bring new challenges and needs for algorithms and optimization techniques. Metaheuristics are master procedures that guide and modify the operations of subordinate heuristics, to produce improved approx­ imate solutions to hard optimization problems with respect to more simple algorithms. They also provide fast and robust tools, producing high-quality solutions in reasonable computation times. The field of metaheuristics has been fast evolving in recent years. Tech­ niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza­ tion problems. A very large nmnber of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.

Saved in:
Bibliographic Details
Main Authors: Ribeiro, Celso C. author., Hansen, Pierre. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Boston, MA : Springer US : Imprint: Springer, 2002
Subjects:Computer science., Operations research., Decision making., Software engineering., Artificial intelligence., Applied mathematics., Engineering mathematics., Mathematical optimization., Computer Science., Software Engineering/Programming and Operating Systems., Optimization., Applications of Mathematics., Artificial Intelligence (incl. Robotics)., Operation Research/Decision Theory.,
Online Access:http://dx.doi.org/10.1007/978-1-4615-1507-4
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:198486
record_format koha
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Computer science.
Operations research.
Decision making.
Software engineering.
Artificial intelligence.
Applied mathematics.
Engineering mathematics.
Mathematical optimization.
Computer Science.
Software Engineering/Programming and Operating Systems.
Optimization.
Applications of Mathematics.
Artificial Intelligence (incl. Robotics).
Operation Research/Decision Theory.
Computer science.
Operations research.
Decision making.
Software engineering.
Artificial intelligence.
Applied mathematics.
Engineering mathematics.
Mathematical optimization.
Computer Science.
Software Engineering/Programming and Operating Systems.
Optimization.
Applications of Mathematics.
Artificial Intelligence (incl. Robotics).
Operation Research/Decision Theory.
spellingShingle Computer science.
Operations research.
Decision making.
Software engineering.
Artificial intelligence.
Applied mathematics.
Engineering mathematics.
Mathematical optimization.
Computer Science.
Software Engineering/Programming and Operating Systems.
Optimization.
Applications of Mathematics.
Artificial Intelligence (incl. Robotics).
Operation Research/Decision Theory.
Computer science.
Operations research.
Decision making.
Software engineering.
Artificial intelligence.
Applied mathematics.
Engineering mathematics.
Mathematical optimization.
Computer Science.
Software Engineering/Programming and Operating Systems.
Optimization.
Applications of Mathematics.
Artificial Intelligence (incl. Robotics).
Operation Research/Decision Theory.
Ribeiro, Celso C. author.
Hansen, Pierre. author.
SpringerLink (Online service)
Essays and Surveys in Metaheuristics [electronic resource] /
description Finding exact solutions to many combinatorial optimization problems in busi­ ness, engineering, and science still poses a real challenge, despite the impact of recent advances in mathematical programming and computer technology. New fields of applications, such as computational biology, electronic commerce, and supply chain management, bring new challenges and needs for algorithms and optimization techniques. Metaheuristics are master procedures that guide and modify the operations of subordinate heuristics, to produce improved approx­ imate solutions to hard optimization problems with respect to more simple algorithms. They also provide fast and robust tools, producing high-quality solutions in reasonable computation times. The field of metaheuristics has been fast evolving in recent years. Tech­ niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza­ tion problems. A very large nmnber of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.
format Texto
topic_facet Computer science.
Operations research.
Decision making.
Software engineering.
Artificial intelligence.
Applied mathematics.
Engineering mathematics.
Mathematical optimization.
Computer Science.
Software Engineering/Programming and Operating Systems.
Optimization.
Applications of Mathematics.
Artificial Intelligence (incl. Robotics).
Operation Research/Decision Theory.
author Ribeiro, Celso C. author.
Hansen, Pierre. author.
SpringerLink (Online service)
author_facet Ribeiro, Celso C. author.
Hansen, Pierre. author.
SpringerLink (Online service)
author_sort Ribeiro, Celso C. author.
title Essays and Surveys in Metaheuristics [electronic resource] /
title_short Essays and Surveys in Metaheuristics [electronic resource] /
title_full Essays and Surveys in Metaheuristics [electronic resource] /
title_fullStr Essays and Surveys in Metaheuristics [electronic resource] /
title_full_unstemmed Essays and Surveys in Metaheuristics [electronic resource] /
title_sort essays and surveys in metaheuristics [electronic resource] /
publisher Boston, MA : Springer US : Imprint: Springer,
publishDate 2002
url http://dx.doi.org/10.1007/978-1-4615-1507-4
work_keys_str_mv AT ribeirocelsocauthor essaysandsurveysinmetaheuristicselectronicresource
AT hansenpierreauthor essaysandsurveysinmetaheuristicselectronicresource
AT springerlinkonlineservice essaysandsurveysinmetaheuristicselectronicresource
_version_ 1756267160740560896
spelling KOHA-OAI-TEST:1984862018-07-30T23:25:08ZEssays and Surveys in Metaheuristics [electronic resource] / Ribeiro, Celso C. author. Hansen, Pierre. author. SpringerLink (Online service) textBoston, MA : Springer US : Imprint: Springer,2002.engFinding exact solutions to many combinatorial optimization problems in busi­ ness, engineering, and science still poses a real challenge, despite the impact of recent advances in mathematical programming and computer technology. New fields of applications, such as computational biology, electronic commerce, and supply chain management, bring new challenges and needs for algorithms and optimization techniques. Metaheuristics are master procedures that guide and modify the operations of subordinate heuristics, to produce improved approx­ imate solutions to hard optimization problems with respect to more simple algorithms. They also provide fast and robust tools, producing high-quality solutions in reasonable computation times. The field of metaheuristics has been fast evolving in recent years. Tech­ niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza­ tion problems. A very large nmnber of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.1 Selected Topics in Simulated Annealing -- 2 Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs -- 3 A GRASP for Job Shop Scheduling -- 4 A Reactive GRASP for Transmission Network Expansion Planning -- 5 Tabu Search for Two-Dimensional Irregular Cutting -- 6 A Study of Global Convexity for a Multiple Objective Travelling Sales- man Problem -- 7 A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem -- 8 A Simulated Annealing Approach for Minimum Cost Isolated Failure Immune Networks -- 9 A GRASP Interactive Approach to the Vehicle Routing Problem with Backhauls -- 10 Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem -- 11 A Scatter Search Algorithm for the Maximum Clique Problem -- 12 The Noising Methods: A Survey -- 13 Strategies for the Parallel Implementation of Metaheuristics -- 14 Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems -- 15 GRASP: An Annotated Bibliography -- 16 Recent Advances in Tabu Search -- 17 Lagrangean Tabu Search -- 18 A GIDS Metaheuristic Approach to the Fleet Size and Mix Vehicle Routing Problem -- 19 Developments of Variable Neighborhood Search -- 20 Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithms -- 21 Ant Colony Optimization: An Overview -- 22 Intensification Neighborhoods for Local Search Methods -- 23 New Heuristics for the Euclidean Steiner Problem in Rn -- 24 Mathematical Analysis of Evolutionary Algorithms -- 25 Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem -- 26 Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem -- 27 POPMUSIC — Partial Optimization Metaheuristic under Special Intensification Conditions -- 28 Subcost-Guided Simulated Annealing -- 29 A Pruning Pattern List Approach to the Permutation Flowshop Scheduling Problem.Finding exact solutions to many combinatorial optimization problems in busi­ ness, engineering, and science still poses a real challenge, despite the impact of recent advances in mathematical programming and computer technology. New fields of applications, such as computational biology, electronic commerce, and supply chain management, bring new challenges and needs for algorithms and optimization techniques. Metaheuristics are master procedures that guide and modify the operations of subordinate heuristics, to produce improved approx­ imate solutions to hard optimization problems with respect to more simple algorithms. They also provide fast and robust tools, producing high-quality solutions in reasonable computation times. The field of metaheuristics has been fast evolving in recent years. Tech­ niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza­ tion problems. A very large nmnber of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.Computer science.Operations research.Decision making.Software engineering.Artificial intelligence.Applied mathematics.Engineering mathematics.Mathematical optimization.Computer Science.Software Engineering/Programming and Operating Systems.Optimization.Applications of Mathematics.Artificial Intelligence (incl. Robotics).Operation Research/Decision Theory.Springer eBookshttp://dx.doi.org/10.1007/978-1-4615-1507-4URN:ISBN:9781461515074