Approximate Dynamic Programming for Dynamic Vehicle Routing.

This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs). The book is written for both the applied researcher looking for suitable solution approaches for particular problems as well as for the theoretical researcher lookin...

Full description

Saved in:
Bibliographic Details
Format: eBook
Language: English
Published: Springer Verlag 2017.
Series: Operations research/computer science interfaces series ; 61.
Subjects:
Vehicle routing problem.
Transportation, Automotive > Dispatching.
Dynamic programming.
elektronické knihy
electronic books
ISBN: 9783319555119
9783319555102
Physical Description: 1 online resource

Cover

Table of contents

LEADER 06806cam a2200481M 4500
001 98079
003 CZ-ZlUTB
005 20240914111011.0
006 m o d
007 cr |n|||||||||
008 170425s2017 xx ob 001 0 eng d
040 |a YDX  |b eng  |e pn  |c YDX  |d N$T  |d EBLCP  |d UAB  |d N$T  |d MERER  |d N$T  |d ESU  |d AZU  |d UPM  |d OCLCF  |d OCLCQ  |d VT2  |d OTZ  |d IAS  |d OCLCQ  |d IOG  |d JG0  |d U3W  |d SNK  |d CAUOI  |d KSU  |d UWW  |d AU@  |d OCLCQ  |d UKMGB  |d BRX  |d UKAHL  |d OCLCQ  |d ERF  |d OCLCQ  |d SRU  |d UKUOP 
020 |a 9783319555119  |q (electronic bk.) 
020 |z 9783319555102 
024 7 |a 10.1007/978-3-319-55511-9  |2 doi 
035 |a (OCoLC)984187283  |z (OCoLC)983797036  |z (OCoLC)984656324  |z (OCoLC)985241050  |z (OCoLC)985394649  |z (OCoLC)985496971  |z (OCoLC)985658232  |z (OCoLC)985902634  |z (OCoLC)986117139  |z (OCoLC)986275432  |z (OCoLC)986663391  |z (OCoLC)986847783  |z (OCoLC)988384662  |z (OCoLC)1012064595  |z (OCoLC)1057425103  |z (OCoLC)1057667240  |z (OCoLC)1058388848  |z (OCoLC)1087006329  |z (OCoLC)1097092137  |z (OCoLC)1198252242  |z (OCoLC)1200074141 
245 0 0 |a Approximate Dynamic Programming for Dynamic Vehicle Routing. 
260 |b Springer Verlag  |c 2017. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a počítač  |b c  |2 rdamedia 
338 |a online zdroj  |b cr  |2 rdacarrier 
490 1 |a Operations Research/Computer Science Interfaces Series,  |x 1387-666X ;  |v 61 
505 0 |a Foreword; Acknowledgements; About this Book; Contents; Acronyms; List of Figures; List of Tables; Algorithms; 1 Introduction; 1.1 Prescriptive Analytics; 1.2 Scope of This Work; 1.3 Outline of the Following Chapters; 1.4 A Recipe for ADP in SDVRPs; 1.4.1 The Application; 1.4.2 The Model; 1.4.3 Anticipatory Approaches; Part I Dynamic Vehicle Routing; 2 Rich Vehicle Routing: Environment; 2.1 Vehicle Routing; 2.2 RVPR: Characteristics and Definition; 2.3 RVRPs in Logistics Management; 2.4 RVRPs in Hierarchical Decision Making; 2.5 Recent Developments of the RVRP-Environment. 
505 8 |a 2.5.1 E-Commerce and Globalization2.5.2 Urbanization and Demography; 2.5.3 Urban Environment and Municipal Regulations; 2.5.4 Technology; 2.5.5 Data and Forecasting; 2.6 Implications; 3 Rich Vehicle Routing: Applications; 3.1 General RVRP-Entities; 3.1.1 Infrastructure; 3.1.2 Vehicles; 3.1.3 Customers; 3.2 Plans; 3.3 Objectives; 3.3.1 Costs; 3.3.2 Reliability; 3.3.3 Objective Measures; 3.4 Constraints; 3.4.1 Time Windows; 3.4.2 Working Hours; 3.4.3 Capacities; 3.5 Drivers of Uncertainty; 3.5.1 Travel Times; 3.5.2 Service Times; 3.5.3 Demands; 3.5.4 Requests; 3.6 Classification. 
505 8 |a 3.7 Service Vehicles3.8 Transportation Vehicles; 3.8.1 Passenger Transportation; 3.8.2 Transportation of Goods; 3.9 Implications; 3.9.1 Decision Support; 3.9.2 Modeling of Planning Situations; 3.9.3 Modeling of Uncertainty; 3.9.4 Modeling of Subsequent Planning; 3.9.5 Modeling of Applications; 3.9.6 Modeling of Anticipation; 3.9.7 Anticipatory Methods; 4 Modeling; 4.1 Stochastic Dynamic Decision Problem; 4.1.1 Dynamic Decision Problems; 4.2 Markov Decision Process; 4.2.1 Definition; 4.2.2 Decision Policies and Problem Realizations; 4.3 Stochastic Dynamic Vehicle Routing. 
505 8 |a 4.4 Modeling Planning Situations4.4.1 Decision State; 4.4.2 Decision Making; 4.5 Modeling Uncertainty; 4.5.1 Deterministic Modeling; 4.5.2 Travel Time; 4.5.3 Service Time; 4.5.4 Demands; 4.5.5 Requests; 4.5.6 Stochastic Transitions in SDVRPs; 4.6 Modeling SDVRPs as MDPs; 4.6.1 Decision Points; 4.6.2 Travel Times; 4.6.3 Service Times; 4.6.4 Demands; 4.6.5 Requests; 4.7 Vehicle Routing with Recourse Actions; 4.8 Route-Based Markov Decision Process; 4.9 Implications; 4.9.1 Properties of SDVRP; 4.9.2 Definition, Reconstruction, and Simulation; 4.9.3 Anticipation and Prescriptive Analytics. 
505 8 |a 5 Anticipation5.1 Definition; 5.2 Anticipation in SDVRPs; 5.3 Perfect Anticipation; 5.3.1 Optimal Policies; 5.3.2 Derivation of Optimal Policies; 5.3.3 Limitations; 5.4 Classification of Anticipation; 5.4.1 Reactive Versus Non-reactive; 5.4.2 Implicit, Explicit, and Perfect; 5.4.3 Focus of Anticipation: Offline and Online; 5.5 Reactive Explicit Anticipation; 6 Anticipatory Solution Approaches; 6.1 Non-reactive Anticipation; 6.1.1 Non-reactive Implicit Anticipation; 6.1.2 Non-reactive Explicit Anticipation; 6.2 Reactive Anticipation; 6.2.1 Reactive Implicit Anticipation. 
506 |a Plný text je dostupný pouze z IP adres počítačů Univerzity Tomáše Bati ve Zlíně nebo vzdáleným přístupem pro zaměstnance a studenty 
520 |a This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs). The book is written for both the applied researcher looking for suitable solution approaches for particular problems as well as for the theoretical researcher looking for effective and efficient methods of stochastic dynamic optimization and approximate dynamic programming (ADP). To this end, the book contains two parts. In the first part, the general methodology required for modeling and approaching SDVRPs is presented. It presents adapted and new, general anticipatory methods of ADP tailored to the needs of dynamic vehicle routing. Since stochastic dynamic optimization is often complex and may not always be intuitive on first glance, the author accompanies the theoretical ADP-methodology with illustrative examples from the field of SDVRPs. The second part of this book then depicts the application of the theory to a specific SDVRP. The process starts from the real-world application. The author describes a SDVRP with stochastic customer requests often addressed in the literature, and then shows in detail how this problem can be modeled as a Markov decision process and presents several anticipatory solution approaches based on ADP. In an extensive computational study, he shows the advantages of the presented approaches compared to conventional heuristics. To allow deep insights in the functionality of ADP, he presents a comprehensive analysis of the ADP approaches. 
504 |a Includes bibliographical references and index. 
590 |a SpringerLink  |b Springer Complete eBooks 
650 0 |a Vehicle routing problem. 
650 0 |a Transportation, Automotive  |x Dispatching. 
650 0 |a Dynamic programming. 
655 7 |a elektronické knihy  |7 fd186907  |2 czenas 
655 9 |a electronic books  |2 eczenas 
776 0 8 |i Print version:  |t Approximate Dynamic Programming for Dynamic Vehicle Routing.  |d Springer Verlag 2017  |z 9783319555102  |z 3319555103  |w (OCoLC)973920106 
830 0 |a Operations research/computer science interfaces series ;  |v 61.  |x 1387-666X 
856 4 0 |u https://proxy.k.utb.cz/login?url=https://link.springer.com/10.1007/978-3-319-55511-9  |y Plný text 
992 |c NTK-SpringerBM 
999 |c 98079  |d 98079 
993 |x NEPOSILAT  |y EIZ 

Similar Items