Online stochastic combinatorial optimization / / Pascal Van Hentenryck and Russell Bent

• Autore: Van Hentenryck Pascal
• Pubblicazione: Cambridge, Mass., : MIT Press, ©2006
• Descrizione fisica: 1 online resource (247 p.)
• Disciplina: 003
• Soggetto topico: Stochastic processes; Combinatorial optimization; Online algorithms; Operations research
• Soggetto non controllato: COMPUTER SCIENCE/General
• Altri autori: BentRussell
• Note generali: Description based upon print version of record.
• Nota di bibliografia: Includes bibliographical references (p. [219]-227) and index.
• Nota di contenuto: ""Preface""; ""1 Introduction""; ""2 Online Stochastic Scheduling""; ""3 Theoretical Analysis""; ""4 Packet Scheduling""; ""5 Online Stochastic Reservations""; ""6 Online Multiknapsack Problems""; ""7 Vehicle Routing with Time Windows""; ""8 Online Stochastic Routing""; ""9 Online Vehicle Dispatching""; ""10 Online Vehicle Routing with Time Windows""; ""11 Learning Distributions""; ""12 Historical Sampling""; ""13 Markov Chance-Decision Processes""; ""References""; ""Index""
• Sommario/riassunto: "Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge. This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research."--Publisher's website.
• Titolo autorizzato: Online stochastic combinatorial optimization
• ISBN: 0-262-29998-4; 1-282-09683-4; 0-262-25715-7; 0-262-51347-1; 1-4294-7774-1
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910777797003321
• Lo trovi qui: Univ. Federico II