Design of Heuristic Algorithms for Hard Optimization : : With Python Codes for the Travelling Salesman Problem / / by Éric D. Taillard.
This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject beca...
Saved in:
Superior document: | Graduate Texts in Operations Research, |
---|---|
VerfasserIn: | |
Place / Publishing House: | Cham : : Springer International Publishing :, Imprint: Springer,, 2023. |
Year of Publication: | 2023 |
Edition: | 1st ed. 2023. |
Language: | English |
Series: | Graduate Texts in Operations Research,
|
Physical Description: | 1 online resource (XV, 287 p. 1 illus.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
993568675904498 |
---|---|
ctrlnum |
(CKB)5580000000418710 (DE-He213)978-3-031-13714-3 (oapen)https://directory.doabooks.org/handle/20.500.12854/93984 (MiAaPQ)EBC7127769 (Au-PeEL)EBL7127769 (OCoLC)1351747018 (PPN)265859603 (EXLCZ)995580000000418710 |
collection |
bib_alma |
record_format |
marc |
spelling |
Taillard, Éric D. author. aut http://id.loc.gov/vocabulary/relators/aut Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem / by Éric D. Taillard. 1st ed. 2023. Cham Springer Nature 2023 Cham : Springer International Publishing : Imprint: Springer, 2023. 1 online resource (XV, 287 p. 1 illus.) text txt rdacontent computer c rdamedia online resource cr rdacarrier Graduate Texts in Operations Research, 2662-6020 This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content. Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7. Randomized Methods -- 8. Construction Learning -- 9. Local Search Learning -- 10. Population Management -- 11. Heuristics Design -- 12. Codes. Open Access English Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung Operations research. Mathematical optimization. Mathematics—Data processing. Algorithms. Artificial intelligence. Operations Research and Decision Theory. Optimization. Computational Mathematics and Numerical Analysis. Computational Science and Engineering. Artificial Intelligence. Algorithms Heuristics Travelling Salesman Local Search Metaheuristics Combinatorial Optimization Artificial Intelligence 3-031-13713-2 |
language |
English |
format |
eBook |
author |
Taillard, Éric D. Taillard, Éric D. |
spellingShingle |
Taillard, Éric D. Taillard, Éric D. Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem / Graduate Texts in Operations Research, Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7. Randomized Methods -- 8. Construction Learning -- 9. Local Search Learning -- 10. Population Management -- 11. Heuristics Design -- 12. Codes. |
author_facet |
Taillard, Éric D. Taillard, Éric D. |
author_variant |
é d t éd édt é d t éd édt |
author_role |
VerfasserIn VerfasserIn |
author_sort |
Taillard, Éric D. |
title |
Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem / |
title_sub |
With Python Codes for the Travelling Salesman Problem / |
title_full |
Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem / by Éric D. Taillard. |
title_fullStr |
Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem / by Éric D. Taillard. |
title_full_unstemmed |
Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem / by Éric D. Taillard. |
title_auth |
Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem / |
title_new |
Design of Heuristic Algorithms for Hard Optimization : |
title_sort |
design of heuristic algorithms for hard optimization : with python codes for the travelling salesman problem / |
series |
Graduate Texts in Operations Research, |
series2 |
Graduate Texts in Operations Research, |
publisher |
Springer Nature Springer International Publishing : Imprint: Springer, |
publishDate |
2023 |
physical |
1 online resource (XV, 287 p. 1 illus.) |
edition |
1st ed. 2023. |
contents |
Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7. Randomized Methods -- 8. Construction Learning -- 9. Local Search Learning -- 10. Population Management -- 11. Heuristics Design -- 12. Codes. |
isbn |
3-031-13714-0 3-031-13713-2 |
issn |
2662-6020 |
callnumber-first |
T - Technology |
callnumber-subject |
T - General Technology |
callnumber-label |
T57 |
callnumber-sort |
T 257.6 297 |
illustrated |
Not Illustrated |
dewey-hundreds |
600 - Technology |
dewey-tens |
650 - Management & public relations |
dewey-ones |
658 - General management |
dewey-full |
658.403 |
dewey-sort |
3658.403 |
dewey-raw |
658.403 |
dewey-search |
658.403 |
oclc_num |
1351747018 |
work_keys_str_mv |
AT taillardericd designofheuristicalgorithmsforhardoptimizationwithpythoncodesforthetravellingsalesmanproblem |
status_str |
n |
ids_txt_mv |
(CKB)5580000000418710 (DE-He213)978-3-031-13714-3 (oapen)https://directory.doabooks.org/handle/20.500.12854/93984 (MiAaPQ)EBC7127769 (Au-PeEL)EBL7127769 (OCoLC)1351747018 (PPN)265859603 (EXLCZ)995580000000418710 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Graduate Texts in Operations Research, |
is_hierarchy_title |
Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem / |
container_title |
Graduate Texts in Operations Research, |
_version_ |
1801080284258500608 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04376nam a22007335i-4500</leader><controlfield tag="001">993568675904498</controlfield><controlfield tag="005">20231214145419.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr#nn#008mamaa</controlfield><controlfield tag="008">240605s2022 xx o ||||0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3-031-13714-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-031-13714-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)5580000000418710</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)978-3-031-13714-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/93984</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC7127769</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL7127769</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1351747018</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PPN)265859603</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)995580000000418710</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">T57.6-.97</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">KJT</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">KJMD</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">BUS049000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">KJT</subfield><subfield code="2">thema</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">KJMD</subfield><subfield code="2">thema</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">658.403</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Taillard, Éric D.</subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Design of Heuristic Algorithms for Hard Optimization :</subfield><subfield code="b">With Python Codes for the Travelling Salesman Problem /</subfield><subfield code="c">by Éric D. Taillard.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2023.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cham</subfield><subfield code="b">Springer Nature</subfield><subfield code="c">2023</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham :</subfield><subfield code="b">Springer International Publishing :</subfield><subfield code="b">Imprint: Springer,</subfield><subfield code="c">2023.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (XV, 287 p. 1 illus.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Graduate Texts in Operations Research,</subfield><subfield code="x">2662-6020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7. Randomized Methods -- 8. Construction Learning -- 9. Local Search Learning -- 10. Population Management -- 11. Heuristics Design -- 12. Codes.</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">Open Access</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="536" ind1=" " ind2=" "><subfield code="a">Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Operations research.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematical optimization.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics—Data processing.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Artificial intelligence.</subfield></datafield><datafield tag="650" ind1="1" ind2="4"><subfield code="a">Operations Research and Decision Theory.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Optimization.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Computational Mathematics and Numerical Analysis.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Algorithms.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Computational Science and Engineering.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Artificial Intelligence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Heuristics</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Travelling Salesman</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Local Search</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Metaheuristics</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combinatorial Optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-031-13713-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Graduate Texts in Operations Research,</subfield><subfield code="x">2662-6020</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2024-06-06 04:17:22 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2022-11-12 21:32:05 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5341202340004498&Force_direct=true</subfield><subfield code="Z">5341202340004498</subfield><subfield code="b">Available</subfield><subfield code="8">5341202340004498</subfield></datafield></record></collection> |