國立高雄大學圖資館 |

Language: English

Back

Handbook of heuristics

Marti, Rafael.

Handbook of heuristics

Record Type:	Electronic resources : Monograph/item
Title/Author:	Handbook of heuristicsedited by Rafael Marti, Panos M. Pardalos, Mauricio G. C. Resende.
other author:	Marti, Rafael.
Published:	Cham :Springer International Publishing :2018.
Description:	xxi, 1385 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Heuristic algorithmsHandbooks, manuals, etc.
Online resource:	http://dx.doi.org/10.1007/978-3-319-07124-4
ISBN:	9783319071244$q(electronic bk.)

Handbook of heuristics
Handbook of heuristics[electronic resource] /edited by Rafael Marti, Panos M. Pardalos, Mauricio G. C. Resende. - Cham :Springer International Publishing :2018. - xxi, 1385 p. :ill. (some col.), digital ;24 cm.

Heuristics are strategies using readily accessible, loosely applicable information to control problem solving. Algorithms, for example, are a type of heuristic. By contrast, Metaheuristics are methods used to design Heuristics and may coordinate the usage of several Heuristics toward the formulation of a single method. GRASP (Greedy Randomized Adaptive Search Procedures) is an example of a Metaheuristic. To the layman, heuristics may be thought of as 'rules of thumb' but despite its imprecision, heuristics is a very rich field that refers to experience-based techniques for problem-solving, learning, and discovery. Any given solution/heuristic is not guaranteed to be optimal but heuristic methodologies are used to speed up the process of finding satisfactory solutions where optimal solutions are impractical. The introduction to this Handbook provides an overview of the history of Heuristics along with main issues regarding the methodologies covered. This is followed by Chapters containing various examples of local searches, search strategies and Metaheuristics, leading to an analyses of Heuristics and search algorithms. The reference concludes with numerous illustrations of the highly applicable nature and implementation of Heuristics in our daily life. Each chapter of this work includes an abstract/introduction with a short description of the methodology. Key words are also necessary as part of top-matter to each chapter to enable maximum search engine optimization. Next, chapters will include discussion of the adaptation of this methodology to solve a difficult optimization problem, and experiments on a set of representative problems.

ISBN: 9783319071244$q(electronic bk.)

Standard No.: 10.1007/978-3-319-07124-4doiSubjects--Topical Terms:

822407
Heuristic algorithms
--Handbooks, manuals, etc.

LC Class. No.: QA76.9.A43 / H363 2018

Dewey Class. No.: 518.1

Handbook of heuristics
LDR:02626nmm a2200301 a 4500 001 543965
003 DE-He213
005 20190304113545.0
006 m d
007 cr nn 008maaau
008 190430s2018 gw s 0 eng d
020 $a 9783319071244$q(electronic bk.)
020 $a 9783319071237$q(paper)
024 7 $a 10.1007/978-3-319-07124-4 $2 doi
035 $a 978-3-319-07124-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b H363 2018
072 7 $a PBKS $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 518.1 $2 23
090 $a QA76.9.A43 $b H236 2018
245 0 0 $a Handbook of heuristics $h [electronic resource] / $c edited by Rafael Marti, Panos M. Pardalos, Mauricio G. C. Resende.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xxi, 1385 p. : $b ill. (some col.), digital ; $c 24 cm.
520 $a Heuristics are strategies using readily accessible, loosely applicable information to control problem solving. Algorithms, for example, are a type of heuristic. By contrast, Metaheuristics are methods used to design Heuristics and may coordinate the usage of several Heuristics toward the formulation of a single method. GRASP (Greedy Randomized Adaptive Search Procedures) is an example of a Metaheuristic. To the layman, heuristics may be thought of as 'rules of thumb' but despite its imprecision, heuristics is a very rich field that refers to experience-based techniques for problem-solving, learning, and discovery. Any given solution/heuristic is not guaranteed to be optimal but heuristic methodologies are used to speed up the process of finding satisfactory solutions where optimal solutions are impractical. The introduction to this Handbook provides an overview of the history of Heuristics along with main issues regarding the methodologies covered. This is followed by Chapters containing various examples of local searches, search strategies and Metaheuristics, leading to an analyses of Heuristics and search algorithms. The reference concludes with numerous illustrations of the highly applicable nature and implementation of Heuristics in our daily life. Each chapter of this work includes an abstract/introduction with a short description of the methodology. Key words are also necessary as part of top-matter to each chapter to enable maximum search engine optimization. Next, chapters will include discussion of the adaptation of this methodology to solve a difficult optimization problem, and experiments on a set of representative problems.
650 0 $a Heuristic algorithms $v Handbooks, manuals, etc. $3 822407
650 0 $a Algorithms $3 253943
650 1 4 $a Mathematics. $3 184409
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Optimization. $3 274084
650 2 4 $a Analysis. $3 273775
650 2 4 $a Mathematical and Computational Engineering. $3 775095
650 2 4 $a Math Applications in Computer Science. $3 273991
650 2 4 $a Mathematical Software. $3 279828
700 1 $a Marti, Rafael. $3 259556
700 1 $a Pardalos, Panos M. $3 275700
700 1 $a Resende, Mauricio G. C. $3 308612
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-07124-4
950 $a Mathematics and Statistics (Springer-11649)