Multiple postmen problems: fundamentals and new algorithms
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Saarbrücken
Müller
2007
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XV, 198 S. graph. Darst. 24 cm |
| ISBN: | 9783836444965 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035813635 | ||
| 003 | DE-604 | ||
| 005 | 20091112 | ||
| 007 | t | ||
| 008 | 091106s2007 d||| m||| 00||| eng d | ||
| 015 | |a 07,N49,0010 |2 dnb | ||
| 015 | |a 09,A42,0871 |2 dnb | ||
| 016 | 7 | |a 986348074 |2 DE-101 | |
| 020 | |a 9783836444965 |9 978-3-8364-4496-5 | ||
| 024 | 3 | |a 9783836444965 | |
| 035 | |a (OCoLC)455550036 | ||
| 035 | |a (DE-599)DNB986348074 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 511.5 |2 22/ger | |
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Ahr, Dino |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Multiple postmen problems |b fundamentals and new algorithms |c Dino Ahr |
| 264 | 1 | |a Saarbrücken |b Müller |c 2007 | |
| 300 | |a XV, 198 S. |b graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Heidelberg, Univ., Diss., 2004 u.d.T.: Ahr, Dino: Contributions to multiple postmen problems | ||
| 650 | 0 | 7 | |a Branch-and-Cut-Methode |0 (DE-588)4647789-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Briefträgerproblem |0 (DE-588)4806884-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Briefträgerproblem |0 (DE-588)4806884-6 |D s |
| 689 | 0 | 1 | |a Branch-and-Cut-Methode |0 (DE-588)4647789-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3023917&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018672506&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-018672506 | |
Datensatz im Suchindex
| _version_ | 1809403656843296768 |
|---|---|
| adam_text |
CONTENTS LIST OF FIGURES VI LIST OF TABLES IX LIST OF ALGORITHMS XI
NOTATIONS AND SYMBOLS XIII ABBREVIATIONS XV 1 INTRODUCTION 1 1.1 OUTLINE
AND CONTRIBUTIONS 2 1.2 ACKNOWLEDGMENTS 3 2 MATHEMATICAL PRELIMINARIES
AND TERMINOLOGY 5 2.1 LINEAR ALGEBRA AND POLYHEDRAL THEORY 5 2.2 GRAPH
THEORY 6 2.3 COMPLEXITY THEORY 8 2.4 LINEAR PROGRAMMING AND THE CUTTING
PLANE METHOD 12 2.5 THE BRANCH-AND-CUT METHOD 15 2.6 AUXILIARY PROBLEMS
16 3 A SURVEY OF ROUTING PROBLEMS 19 3.1 A CLASSIFICATION OF ROUTING
PROBLEMS 19 3.2 NODE ROUTING PROBLEMS 20 3.2.1 THE TRAVELING SALESMAN
PROBLEM 20 3.2.2 THE --TRAVELING SALESMAN PROBLEM 21 3.2.3 THE
CAPACITATED VEHICLE ROUTING PROBLEM 21 3.2.4 THE DISTANCE CONSTRAINED
VEHICLE ROUTING PROBLEM 22 3.2.5 THE MIN-MAX FC-TRAVELING SALESMAN
PROBLEM 22 3.2.6 THE MIN-MAX CAPACITATED VEHICLE ROUTING PROBLEM 23 3.3
ARC ROUTING PROBLEMS 23 3.3.1 THE CHINESE POSTMAN PROBLEM 25 3.3.2 THE
DIRECTED CHINESE POSTMAN PROBLEM 28 3.3.3 THE MIXED CHINESE POSTMAN
PROBLEM 28 3.3.4 THE WINDY POSTMAN PROBLEM 29 3.3.5 THE RURAL POSTMAN
PROBLEM 29 I BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/986348074
DIGITALISIERT DURCH 11 CONTENTS 3.3.6 THE DIRECTED RURAL POSTMAN PROBLEM
30 3.3.7 THE MIXED RURAL POSTMAN PROBLEM 31 3.3.8 THE FC-CHINESE POSTMAN
PROBLEM 31 3.3.9 THE MIN-MAX -CHINESE POSTMAN PROBLEM 32 3.3.10 THE
CAPACITATED ARC ROUTING PROBLEM 32 3.4 GENERAL ROUTING PROBLEMS 34 3.5
RELATIONSHIPS BETWEEN ROUTING PROBLEMS 35 3.6 PRACTICAL APPLICATIONS 35
3.7 SUMMARY AND CONCLUSIONS 35 4 PRIMAL HEURISTICS 39 4.1 EXISTING
HEURISTICS FOR THE CARP 40 4.2 THE FHK-ALGORITHM FOR THE MM FC-CPP 44
4.3 NEW CONSTRUCTIVE HEURISTICS FOR THE MM K-CPP 46 4.3.1 THE
AUGMENT-MERGE ALGORITHM 46 4.3.2 THE CLUSTER ALGORITHM 47 4.3.3
COMPUTATIONAL RESULTS 51 4.4 TOOLS AND IMPROVEMENT PROCEDURES FOR THE MM
FC-CPP 52 4.4.1 MERGING AND SEPARATING EDGES 52 4.4.2 IMPROVING SINGLE
TOURS 55 4.4.3 IMPROVEMENT PROCEDURES 59 4.4.4 COMPUTATIONAL RESULTS 62
4.5 A TABU SEARCH ALGORITHM FOR THE MM K-CPP 63 4.5.1 THE GENERIC
ALGORITHM 63 4.5.2 NEIGHBORHOODS 64 4.5.3 COMPUTATIONAL RESULTS 67 4.6
SUMMARY AND CONCLUSIONS 70 5 DUAL HEURISTICS 73 5.1 EXISTING LOWER
BOUNDS FOR THE CARP 73 5.1.1 THE CHRISTOFIDES LOWER BOUND 74 5.1.2 THE
MATCHING LOWER BOUND 74 5.1.3 THE NODE SCANNING LOWER BOUND 76 5.1.4 THE
PEARN LOWER BOUND 76 5.1. CONTENTS III 5.8 SUMMARY AND CONCLUSIONS 95 6
COMPLEXITY, SOLVABLE CASES AND APPROXIMATION 97 6.1 COMPLEXITY RESULTS
FOR THE CARP 97 6.2 SOLVABLE CASES FOR THE CCPP AND THE CARP 99 6.3
APPROXIMATION ALGORITHMS FOR THE CARP 101 6.4 COMPLEXITY RESULTS FOR THE
MM FE-CPP 102 6.5 SOLVABLE CASES FOR THE MM FC-CPP 103 6.6 APPROXIMATION
ALGORITHMS FOR THE MM K-CPP 104 6.7 SUMMARY AND CONCLUSIONS 108 7 EXACT
ALGORITHMS 109 7.1 IP FORMULATIONS FOR THE CARP 109 7.1.1 THE SPARSE
DIRECTED FORMULATION 110 7.1.2 THE SPARSE FORMULATION ILL 7.1.3 THE
SUPERSPARSE FORMULATION 114 7.1.4 THE DENSE FORMULATION 114 7.2 EXISTING
ALGORITHMS FOR THE CARP . . '. 115 7.2.1 THE BRANCH-AND-BOUND ALGORITHM
OF HIRABAYASHI ET AL 115 7.2.2 THE BRANCH-AND-BOUND ALGORITHM OF WELZ
116 7.2.3 THE BRANCH-AND-CUT ALGORITHM OF BELENGUER AND BENAVENT 116
7.2.4 THE CUTTING PLANE ALGORITHM OF BELENGUER AND BENAVENT 121 7.3
EXACT SEPARATION OF AGGREGATED CAPACITY CONSTRAINTS 122 7.3.1
COMPUTATIONAL RESULTS 123 7.4 SUMMARY AND CONCLUSIONS FOR THE CARP 124
7.5 IP FORMULATIONS FOR THE MM FC-CPP 125 7.6 A BRANCH-AND-CUT ALGORITHM
FOR THE MM IFC-CPP 125 7.6.1 IP FORMULATION 125 7.6.2 THE L-TOUR
CONSTRAINTS 127 7.6.3 SEPARATION 128 7.6.4 BRANCHING 130 7.6.5 FIXING
VARIABLES 131 7.6. IV CONTENTS A TEST INSTANCES AND COMPUTATIONAL
RESULTS 145 A.I TEST INSTANCES 145 A.I.I INSTANCES FROM THE LITERATURE
145 A.I.2 RANDOMLY GENERATED INSTANCES 147 A.2 COMPUTATIONAL RESULTS FOR
THE CARP 148 A.3 COMPUTATIONAL RESULTS FOR THE MM K-CPP 155 |
| any_adam_object | 1 |
| author | Ahr, Dino |
| author_facet | Ahr, Dino |
| author_role | aut |
| author_sort | Ahr, Dino |
| author_variant | d a da |
| building | Verbundindex |
| bvnumber | BV035813635 |
| ctrlnum | (OCoLC)455550036 (DE-599)DNB986348074 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV035813635</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20091112</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">091106s2007 d||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07,N49,0010</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09,A42,0871</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">986348074</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783836444965</subfield><subfield code="9">978-3-8364-4496-5</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783836444965</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)455550036</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB986348074</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ahr, Dino</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multiple postmen problems</subfield><subfield code="b">fundamentals and new algorithms</subfield><subfield code="c">Dino Ahr</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Saarbrücken</subfield><subfield code="b">Müller</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 198 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Heidelberg, Univ., Diss., 2004 u.d.T.: Ahr, Dino: Contributions to multiple postmen problems</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Branch-and-Cut-Methode</subfield><subfield code="0">(DE-588)4647789-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Briefträgerproblem</subfield><subfield code="0">(DE-588)4806884-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Briefträgerproblem</subfield><subfield code="0">(DE-588)4806884-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Branch-and-Cut-Methode</subfield><subfield code="0">(DE-588)4647789-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3023917&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018672506&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018672506</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035813635 |
| illustrated | Illustrated |
| indexdate | 2024-09-06T00:16:35Z |
| institution | BVB |
| isbn | 9783836444965 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018672506 |
| oclc_num | 455550036 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | XV, 198 S. graph. Darst. 24 cm |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Müller |
| record_format | marc |
| spelling | Ahr, Dino Verfasser aut Multiple postmen problems fundamentals and new algorithms Dino Ahr Saarbrücken Müller 2007 XV, 198 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Zugl.: Heidelberg, Univ., Diss., 2004 u.d.T.: Ahr, Dino: Contributions to multiple postmen problems Branch-and-Cut-Methode (DE-588)4647789-5 gnd rswk-swf Briefträgerproblem (DE-588)4806884-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Briefträgerproblem (DE-588)4806884-6 s Branch-and-Cut-Methode (DE-588)4647789-5 s DE-604 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3023917&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018672506&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Ahr, Dino Multiple postmen problems fundamentals and new algorithms Branch-and-Cut-Methode (DE-588)4647789-5 gnd Briefträgerproblem (DE-588)4806884-6 gnd |
| subject_GND | (DE-588)4647789-5 (DE-588)4806884-6 (DE-588)4113937-9 |
| title | Multiple postmen problems fundamentals and new algorithms |
| title_auth | Multiple postmen problems fundamentals and new algorithms |
| title_exact_search | Multiple postmen problems fundamentals and new algorithms |
| title_full | Multiple postmen problems fundamentals and new algorithms Dino Ahr |
| title_fullStr | Multiple postmen problems fundamentals and new algorithms Dino Ahr |
| title_full_unstemmed | Multiple postmen problems fundamentals and new algorithms Dino Ahr |
| title_short | Multiple postmen problems |
| title_sort | multiple postmen problems fundamentals and new algorithms |
| title_sub | fundamentals and new algorithms |
| topic | Branch-and-Cut-Methode (DE-588)4647789-5 gnd Briefträgerproblem (DE-588)4806884-6 gnd |
| topic_facet | Branch-and-Cut-Methode Briefträgerproblem Hochschulschrift |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3023917&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018672506&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT ahrdino multiplepostmenproblemsfundamentalsandnewalgorithms |