Design of modern heuristics principles and application /
Most textbooks on modern heuristics provide the reader with detailed descriptions of the functionality of single examples like genetic algorithms, genetic programming, tabu search, simulated annealing, and others, but fail to teach the underlying concepts behind these different approaches. The autho...
Main Author: | Rothlauf, Franz, 1971- |
---|---|
Other Authors: | SpringerLink (Online service) |
Format: | eBook |
Language: | English |
Published: |
Berlin ; New York :
Springer,
©2011.
Berlin ; New York : [2011] |
Physical Description: |
1 online resource (xi, 267 pages) : illustrations. |
Series: |
Natural computing series.
|
Subjects: |
LEADER | 05582cam a2200889 a 4500 | ||
---|---|---|---|
001 | 750804918 | ||
003 | OCoLC | ||
005 | 20240223121953.0 | ||
006 | m o d | ||
007 | cr mn||||||||| | ||
008 | 110908s2011 gw a ob 001 0 eng d | ||
019 | |a 754716861 |a 759861381 |a 771449787 |a 771449789 |a 857254151 |a 922964638 |a 985061665 |a 1005766992 |a 1058120839 |a 1066183541 |a 1069629091 |a 1086955427 |a 1111014780 |a 1112526070 | ||
020 | |a 9783540729624 |q (electronic bk.) | ||
020 | |a 3540729623 |q (electronic bk.) | ||
020 | |z 9783540729617 | ||
020 | |z 3540729615 | ||
024 | 7 | |a 10.1007/978-3-540-72962-4 |2 doi | |
035 | |a (OCoLC)750804918 |z (OCoLC)754716861 |z (OCoLC)759861381 |z (OCoLC)771449787 |z (OCoLC)771449789 |z (OCoLC)857254151 |z (OCoLC)922964638 |z (OCoLC)985061665 |z (OCoLC)1005766992 |z (OCoLC)1058120839 |z (OCoLC)1066183541 |z (OCoLC)1069629091 |z (OCoLC)1086955427 |z (OCoLC)1111014780 |z (OCoLC)1112526070 | ||
037 | |b Springer | ||
040 | |a HKP |b eng |e pn |c HKP |d E7B |d OCLCQ |d GW5XE |d COO |d YDXCP |d OCLCQ |d MEAUC |d OCLCO |d OCLCF |d BEDGE |d NUI |d EBLCP |d DEBSZ |d OCLCQ |d VT2 |d Z5A |d VGM |d ESU |d OCLCQ |d IOG |d BUF |d CEF |d U3W |d AU@ |d OCLCQ |d WYU |d YOU |d W2U |d CNTRU |d OL$ |d OCLCQ |d DCT |d ERF |d OCLCQ |d UKAHL |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d OCLCQ |d OCLCL | ||
049 | |a COM6 | ||
050 | 4 | |a T57.84 |b .R68 2011eb | |
072 | 7 | |a UYQ |2 bicssc | |
072 | 7 | |a TJFM1 |2 bicssc | |
072 | 7 | |a COM004000 |2 bisacsh | |
082 | 0 | 4 | |a 006.3 |2 23 |
100 | 1 | |a Rothlauf, Franz, |d 1971- |1 https://id.oclc.org/worldcat/entity/E39PCjCRgwWqdQYJwBb6qYwVyb. | |
245 | 1 | 0 | |a Design of modern heuristics : |b principles and application / |c Franz Rothlauf. |
260 | |a Berlin ; |a New York : |b Springer, |c ©2011. | ||
264 | 1 | |a Berlin ; |a New York : |b Springer, |c [2011] | |
264 | 4 | |c ©2011. | |
300 | |a 1 online resource (xi, 267 pages) : |b illustrations. | ||
336 | |a text |b txt |2 rdacontent. | ||
337 | |a computer |b c |2 rdamedia. | ||
338 | |a online resource |b cr |2 rdacarrier. | ||
347 | |a text file. | ||
347 | |b PDF. | ||
490 | 1 | |a Natural computing series, |x 1619-7127. | |
504 | |a Includes bibliographical references (pages 227-256) and index. | ||
588 | 0 | |a Print version record. | |
505 | 0 | |a Chap. 1 -- Introduction -- Part I -- Fundamentals -- Chap. 2 -- Optimization Problems -- Chap. 3 -- Optimization Methods -- Part II -- Modern Heuristics -- Chap. 4 -- Design Elements -- Chap. 5 -- Search Strategies -- Chap. 6 -- Design Principles -- Part III Case Studies -- Chap. 7 -- High Locality Representations for Automated Programming -- Chap. 8.-Biased Modern Heuristics for the OCST Problem -- Chap. 9.-Summary -- References -- Nomenclature -- Glossary -- Index. | |
520 | |a Most textbooks on modern heuristics provide the reader with detailed descriptions of the functionality of single examples like genetic algorithms, genetic programming, tabu search, simulated annealing, and others, but fail to teach the underlying concepts behind these different approaches. The author takes a different approach in this textbook by focusing on the users' needs and answering three fundamental questions: First, he tells us which problems modern heuristics are expected to perform well on, and which should be left to traditional optimization methods. Second, he teaches us to systematically design the "right" modern heuristic for a particular problem by providing a coherent view on design elements and working principles. Third, he shows how we can make use of problem-specific knowledge for the design of efficient and effective modern heuristics that solve not only small toy problems but also perform well on large real-world problems. This book is written in an easy-to-read style and it is aimed at students and practitioners in computer science, operations research and information systems who want to understand modern heuristics and are interested in a guide to their systematic design and use. | ||
546 | |a English. | ||
650 | 0 | |a Heuristic programming. | |
650 | 0 | |a Combinatorial optimization. | |
650 | 6 | |a Programmation heuristique. | |
650 | 6 | |a Optimisation combinatoire. | |
650 | 7 | |a Informatique. |2 eclas. | |
650 | 7 | |a Combinatorial optimization. |2 fast. | |
650 | 7 | |a Heuristic programming. |2 fast. | |
710 | 2 | |a SpringerLink (Online service) | |
776 | 0 | 8 | |i Printed edition: |z 9783540729617. |
830 | 0 | |a Natural computing series. | |
907 | |a .b35017466 |b multi |c - |d 120131 |e 240320 | ||
998 | |a (3)cue |a cu |b 240227 |c m |d z |e - |f eng |g gw |h 0 |i 2 | ||
948 | |a MARCIVE Overnight, in 2024.03 | ||
948 | |a MARCIVE Comp, in 2022.12 | ||
948 | |a MARCIVE Over, 07/2021 | ||
948 | |a MARCIVE Comp, 2019.12 | ||
948 | |a MARCIVE Comp, 2018.05 | ||
948 | |a MARCIVE August, 2017 | ||
948 | |a MARCIVE extract Aug, 5 2017 | ||
994 | |a 92 |b COM | ||
995 | |a Loaded with m2btab.ltiac in 2024.03 | ||
995 | |a Loaded with m2btab.elec in 2024.02 | ||
995 | |a Loaded with m2btab.ltiac in 2022.12 | ||
995 | |a Loaded with m2btab.ltiac in 2021.07 | ||
995 | |a Loaded with m2btab.elec in 2021.06 | ||
995 | |a Loaded with m2btab.ltiac in 2019.12 | ||
995 | |a Loaded with m2btab.ltiac in 2018.06 | ||
995 | |a Loaded with m2btab.ltiac in 2017.08 | ||
995 | |a Loaded with m2btab.elec in 2016 | ||
995 | |a Loaded with m2btab.elec in 2016 | ||
995 | |a OCLC offline update by CMU | ||
999 | |e z | ||
999 | |a cue | ||
989 | |d cueme |e - - |f - - |g - |h 0 |i 0 |j 200 |k 240227 |l $0.00 |m |n - - |o - |p 0 |q 0 |t 0 |x 0 |w SpringerLink |1 .i150287586 |u http://ezproxy.coloradomesa.edu/login?url=https://link.springer.com/10.1007/978-3-540-72962-4 |3 SpringerLink |z Click here for access |