Best Matching Theory & Applications (eBook)
XVIII, 231 Seiten
Springer International Publishing (Verlag)
978-3-319-46070-3 (ISBN)
Mismatch or best match? This book demonstrates that best matching of individual entities to each other is essential to ensure smooth conduct and successful competitiveness in any distributed system, natural and artificial. Interactions must be optimized through best matching in planning and scheduling, enterprise network design, transportation and construction planning, recruitment, problem solving, selective assembly, team formation, sensor network design, and more. Fundamentals of best matching in distributed and collaborative systems are explained by providing:
§ Methodical analysis of various multidimensional best matching processes
§ Comprehensive taxonomy, comparing different best matching problems and processes
§ Systematic identification of systems' hierarchy, nature of interactions, and distribution of decision-making and control functions
§ Practical formulation of solutions based on a library of best matching algorithms and protocols, ready for direct applications and apps development.
Designed for both academics and practitioners, oriented to systems engineers and applied operations researchers, diverse types of best matching processes are explained in production, manufacturing, business and service, based on a new reference model developed at Purdue University PRISM Center: 'The PRISM Taxonomy of Best Matching'. The book concludes with major challenges and guidelines for future basic and applied research in the area of best matching.
Foreword 8
Preface 10
About the Book 12
Contents 13
1 Introduction: Best Matching and Best Match 17
Abstract 17
1.1 What Is Best Matching? 17
1.2 Definitions and Scope 20
1.2.1 Distributed Systems 22
1.2.2 Collaboration Versus Competition 24
1.3 Best Matching in Practice 25
1.4 Summary 28
References 30
2 The PRISM Taxonomy of Best Matching 34
Abstract 34
2.1 Framework 34
2.1.1 D1: Sets of Individuals 36
2.1.2 D2: Matching Conditions 37
2.1.3 D3: Matching Criteria 41
2.1.4 D+: Time or Progression 44
2.1.5 The Prismatic Structure of the PRISM Taxonomy 45
2.2 Four Examples of the PRISM Taxonomy Application 45
2.2.1 Balancing Collaborative Assembly Lines /left( {M:1/RC,PR,RS/ - - ,WS} /right) 45
2.2.2 Part Pairing for Concurrent Loading-Machining /left( {1:1// - ,OS} /right) 46
2.2.3 Dynamic Teaming with Interdependent Preferences /left( {M:1/RC,IP/ {/,+/,} ,OS/DI,ES} /right) 48
2.2.4 Location-Allocation Decisions in CNO /left( {1:M:M/RC,PR,RS/ {/,+/,} /, - ,WS} /right) 50
2.3 Summary 52
References 56
3 Mathematical Models of Best Matching 58
Abstract 58
3.1 Why Mathematical Modeling for Best Matching? 58
3.2 D1. Sets 60
3.2.1 One-to-One Matching 61
3.2.2 Generalized Matching 62
3.2.3 Multi-Dimensional Matching 63
3.3 D2. Conditions 64
3.3.1 Resource-Constrained Matching 64
3.3.2 Matching with Precedence Relations 66
3.3.3 Matching with Resource Sharing 66
3.3.4 Matching with Interdependent Preferences 68
3.3.4.1 One-to-One Matching with IP 68
3.3.4.2 Many-to-One Matching with IP 70
3.3.5 Layered Matching 71
3.4 D3. Criteria 72
3.5 D+. Static Versus Dynamic Matching 74
3.6 Summary 75
References 77
4 Distributed Decision-Making and Best Matching 78
Abstract 78
4.1 Single Versus Multiple Decision-Makers 78
4.2 Distribution of Decisional Abilities 80
4.2.1 Example 1: Intelligent Warehouse Management Systems 83
4.2.2 Example 2: Precision Agriculture 85
4.2.3 Alternative Configurations—Advantages and Limitations 87
4.3 Nature of Interactions 89
4.4 Summary 91
References 94
5 Static and Centralized Matching 95
Abstract 95
5.1 Motivation for Using Algorithms 95
5.2 Heuristics and Exact Algorithms 97
5.2.1 Hungarian Method 97
5.2.2 Deferred Acceptance Algorithm 100
5.2.3 Lagrangian Relaxation Method 103
5.2.4 Branch-and-Bound Method 112
5.3 Metaheuristics 116
5.3.1 Genetic Algorithm (GA) 117
5.3.2 Greedy Randomized Adaptive Search Procedure (GRASP) 121
5.3.3 Ant Colony Optimization (ACO) 124
5.3.4 Tabu Search 128
5.4 Summary 132
References 136
6 Dynamic and Distributed Matching 138
Abstract 138
6.1 Why Are Static and Centralized Algorithms not Always Sufficient? 138
6.2 Real-Time Optimization 140
6.2.1 Periodic Review Method 142
6.2.2 Continuous Review Method 147
6.3 Distributed Control 155
6.3.1 Multi-agent Systems 155
6.3.2 Interaction Protocols 159
6.4 The “AI” Challenges (Artificial Intelligence Analytics and Informatics)
6.4.1 Artificial Intelligence 166
6.4.2 Analytics and Informatics 170
6.5 Summary 172
References 176
7 Extended Examples of Best Matching 179
Abstract 179
7.1 Understanding Through Analogy 179
7.2 E1: Collaborative Supply Networks ( {/varvec M}{:}/ 1/{/varvec RC},{/varvec RS}/ - ,{/varvec OS}/{/varvec DI} )
7.2.1 Mathematical Formulation 184
7.2.2 D+: Task Administration Protocol 186
7.2.3 Measured Impact 191
7.2.4 Discussion 192
7.3 E2: Collaborative Assembly Lines ( {/varvec M}{:}/ 1/{/varvec RC},{/varvec PR},{/varvec RS}/ - - - ,{/varvec GP}/{/varvec DI} )
7.3.1 Mathematical Formulation 196
7.3.2 D+: Collaborative Multi-agent System 200
7.3.3 Measured Impact 204
7.3.4 Discussion 204
7.4 E3: Clustering with Interdependent Preferences ( {/varvec M}{:}/ 1/{/varvec RC},{/varvec IP}/ {/,+/,} ,{/varvec OS}/{/varvec ES} )
7.4.1 Optimal Clustering: Genetic Algorithm (GA) 208
7.4.2 D+: Association/Dissociation 211
7.4.3 Measured Impact 213
7.4.4 Discussion 213
7.5 E4: Collaborative Service Enterprises ( 1{:}{/varvec M}{:}{/varvec M}/{/varvec RC},{/varvec RS}/ {/,+/,} - ,{/varvec WS} ) 214
7.5.1 Mathematical Formulation 216
7.5.2 Optimization: Tabu Search 218
7.5.3 Measured Impact 222
7.6 Summary 223
Appendix 1: Notation 225
References 229
8 Frontiers in Best Matching 232
Abstract 232
8.1 Emerging Technologies Dealing with Best Matching 232
8.1.1 Connected Robots 233
8.1.2 Cloud Manufacturing 233
8.2 Technical Challenges of Best Matching 234
8.2.1 Efficient Computation and Communication 234
8.2.2 Conflict and Error Detection and Prevention 235
8.2.3 Incentives for Collaboration 235
8.2.4 Data Availability and Reliability 236
8.3 Summary 237
References 239
9 Erratum to: Best Matching Theory & Applications
Erratum to:& #6
Index 241
| Erscheint lt. Verlag | 26.10.2016 |
|---|---|
| Reihe/Serie | Automation, Collaboration, & E-Services |
| Zusatzinfo | XVIII, 231 p. 57 illus., 48 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
| Technik ► Maschinenbau | |
| Wirtschaft ► Betriebswirtschaft / Management ► Logistik / Produktion | |
| Schlagworte | Automation • Best Matching • Distributed system • E-Collaboration • E-Service • e-work |
| ISBN-10 | 3-319-46070-6 / 3319460706 |
| ISBN-13 | 978-3-319-46070-3 / 9783319460703 |
| Haben Sie eine Frage zum Produkt? |
PDF (Wasserzeichen)Größe: 6,1 MB
DRM: Digitales Wasserzeichen
Dieses eBook enthält ein digitales Wasserzeichen und ist damit für Sie personalisiert. Bei einer missbräuchlichen Weitergabe des eBooks an Dritte ist eine Rückverfolgung an die Quelle möglich.
Dateiformat: PDF (Portable Document Format)
Mit einem festen Seitenlayout eignet sich die PDF besonders für Fachbücher mit Spalten, Tabellen und Abbildungen. Eine PDF kann auf fast allen Geräten angezeigt werden, ist aber für kleine Displays (Smartphone, eReader) nur eingeschränkt geeignet.
Systemvoraussetzungen:
PC/Mac: Mit einem PC oder Mac können Sie dieses eBook lesen. Sie benötigen dafür einen PDF-Viewer - z.B. den Adobe Reader oder Adobe Digital Editions.
eReader: Dieses eBook kann mit (fast) allen eBook-Readern gelesen werden. Mit dem amazon-Kindle ist es aber nicht kompatibel.
Smartphone/Tablet: Egal ob Apple oder Android, dieses eBook können Sie lesen. Sie benötigen dafür einen PDF-Viewer - z.B. die kostenlose Adobe Digital Editions-App.
Zusätzliches Feature: Online Lesen
Dieses eBook können Sie zusätzlich zum Download auch online im Webbrowser lesen.
Buying eBooks from abroad
For tax law reasons we can sell eBooks just within Germany and Switzerland. Regrettably we cannot fulfill eBook-orders from other countries.
aus dem Bereich
